An improved branch-and-bound algorithm for the one-machine scheduling problem with delayed precedence constraints
Wenda Zhang, Jason J. Sauppe, Sheldon H. Jacobson
| Year of publication: |
2021
|
|---|---|
| Authors: | Zhang, Wenda ; Sauppe, Jason J. ; Jacobson, Sheldon H. |
| Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 33.2021, 3, p. 1091-1102
|
| Subject: | combinatorial optimization | one-machine scheduling | branch and bound | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Branch-and-Bound | Branch and Bound | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1287/ijoc.2020.0988 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10012631649