A note on reverse scheduling with maximum lateness objective
Year of publication: |
2013
|
---|---|
Authors: | Li, S. S. ; Brucker, Peter ; Ng, C. T. ; Cheng, T. C. E. ; Shakhlevich, N. V. |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 16.2013, 4, p. 417-422
|
Subject: | Reverse scheduling | Maximum lateness | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming | Durchlaufzeit | Lead time |
-
He, Cheng, (2016)
-
Hinder, Oliver, (2017)
-
Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines
Alhadi, Gais, (2020)
- More ...
-
A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
Ng, C. T., (2010)
-
Ng, C. T., (2010)
-
Ng, C. T., (2010)
- More ...