Comparison of some heuristic algorithms for the flow shop problem with parallel machines to minimize the total earliness, tardiness and waiting time
Year of publication: |
2001
|
---|---|
Authors: | Janiak, Adam ; Lichtenstein, Maciej |
Published in: |
Operations research proceedings 2000 : selected papers of the Symposium on Operations Research (OR 2000) ; Dresden, September 9 - 12, 2000. - Berlin : Springer, ISBN 3-540-41587-4. - 2001, p. 378-383
|
Subject: | Heuristik | Heuristics | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Theorie | Theory | Produktionssteuerung | Production control | Evolutionärer Algorithmus | Evolutionary algorithm | Durchlaufzeit | Lead time | Branch-and-Bound | Branch and Bound |
-
Rakrouki, Mohamed Ali, (2012)
-
Two-machine flowshop scheduling with a truncated learning function to minimize the makespan
Cheng, T. C. E., (2013)
-
Soares, Leonardo Cabral R., (2020)
- More ...
-
Hybrid flow-shop scheduling problems with multiprocessor task systems
Ogbreveuz, Ceyda, (2004)
-
Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion
Janiak, Adam, (2007)
-
Hybrid flow-shop scheduling problems with multiprocessor task systems
Oguz, Ceyda, (2004)
- More ...