Minimizing total earliness and tardiness on re-entrant batch processing machine with time windows. Issue 2 (4th March 2018)

• Record Type: Journal Article
• Authors: Jia, Wenyou; Chen, Hao; Liu, Li; Li, You
• Is Part Of: Mathematical and computer modelling of dynamical systems. Volume 24:Issue 2(2018)
• Page Start: 170
• Page End: 181
• Publication Date: 2018-03-04
• Subjects: Time window -- re-entrant batch processing machine -- scheduling -- decomposition method -- slack mixed integer linear programming; Engineering -- Mathematical models -- Periodicals; Computer simulation -- Periodicals; 515.39
• DOI: 10.1080/13873954.2017.1394327
• Languages: English
• ISSNs: 1387-3954

Abstract

ABSTRACT: The time window (TW) generalizes the concept of due date. The semiconductor wafer fabrication system is currently one of the most complex production processes, which has typical re-entrant batch processing machine (RBPM). RBPM is a bottleneck. This paper addresses a scheduling of RBPM with job-dependent TWs. According to a general modelling, an improved and new job-family-oriented modelling of the decomposition method that is based on the slack mixed integer linear programming is proposed. First, the complicated scheduling problem of RBPM is divided into sub-problems, which are executed circularly. Then, each one consists of updating, sequencing and dispatching. The objective is to minimize the total earliness and tardiness for job-dependent TWs. In order to evaluate the proposed modelling, the experiments are implemented on the real-time scheduling simulation platform and optimization toolkit ILOG CPLEX. The results show that the improved modelling obtains better solutions in less computation time.