Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Optimization of Injection Molding Shop Scheduling Based on the Two-Stage Genetic Algorithm

  • Conference paper
  • First Online:
The 19th International Conference on Industrial Engineering and Engineering Management

  • 1252 Accesses

Abstract

Injection molding shop Scheduling is a large-scale parallel machine scheduling with process constraints, time constraints, earliness/tardiness penalties and due window constraints. Given the complexity of injection molding shop scheduling, a two-stage genetic algorithm is presented: the first stage is to partition jobs to machines, and the second stage is to sequence jobs for each machine. A simulation model for solving injection molding shop scheduling problem is proposed. For determining the optimal starting time of a single machine, a rule-based heuristic algorithm is also proposed. The application demonstrates the reliability and validity of the algorithm and simulation model.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Balin S (2011) Non-identical parallel machine scheduling using genetic algorithm. Expert Syst Appl 38:6814–6821

    Article  Google Scholar 

  • Bean JC (1994) Genetic algorithms and random keys for sequencing and optimization. INFORMS J Comput 6(2):154–160

    Article  Google Scholar 

  • Cheng RW, Gen M (1997) Parallel machine scheduling problems using memetic algorithms. Comput Ind Eng 33:761–764

    Article  Google Scholar 

  • De-cai Huang, Yi-hua Zhu, Wan-liang Wang (2001) Earliness-tardiness job scheduling problem with a common due window on non-uniform machines. Syst Eng Theory Pract 21(4):64–69 (in Chinese)

    Google Scholar 

  • Feldmann M, Biskup D (2003) Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches. Comput Ind Eng 44:307–323

    Article  Google Scholar 

  • Hua Zhao, Ren-jun Wen, Xiao-hui Chen (2007) A study on the parallel machine scheduling problem based on individuality production mode. China Mech Eng 18(17):2058–2061 (in Chinese)

    Google Scholar 

  • Jia-quan Gao, Yu-shun Wang, Gui-xia He (2007) Earliness-tardiness job scheduling problem with a common due window on non-uniform machines. Comput Eng Appl 42(2):15–17 (in Chinese)

    Google Scholar 

  • Kocamaz M, Cicekli UG, Soyuer H (2009) A developed encoding method for parallel machine scheduling with permutation genetic algorithm. In: European and Mediterranean conference on information systems, EMCIS’2009, Izmir, 2009, pp 1–8

    Google Scholar 

  • Li Wang, Da-wei Li, Meng-guang Wang (2002) Genetic algorithm for parallel machine scheduling with due windows. J Syst Eng 17(1):45–49 (in Chinese)

    Google Scholar 

  • Min Liu, Cheng Wu (2002) Parallel genetic algorithm for solving parallel machine scheduling problem with different due window. Acta Automat Sin 26(2):258–262 (in Chinese)

    Google Scholar 

  • Min Liu, Cheng Wu, Wen-jun Yin (2001) Solving identical parallel machine production line scheduling problem with special procedure constraint by genetic algorithm. Acta Automat Sin 27(3):381–386 (in Chinese)

    Google Scholar 

  • Si-min Huang, Lin-ning Cai, Xiao-yue Zhang (2010) Parallel dedicated machine scheduling problem with sequence-dependent setups and a single server. Comput Ind Eng 58:165–174

    Article  Google Scholar 

  • Sourd F (2009) New exact algorithms for one-machine earliness-tardiness scheduling. INFORMS J Comput 21(1):167–175

    Article  Google Scholar 

  • Xing-chu Liu, Qian-chuan Zhao, Da-zhong Zheng (2000) Single machine earliness and tardiness scheduling problem with distinct due window using genetic algorithms. J Tsinghua Univ (Sci Technol) 40(7):59–62 (in Chinese)

    Google Scholar 

  • Zhong-yao Liu, Chong-jia Peng, Nai-qi Wu (2008) Production schedule based on tabu search algorithms. Contr Automat 24(6):56–58 (in Chinese)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mechatronics Engineering, Guangdong University of Technology, Guangzhou, China

    Jin-ping Zhou & Hu Fu

Authors
  1. Jin-ping Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hu Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jin-ping Zhou .

Editor information

Editors and Affiliations

  1. Industrial Engineering Institution of CM, 92 Wenjin Road, Nankai District, Tianjin, 300072, China, People's Republic

    Ershi Qi

  2. Industrial Engineering Institution of CM, 92 Wenjin Road, Nankai District, Tianjin, 300072, China, People's Republic

    Jiang Shen

  3. , College of Management and Economics, Tianjin University, 92 Wenjin Road, Tianjin, 300072, China, People's Republic

    Runliang Dou

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhou, Jp., Fu, H. (2013). Optimization of Injection Molding Shop Scheduling Based on the Two-Stage Genetic Algorithm. In: Qi, E., Shen, J., Dou, R. (eds) The 19th International Conference on Industrial Engineering and Engineering Management. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37270-4_6

Download citation

Publish with us

Policies and ethics

Search

Navigation