A competitive variable neighbourhood search algorithm for the blocking flow shop problem
Year of publication: |
2013
|
---|---|
Authors: | Ribas, Imma ; Companys, Ramon ; Tort-Martorell, Xavier |
Published in: |
European journal of industrial engineering : EJIE. - Genevè : Inderscience Enterprises Ltd., ISSN 1751-5254, ZDB-ID 2384377-9. - Vol. 7.2013, 6, p. 729-754
|
Subject: | heuristics | scheduling | flow shop | blocking | makespan | variable neighbourhood search | VNS | Heuristik | Heuristics | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Durchlaufzeit | Lead time | Theorie | Theory |
-
A hybrid algorithm to solve the stochastic flow shop scheduling problems with machine break down
Marichelvam, M. K., (2019)
-
Shen, Liji, (2014)
-
Two-machine flow shop and open shop scheduling problems with a single maintenance window
Mosheiov, Gur, (2018)
- More ...
-
Comparing three-step heuristics for the permutation flow shop problem
Ribas, Imma, (2010)
-
An iterated greedy algorithm for the flowshop scheduling problem with blocking
Ribas, Imma, (2011)
-
An efficient iterated local search algorithm for the total tardiness blocking flow shop problem
Ribas, Imma, (2013)
- More ...