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)
-
Liang, Zhongyuan, (2023)
-
Stability of a schedule minimising the makespan for processing jobs on identical machines
Sotskov, Jurij Nazarovič, (2023)
- More ...
-
A multi-objective memetic algorithm for the job-shop scheduling problem
Frutos, Mariano, (2013)
-
A memetic algorithm based on a NSGAII scheme for the flexible job-shop scheduling problem
Frutos, Mariano, (2010)
-
Visual attractiveness in routing problems : a review
Rossit, Diego Gabriel, (2019)
- More ...