• CN: 11-2187/TH
  • ISSN: 0577-6686

Journal of Mechanical Engineering ›› 2015, Vol. 51 ›› Issue (12): 192-201.doi: 10.3901/JME.2015.12.192

Previous Articles     Next Articles

Family-oriented to Optimize Scheduling Problem of Re-entrant Batch Processing Machine with Due Window

JIA Wenyou1, 2, JIANG Zhibin1, LI You1   

  1. 1.School of Mechanical Engineering, Shanghai Jiao Tong University, Shanghai 200240;
    2.School of Mechanical and Automotive Engineering, Anhui Polytechnic University, Wuhu 241000
  • Online:2015-06-20 Published:2015-06-20

Abstract: In the semiconductor wafer fabrication system, for re-entrant batch processing machine with distinct due window and incompatible families, the scheduling problem is known to be NP-complete. Three-phase rolling mixed integer linear programming algorithm is proposed. According to time-sequence-based and event-based combined decomposition strategy, the whole simulation time is decomposed into different rolling horizons. A horizon is corresponding to a sub-problem. Each sub-problem is divided into three phases:Sequencing, dispatching and updating. The real-time scheduling simulation platform and mixed integer linear programming are used to solve dispatching, updating, rolling and sequencing, respectively. 6 representative examples are conducted. The results show that family-oriented three-phase rolling mixed integer linear programming algorithm can obtain better solutions in less computation time.

Key words: distinct due window, family-oriented, re-entrant batch processing machine, three-phase rolling mixed integer linear programming

CLC Number: