Effective hybrid discrete artificial bee colony algorithms for the total flowtime minimization in the blocking flowshop problem
- 18 September 2012
- journal article
- research article
- Published by Springer Nature in The International Journal of Advanced Manufacturing Technology
- Vol. 67 (1-4) , 397-414
Abstract
No abstract availableKeywords
This publication has 35 references indexed in Scilit:
- A modified Artificial Bee Colony algorithm for real-parameter optimizationInformation Sciences, 2012
- An iterated greedy algorithm for the flowshop scheduling problem with blockingOmega, 2011
- Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithmsExpert Systems with Applications, 2010
- A heuristic to minimize total flow time in permutation flow shop☆Omega, 2009
- Efficient composite heuristics for total flowtime minimization in permutation flow shops☆Omega, 2009
- A discrete differential evolution algorithm for the permutation flowshop scheduling problemComputers & Industrial Engineering, 2008
- An estimation of distribution algorithm for nurse schedulingAnnals of Operations Research, 2007
- DE/EDA: A new evolutionary algorithm for global optimizationInformation Sciences, 2005
- Lower bounding schemes for flowshops with blocking in-processJournal of the Operational Research Society, 2001
- Flowshop sequencing problems with limited buffer storageInternational Journal of Production Research, 1990