Scheduling on Parallel Machines with Mold Constraints

2018 2nd International Conference on Advanced Technologies in Manufacturing and Materials Engineering

Zhao, H.D.^1 ; Gao, J.^1 ; Zhu, F.^1

China State Shipbuilding Corporation System Engineering Research Institute, Beijing, China^1

关键词: Computational results;    Identical parallel machines;    Makespan minimization;    Mold constraints;    NP-hard;    Parallel machine;    Scheduling problem;    Wafer fabrications;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/389/1/012005/pdf
DOI  :  10.1088/1757-899X/389/1/012005

来源: IOP

【 摘 要 】

This paper deals with makespan minimization scheduling problem on two identical parallel machines with mold constraint. The mold constraint in this problem is described as a kind of resource-constrained. In the production of wafer fabrication, two jobs with same mold cannot be processed on two parallel machines at the same time. This problem is quite common in practice, but there are few literatures relevant to this problem. Since the problem is NP-hard, a mathematical model is discussed to describe and solve the problem and a heuristic is proposed. Computational results show that the proposed heuristic can efficiently obtain good solutions for medium and large size problems.