Scheduling job shop with lot streaming and transportation through a modified artificial bee colony
Authors:
- 3 June 2013
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 51 (16) , 4930-4941
Abstract
We consider lot streaming problem in a job shop with consistent sub-lots and transportation, in which each lot is regarded as an individual job to reduce management complexity. A modified artificial bee colony (MABC) algorithm is proposed to minimise makespan. An effective two-phase decoding procedure is applied, in which a schedule is first built and then transportation tasks are dispatched. A swap and an insertion are used in the employed bee phase and the onlooker bee phase respectively to produce new solutions. No scouts are considered and the worst solution is replaced with the elite solution every certain cycles to enhance the diversity of the swarm. The testing results and the comparisons of MABC with some methods show that MABC performs better than the chosen algorithms on the considered problem.Keywords
This publication has 27 references indexed in Scilit:
- Job Shop Scheduling with the Best-so-far ABCEngineering Applications of Artificial Intelligence, 2012
- Jobshop lot streaming with routing flexibility, sequence-dependent setups, machine release dates and lag timeInternational Journal of Production Research, 2011
- A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithmsSwarm and Evolutionary Computation, 2011
- An integrated tabu search algorithm for the lot streaming problem in job shopsEuropean Journal of Operational Research, 2009
- The application of genetic algorithms to lot streaming in a job-shop scheduling problemInternational Journal of Production Research, 2009
- A hybrid genetic algorithm for flowshop lot streaming with setups and variable sublotsInternational Journal of Production Research, 2009
- Simulation analysis of lot streaming in job shops with transportation queue disciplinesSimulation Modelling Practice and Theory, 2009
- Lot streaming in a multiple product permutation flow shop with interminglingInternational Journal of Production Research, 2007
- A near-optimal heuristic for the sequencing problem in multiple-batch flow-shops with small equal sublotsOmega, 2001
- A generalized permutation approach to job shop scheduling with genetic algorithmsOR Spectrum, 1995