Two-machine flow shop scheduling with a common due date to maximize total early work
Year of publication: |
2022
|
---|---|
Authors: | Chen, Xin ; Miao, Qian ; Lin, Bertrand M. T. ; Sterna, Małgorzata ; Błażewicz, Jacek |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 300.2022, 2 (16.7.), p. 504-511
|
Subject: | Combinatorial optimization | Dynamic programming | Early and late work | Flow shop scheduling | FPTAS | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Durchlaufzeit | Lead time | Theorie | Theory |
-
A note on scheduling identical parallel machines with preemptions and setup times
Boudhar, Mourad, (2025)
-
Scheduling on identical machines with preemption and setup times
Haned, Amina, (2024)
-
Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines
Alhadi, Gais, (2020)
- More ...
-
Scheduling on parallel identical machines with late work criterion : offline and online cases
Chen, Xin, (2016)
-
Chen, Xin, (2020)
-
Mirror scheduling problems with early work and late work criteria
Chen, Xin, (2021)
- More ...