The lockmaster's problem
Year of publication: |
2016
|
---|---|
Authors: | Passchyn, Ward ; Coene, Sofie ; Briskorn, Dirk ; Hurink, Johann L. ; Spieksma, Frits C. R. ; Vanden Berghe, Greet |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 251.2016, 2 (1.6.), p. 432-441
|
Subject: | Transportation | Lock scheduling | Batch scheduling | Dynamic programming | Complexity | Scheduling-Verfahren | Scheduling problem | Heuristik | Heuristics | Dynamische Optimierung | USA | United States | Theorie | Theory |
-
Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences
Cheng, T. C. E., (2021)
-
A branch-and-price algorithm for the Aperiodic Multi-Period Service Scheduling Problem
Fernández, Elena, (2017)
-
Minimizing makespan on a single machine with release dates and inventory constraints
Davari, Morteza, (2020)
- More ...
-
Passchyn, Ward, (2016)
-
Passchyn, Ward, (2019)
-
Coene, Sofie, (2011)
- More ...