A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems
| Year of publication: |
2021
|
|---|---|
| Authors: | Rossit, Daniel A. ; Vásquez, Óscar C. ; Tohmé, Fernando ; Frutos, Mariano ; Safe, Martín D. |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 289.2021, 3 (16.3.), p. 841-854
|
| Subject: | Non-permutation flow shop scheduling problem | Makespan | Critical path | Unknown processing times | Structural and dominance properties | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Theorie | Theory |
-
Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
Fernandez-Viagas, Victor, (2020)
-
Minimising makespan in distributed assembly hybrid flowshop scheduling problems
Ying, Kuo-Ching, (2025)
-
Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences
Cheng, T. C. E., (2021)
- More ...
-
The Non-Permutation Flow-Shop scheduling problem : a literature review
Rossit, Daniel Alejandro, (2018)
-
Industry 4.0 : smart scheduling
Rossit, Daniel Alejandro, (2019)
-
Visual attractiveness in routing problems : a review
Rossit, Diego Gabriel, (2019)
- More ...