Development and analysis of constructive heuristic algorithms for flow shop scheduling problems with sequence-dependent setup times
- 7 November 2012
- journal article
- research article
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 67 (5-8) , 1337-1353
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- A bicriteria m-machine flowshop scheduling with sequence-dependent setup timesApplied Mathematical Modelling, 2010
- An improved heuristic for permutation flowshop schedulingInternational Journal of Information and Communication Technology, 2007
- A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up timesJournal of the Operational Research Society, 2006
- A new dynamic programming formulation of (n x m) flowshop sequencing problems with due datesInternational Journal of Production Research, 1998
- A heuristic for scheduling to minimize the sum of weighted flowtime of jobs in a flowshop with sequence-dependent setup times of jobsComputers & Industrial Engineering, 1997
- A simulated annealing heuristic for scheduling to minimize mean weighted tardiness in a flowshop with sequence-dependent setup times of jobs-a case studyProduction Planning & Control, 1997
- A Savings Index Heuristic Algorithm for Flowshop Scheduling with Sequence Dependent Set-up TimesJournal of the Operational Research Society, 1995
- Heuristics in flow shop scheduling with sequence dependent setup timesOmega, 1992
- A MILP model for the n -job, M -stage flowshop with sequence dependent set-up timesInternational Journal of Production Research, 1986
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954