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 |
-
Benmansour, Rachid, (2014)
-
Masmoudi, Malek, (2024)
-
Procedures for the bin packing problem with precedence constraints
Pereira, Jordi, (2016)
- More ...
-
Sewell, Edward C., (2012)
-
Finding preferred subsets of Pareto optimal solutions
Kao, Gio K., (2008)
-
Maximizing the effectiveness of a pediatric vaccine formulary while prohibiting extraimmunization
Hall, Shane N., (2008)
- More ...