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

Jin-ping Zhou () and Hu Fu
Additional contact information
Jin-ping Zhou: Guangdong University of Technology
Hu Fu: Guangdong University of Technology

Chapter Chapter 6 in The 19th International Conference on Industrial Engineering and Engineering Management, 2013, pp 59-69 from Springer

Abstract: 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.

Keywords: Due window; Earliness/tardiness penalties; Injection molding; Parallel machine scheduling; Procedure constraint (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-37270-4_6

Ordering information: This item can be ordered from
http://www.springer.com/9783642372704

DOI: 10.1007/978-3-642-37270-4_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().