Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
Year of publication: |
2020
|
---|---|
Authors: | Chen, Xin ; Liang, Yage ; Sterna, Małgorzata ; Wang, Wen ; Błażewicz, Jacek |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 284.2020, 1 (1.7.), p. 67-74
|
Subject: | Early work | Fully polynomial time approximation scheme | Late work | Parallel identical machines | Scheduling | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Produktionssteuerung | Production control |
-
Parallel machine scheduling problems with common flow-allowance
Mor, Baruch, (2012)
-
Atsmony, Matan, (2023)
-
Mirror scheduling problems with early work and late work criteria
Chen, Xin, (2021)
- More ...
-
Scheduling on parallel identical machines with late work criterion : offline and online cases
Chen, Xin, (2016)
-
Mirror scheduling problems with early work and late work criteria
Chen, Xin, (2021)
-
Two-machine flow shop scheduling with a common due date to maximize total early work
Chen, Xin, (2022)
- More ...