Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
- 16 August 2005
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 165 (1), 34-54
- https://doi.org/10.1016/j.ejor.2004.01.022
Abstract
No abstract availableThis publication has 34 references indexed in Scilit:
- New heuristics for no-wait flowshops to minimize makespanComputers & Operations Research, 2003
- Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with genetic algorithmsJournal of the Operational Research Society, 2003
- A Robust Genetic Algorithm for Resource Allocation in Project SchedulingAnnals of Operations Research, 2001
- A REVIEW OF FLOWSHOP SCHEDULING RESEARCH WITH SETUP TIMESProduction and Operations Management, 2000
- A review of scheduling research involving setup considerationsOmega, 1999
- A Savings Index Heuristic Algorithm for Flowshop Scheduling with Sequence Dependent Set-up TimesJournal of the Operational Research Society, 1995
- An application of genetic algorithms for flow shop problemsEuropean Journal of Operational Research, 1995
- The Complexity of Flowshop and Jobshop SchedulingMathematics of Operations Research, 1976
- Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approachNaval Research Logistics Quarterly, 1974
- A Heuristic Algorithm for the n Job, m Machine Sequencing ProblemManagement Science, 1970