Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences
Year of publication: |
2021
|
---|---|
Authors: | Cheng, T. C. E. ; KravĨenko, Svetlana A. ; Lin, Bertrand M. T. |
Published in: |
Journal of the Operational Research Society. - London : Taylor and Francis, ISSN 1476-9360, ZDB-ID 2007775-0. - Vol. 72.2021, 10, p. 2286-2289
|
Subject: | complexity | dynamic programming | fixed job sequence | makespan | Parallel machines | single server | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Durchlaufzeit | Lead time | Dynamische Optimierung | Dynamic programming | Produktionssteuerung | Production control | Heuristik | Heuristics | Algorithmus | Algorithm |
-
Single machine scheduling problems with generalised due-dates and job-rejection
Gerstl, Enrique, (2017)
-
Scheduling on parallel dedicated machines with job rejection
Mor, Baruch, (2024)
-
Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence
Lin, Bertrand M. T., (2017)
- More ...
-
On scheduling of step-improving jobs to minimize the total weighted completion time
Cheng, T. C. E., (2024)
-
Innovative quick response programs in logistics and supply chain management
Cheng, T. C. E., (2010)
-
Cheng, T. C. E., (1988)
- More ...