An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times
Authors:
- Korhan KarabulutKKKorhan Karabulut
- Hande ÖztopHÖHande Öztop
- Damla KizilayDKDamla Kizilay
- M. Fatih TasgetirenMTM. Fatih Tasgetiren
- Levent KandillerLKLevent Kandiller
- 31 January 2022
- journal article
- research article
- Published by Elsevier in Computers & Operations Research
- Vol. 142
Abstract
No abstract availableKeywords
This publication has 51 references indexed in Scilit:
- General flowshop scheduling problem with the sequence dependent setup times: A heuristic approachInformation Sciences, 2013
- The Distributed Assembly Permutation Flowshop Scheduling ProblemInternational Journal of Production Research, 2013
- A Knowledge-based Genetic Algorithm for Permutation Flowshop Scheduling Problems with Multiple FactoriesInternational Journal of Advancements in Computing Technology, 2012
- Comparison of Heuristic for Flow Shop Scheduling Problems with Sequence Dependent Setup TimeAdvanced Materials Research, 2011
- The distributed permutation flowshop scheduling problemComputers & Operations Research, 2010
- An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectivesEuropean Journal of Operational Research, 2008
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problemEuropean Journal of Operational Research, 2007
- Record Breaking Optimization Results Using the Ruin and Recreate PrincipleJournal of Computational Physics, 2000
- A branch-and-bound algorithm for permutation flow shops with sequence-dependent setup timesIIE Transactions, 1999
- A heuristic algorithm for the m-machine, n-job flow-shop sequencing problemOmega, 1983