Distributed permutation flowshop scheduling problem with total completion time objective
Year of publication: |
2021
|
---|---|
Authors: | Ali, Arshad ; Gajpal, Yuvraj ; ElMekkawy, Tarek Y. |
Published in: |
Opsearch : journal of the Operational Research Society of India. - New Delhi : Springer India, ISSN 0975-0320, ZDB-ID 2516085-0. - Vol. 58.2021, 2, p. 425-447
|
Subject: | Parallel flowshop | Distributed permutation flowshop | Tabu search | Total completion time | Scheduling | Metaheuristics | Scheduling-Verfahren | Scheduling problem | Heuristik | Heuristics | Durchlaufzeit | Lead time | Evolutionärer Algorithmus | Evolutionary algorithm | Theorie | Theory |
-
Fernandez-Viagas, Victor, (2015)
-
Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm
Lin, Shih Wei, (2013)
-
Fekih, Asma, (2020)
- More ...
-
Vehicle routing problem in omni-channel retailing distribution systems
Abdulkader, M. M. S., (2018)
-
Cross-training policies for repair shops with spare part inventories
Sleptchenko, Andrei, (2019)
-
A sorting based efficient heuristic for pooled repair shop designs
Turan, Hasan Hüseyin, (2020)
- More ...