An Artificial Bee Colony Algorithm Based on Problem Data Properties for Scheduling Job Shops
Author:
- Rui ZhangRZRui Zhang
Open Access
- 1 January 2011
- journal article
- Published by Elsevier in Procedia Engineering
- Vol. 23, 131-136
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (61104176)
This publication has 7 references indexed in Scilit:
- A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local searchInternational Journal of Production Economics, 2011
- A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problemThe International Journal of Advanced Manufacturing Technology, 2010
- Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithmEuropean Journal of Operational Research, 2009
- Ant colony optimisation with parameterised search space for the job shop scheduling problemInternational Journal of Production Research, 2009
- Particle swarm optimization and differential evolution for the single machine total weighted tardiness problemInternational Journal of Production Research, 2006
- A hybrid particle swarm optimization approach for the job-shop scheduling problemThe International Journal of Advanced Manufacturing Technology, 2005
- No free lunch theorems for optimizationIEEE Transactions on Evolutionary Computation, 1997