A new hybrid parallel algorithm for consistent-sized batch splitting job shop scheduling on alternative machines with forbidden intervals
- 186 Downloads
Considering alternative machines for operations, forbidden intervals during which machines cannot be available and a job’s batch size greater than one in the real manufacturing environment, this paper studies the batch splitting scheduling problem on alternative machines with forbidden intervals, based on the objective to minimize the makespan. A scheduling model is established, taking before-arrival set-up, processing, and transfer time into account. And a new hybrid parallel algorithm, based on differential evolution and genetic algorithm, is brought forward to solve both the batch splitting problem and the batch scheduling problem by assuming a common number of sub-batches in advance. A solution consists of the actual optimum number of sub-batches for each job, the optimum batch size for each sub-batch, and the optimum sequence of operations for these sub-batches. Experiments on the performance of the proposed algorithm under different common numbers of sub-batches are carried out. The results of simulations indicate that the algorithm is feasible and efficient.
KeywordsConsistent-sized batch splitting scheduling Forbidden intervals Differential evolution algorithm Alternative machines
Unable to display preview. Download preview PDF.
- 1.Smunt TL, Buss AH, Kropp DH (1996) Lot splitting in stochastic flow shop and job shop environments. Decis Sci 27(2):215–238Google Scholar
- 5.Sun ZJ, An J, Huang WQ (2008) Lot scheduling with multiple process routes in job shop. China Mech Eng 19(2):183–187Google Scholar
- 12.Liu GD, Luh PB (1996) Scheduling job shops with transfer lots. Proceedings of the (1996) IEEE International Conference on Robotics and Automation. IEEE, Piscataway, NJ, pp 2523–2528Google Scholar
- 17.Wang WL, Wu QD (2007) Intelligence algorithms of production scheduling and application. Science Press, BeijingGoogle Scholar
- 18.An J (2005) The job shop scheduling problem with alternative machine in the batch process. Nanjing University of Aeronautics & Astronautics, Nanjing 43-53Google Scholar
- 19.Lin N, Meng B, Fan YQ (2007) Hybrid genetic algorithm for multiple process and batch scheduling in job-shop. Jour Beijing Univ Aero & Astro 33(12):1471–1476Google Scholar
- 21.Wang HY, Zhao YW, Xu XL, Wang WL (2008) A batch splitting job shop scheduling problem with bounded batch sizes under multiple-resource constraints using genetic algorithm. Proceedings of the 2008 IEEE International Conference on Cybernetics and Intelligent Systems. 220–225Google Scholar