On permutation schedules for two-machine flow shops with buffer constraints and constant processing times on one machine
Year of publication: |
2022
|
---|---|
Authors: | Geser, Philine ; Le Hoang Thanh ; Hartmann, Tom ; Middendorf, Martin |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 303.2022, 2 (1.12.), p. 593-601
|
Subject: | Constant Processing Times | Permutation Schedules, | Scheduling | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Produktionssteuerung | Production control | Theorie | Theory | Heuristik | Heuristics |
-
An efficient iterated local search algorithm for the total tardiness blocking flow shop problem
Ribas, Imma, (2013)
-
Zhou, Shengchao, (2014)
-
Rossi, Andrea, (2013)
- More ...
-
Refined ranking relations for selection of solutions in multi objective metaheuristics
Moritz, Ruby L.V., (2015)
-
Merkle, Daniel, (2006)
-
Improved heuristics and a genetic algorithm for finding short supersequences
Branke, Jürgen, (1998)
- More ...