On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
- 1 May 2014
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 45, 60-67
- https://doi.org/10.1016/j.cor.2013.12.012
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- New high performing heuristics for minimizing makespan in permutation flowshopsOmega, 2009
- A discrete differential evolution algorithm for the permutation flowshop scheduling problemComputers & Industrial Engineering, 2008
- On the NEH heuristic for minimizing the makespan in permutation flow shopsOmega, 2007
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objectiveJournal of the Operational Research Society, 2004
- An efficient constructive heuristic for flowtime minimisation in permutation flow shopsOmega, 2003
- Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problemInternational Journal of Production Research, 2003
- A high quality solution constructive heuristic for flow shop sequencingJournal of the Operational Research Society, 2002
- A comparison of four methods for minimizing total tardiness on a single processor with sequence dependent setup timesOmega, 2000
- A heuristic algorithm for the m-machine, n-job flow-shop sequencing problemOmega, 1983
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954