Advertisement

A new hybrid parallel algorithm for consistent-sized batch splitting job shop scheduling on alternative machines with forbidden intervals

  • Yan-wei ZhaoEmail author
  • Hai-yan Wang
  • Xin-li Xu
  • Wan-liang Wang
ORIGINAL ARTICLE

Abstract

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.

Keywords

Consistent-sized batch splitting scheduling Forbidden intervals Differential evolution algorithm Alternative machines 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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
  2. 2.
    Martin CH (2009) A hybrid genetic algorithm/mathematical programming approach to the multi-family flowshop scheduling problem with lot streaming. Omega 37(1):126–137CrossRefGoogle Scholar
  3. 3.
    Trietsch D, Baker KR (1993) Basic techniques for lot streaming. Oper Res 41(6):1065–1076zbMATHCrossRefGoogle Scholar
  4. 4.
    Pan QK, Zhu JY (2004) Optimization method for a job-shop scheduling problem with alternative machines in the batch process. Chinese Journ Mech Eng 40(4):36–39CrossRefGoogle Scholar
  5. 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
  6. 6.
    Low C, Hsu CM, Huang KI (2004) Benefits of lot splitting in job-shop scheduling. Int J Adv Manuf Technol 24:773–780. doi: 10.1007/s00170-003-1785-9 CrossRefGoogle Scholar
  7. 7.
    Mosheiov G, Oron D (2008) A single machine batch scheduling problem with bounded batch size. Eur J Oper Res 187:1069–1079zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Yuan JJ, Qi XL, Lu LF, Li WH (2008) Single machine unbounded parallel-batch scheduling with forbidden intervals. Eur J Oper Res 186:1212–1217zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Kropp DH, Smunt TL (1990) Optimal and heuristic lot splitting in a flow shop. Decis Sci 20:691–709CrossRefGoogle Scholar
  10. 10.
    Edis RS, Ornek A (2009) Simulation analysis of lot streaming in job shops with transportation queue disciplines. Simul Model Pract Theory 17(2):442–453CrossRefGoogle Scholar
  11. 11.
    Jin B, Luh PB, Thakur LS (1999) An effective optimization-based algorithm for job shop scheduling with fixed-size transfer lots. J Manuf Syst 18(4):284–300CrossRefGoogle Scholar
  12. 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
  13. 13.
    Marimuthu S, Ponnambalam SG, Jawahar N (2008) Evolutionary algorithms for scheduling m-machine flow shop with lot streaming. Robot Comput-Integr Manuf 24:125–139CrossRefGoogle Scholar
  14. 14.
    Kumar S, Bagchi TP, Sriskandarajah C (2000) Lot streaming and scheduling heuristics for m-machine no-wait flow shops. Comput Ind Eng 38:149–172CrossRefGoogle Scholar
  15. 15.
    Kim K, Jeong IJ (2007) Flow shop scheduling with no-wait flexible lot streaming using an adaptive genetic algorithm. Int J Adv Manuf Technol. doi: 10.1007/s00170-007-1236-0 Google Scholar
  16. 16.
    Storn R, Price K (1997) Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341–359zbMATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Wang WL, Wu QD (2007) Intelligence algorithms of production scheduling and application. Science Press, BeijingGoogle Scholar
  18. 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. 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
  20. 20.
    Qian B, Wang L, Huang DX, Wang X (2008) Scheduling multi-objective job shops using a memetic algorithm based on differential evolution. Int J Adv Manuf Technol 35(9–10):1014–1027CrossRefGoogle Scholar
  21. 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

Copyright information

© Springer-Verlag London Limited 2009

Authors and Affiliations

  • Yan-wei Zhao
    • 1
    Email author
  • Hai-yan Wang
    • 1
  • Xin-li Xu
    • 1
  • Wan-liang Wang
    • 1
  1. 1.Key Laboratory of Mechanical Manufacture and Automation of Ministry of EducationZhejiang University of TechnologyHangzhouChina

Personalised recommendations