Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system
Year of publication: |
2009
|
---|---|
Authors: | Su, Ling-huey |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 36.2009, 2, p. 461-471
|
Subject: | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Algorithmus | Algorithm | Theorie | Theory |
-
Madraki, Golshan, (2018)
-
An O(n log n) algorithm for the two-machine flow shop problem with variable machine speeds
Hoesel, C. P. van, (1993)
-
A note: common due data assignment for a single machine scheduling with the rate-modifying activity
Gordon, Valery S., (2009)
- More ...
-
Two-agent scheduling in open shops subject to machine availability and eligibility constraints
Su, Ling-Huey, (2015)
-
Su, Ling-Huey, (2008)
-
Infinite capacity planning for IC packaging plants
Chen, James C., (2010)
- More ...