Single-machine scheduling problems with generalized preemption
Year of publication: |
2009
|
---|---|
Authors: | Agnetis, Alessandro ; Alfieri, Arianna ; Nicosia, Gaia |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 21.2009, 1, p. 1-12
|
Subject: | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Branch-and-Bound | Branch and Bound |
-
Zhang, Wenda, (2021)
-
Scheduling piecewise linear deteriorating jobs to minimize makespan in a two-machine flowshop
Jafari-Nodoushan, Abbasali, (2021)
-
Branch, bound and remember algorithm for two-sided assembly line balancing problem
Li, Zixiang, (2020)
- More ...
-
Assessing the quality of heuristic solutions to parallel machines min-max scheduling problems
Agnetis, Alessandro, (2009)
-
Single-Machine Scheduling Problems with Generalized Preemption
Agnetis, Alessandro, (2009)
-
Assessing the quality of heuristic solutions to parallel machines min–max scheduling problems
Agnetis, Alessandro, (2009)
- More ...