A New CP-Approach for a Parallel Machine Scheduling Problem with Time Constraints on Machine Qualifications

This paper considers the scheduling of job families on parallel machines with time constraints on machine qualifications. In this problem, each job belongs to a family and a family can only be executed on a subset of qualified machines. In addition, machines can lose their qualifications during the schedule. Indeed, if no job of a family is scheduled on a machine during a given amount of time, the machine loses its qualification for this family. The goal is to minimize the sum of job completion times, i.e. the flow time, while maximizing the number of qualifications at the end of the schedule. The paper presents a new Constraint Programming (CP) model taking more advantages of the CP feature to model machine disqualifications. This model is compared with two existing models: an Integer Linear Programming (ILP) model and a Constraint Programming model. The experiments show that the new CP model outperforms the other model when the priority is given to the number of disqualifications objective. Furthermore, it is competitive with the other model when the flow time objective is prioritized.

[1]  Stéphane Dauzère-Pérès,et al.  Integration of scheduling and advanced process control in semiconductor manufacturing: review and outlook , 2014, 2014 IEEE International Conference on Automation Science and Engineering (CASE).

[2]  James Moyne,et al.  Run-to-Run Control in Semiconductor Manufacturing , 2000 .

[3]  Armin Wolf,et al.  Constraint-Based Task Scheduling with Sequence Dependent Setup Times, Time Windows and Breaks , 2009, GI Jahrestagung.

[4]  Fei Qiao,et al.  The impact of the qual-run requirements of APC on the scheduling performance in semiconductor manufacturing , 2008, 2008 IEEE International Conference on Automation Science and Engineering.

[5]  Stéphane Dauzère-Pérès,et al.  Parallel machine scheduling with time constraints on machine qualifications , 2019, Comput. Oper. Res..

[6]  Philippe Laborie,et al.  Reasoning with Conditional Time-Intervals , 2008, FLAIRS.

[7]  Petr Vilím,et al.  Reasoning with Conditional Time-Intervals. Part II: An Algebraical Model for Resources , 2009, FLAIRS.

[8]  Tianhong Pan,et al.  Survey on Run-to-Run Control Algorithms in High-Mix Semiconductor Manufacturing Processes , 2015, IEEE Transactions on Industrial Informatics.

[9]  John W. Fowler,et al.  A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations , 2011, J. Sched..

[10]  Yiwei Cai,et al.  Single-machine scheduling with advanced process control constraints , 2012, J. Sched..

[11]  Stéphane Dauzère-Pérès,et al.  Scheduling job families on non-identical parallel machines with time constraints , 2011, WSC 2011.

[12]  John Musacchio,et al.  On the utility of run to run control in semiconductor manufacturing , 1997, 1997 IEEE International Symposium on Semiconductor Manufacturing Conference Proceedings (Cat. No.97CH36023).

[13]  Nader Jedidi,et al.  Feedforward Run-to-Run Control for Reduced Parametric Transistor Variation in CMOS Logic 0.13 $\mu{\rm m}$ Technology , 2011, IEEE Transactions on Semiconductor Manufacturing.