An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem
Year of publication: |
2013
|
---|---|
Authors: | Gao, Jian ; Chen, Rong ; Wu, Dong |
Published in: |
International journal of production research. - London : Taylor & Francis, ISSN 0020-7543, ZDB-ID 160477-6. - Vol. 51.2013, 3 (1.2.), p. 641-651
|
Subject: | distributed scheduling | flowshop | sequence swapping | tabu search | Scheduling-Verfahren | Scheduling problem | Heuristik | Heuristics | Theorie | Theory | Algorithmus | Algorithm | Durchlaufzeit | Lead time |
-
A hybrid Tabu sample-sort simulated annealing approach for solving distributed scheduling problem
Chan, Felix Tung Sun, (2013)
-
Chain-reentrant shop with an exact time lag : new results
Amrouche, Karim, (2017)
-
A generalized constructive algorithm using insertion-based
Danilovic, Milos, (2016)
- More ...
-
An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem
Gao, Jian, (2013)
-
Interfirm networks and search-transfer problem : the role of geographic proximity
Wu, Dong, (2020)
-
Wu, Dong, (2010)
- More ...