A comparison of local search algorithms with population-based algorithms in hybrid flow shop scheduling problems with realistic characteristics
- 7 August 2015
- journal article
- research article
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 83 (5-8) , 1135-1151
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Bi-criteria group scheduling in hybrid flowshopsInternational Journal of Production Economics, 2013
- Real-time scheduling for reentrant hybrid flow shops: A decision tree based mechanism and its application to a TFT-LCD lineExpert Systems with Applications, 2011
- Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffersComputers & Industrial Engineering, 2009
- Bottleneck-based heuristics to minimize total tardiness for the flexible flow line with unrelated parallel machinesComputers & Industrial Engineering, 2009
- A memetic algorithm-based heuristic for a scheduling problem in printed circuit board assemblyComputers & Industrial Engineering, 2009
- A state-of-the-art review on scheduling with learning effectsEuropean Journal of Operational Research, 2008
- Unrelated parallel machine scheduling with setup times using simulated annealingRobotics and Computer-Integrated Manufacturing, 2002
- Scheduling a flowline manufacturing cell with sequence dependent family setup timesEuropean Journal of Operational Research, 2000
- Les problèmes d'ordonnancement de type flow-shop hybride : état de l'artRAIRO - Operations Research, 1999
- Simulated annealing for permutation flow-shop schedulingOmega, 1989