A new hybrid ant colony algorithm for scheduling of no-wait flowshop
- 4 July 2016
- journal article
- research article
- Published by Springer Nature in Operational Research
- Vol. 18 (1) , 55-74
Abstract
No abstract availableKeywords
This publication has 50 references indexed in Scilit:
- Energy-efficient scheduling for a flexible flow shop using an improved genetic-simulated annealing algorithmRobotics and Computer-Integrated Manufacturing, 2013
- A hybrid discrete artificial bee colony algorithm for permutation flowshop scheduling problemApplied Soft Computing, 2013
- Makespan minimization on single batch-processing machine via ant colony optimizationComputers & Operations Research, 2012
- A simulated annealing algorithm for the job shop cell scheduling problem with intercellular moves and reentrant partsComputers & Industrial Engineering, 2011
- A DE-based approach to no-wait flow-shop schedulingComputers & Industrial Engineering, 2009
- Heuristic for no-wait flow shops with makespan minimizationInternational Journal of Production Research, 2008
- Solving the airline crew recovery problem by a genetic algorithm with local improvementOperational Research, 2005
- Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion timeComputers & Industrial Engineering, 2004
- A No-Wait Flowshop Scheduling Heuristic to Minimize MakespanJournal of the Operational Research Society, 1994
- A heuristic algorithm for the m-machine, n-job flow-shop sequencing problemOmega, 1983