A branch, bound, and remember algorithm for the 1|r i |S t i scheduling problem
Year of publication: |
2009
|
---|---|
Authors: | Kao, Gio K. ; Sewell, Edward C. ; Jacobson, Sheldon H. |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 12.2009, 2, p. 163-175
|
Subject: | Scheduling-Verfahren | Scheduling problem | Branch-and-Bound | Branch and Bound | Dynamische Optimierung | Dynamic programming | Algorithmus | Algorithm | Theorie | Theory |
-
Srirangacharyulu, B., (2013)
-
An enhanced branch-and-bound algorithm for the talent scheduling problem
Qin, Hu, (2016)
-
A note on scheduling identical parallel machines with preemptions and setup times
Boudhar, Mourad, (2025)
- More ...
-
Finding preferred subsets of Pareto optimal solutions
Kao, Gio K., (2008)
-
King, Douglas M., (2012)
-
Sauppe, Jason J., (2014)
- More ...