A branch-and-bound algorithm for the prize-collecting single-machine scheduling problem with deadlines and total tardiness minimization
Roberto Cordone, Pierre Hosteins, Giovanni Righini
| Year of publication: |
2018
|
|---|---|
| Authors: | Cordone, Roberto ; Hosteins, Pierre ; Righini, Giovanni |
| Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 30.2018, 1, p. 168-180
|
| Subject: | prize-collecting | single-machine scheduling | integer linear programming | branch and bound | Scheduling-Verfahren | Scheduling problem | Branch-and-Bound | Branch and Bound | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1287/ijoc.2017.0772 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10011848225