Single-machine scheduling problem considering jobs'release times and flexible maintenances

被引：0
|
作者：
Li X. [1 ]
Si J. [1 ]
Yin C. [1 ]
Li Y. [1 ]
机构：
[1] School of Mines, China University of Mining and Technology, Xuzhou
来源：
Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS | 2023年 / 29卷 / 02期
基金：
中国博士后科学基金; 中国国家自然科学基金;
关键词：
flexible maintenance; heuristic algorithms; release time; single-machine scheduling; wafer cleaning;
D O I：
10.13196/j.cims.2023.02.019
中图分类号：
学科分类号：
摘要：
Aiming at the joint optimization problem of production scheduling considering cleaning and maintenance in wafer manufacturing process, to minimizing the objective of maximum completion time, the processing sequence of workpiece and the execution time of maintenance activities were optimized. The problem was proved to be NP hard, and an integer programming model was established and linearized. Combined with the characteristics of batch scheduling problem under the constraint of machine service age, the solution properties were proved, and the heuristic algorithm named Earliest Release Date-Longest Processing Time-Best Fit Longest Dirt (ERD-LTT-BFLD) was designed to solve the problem. A lower bound algorithm considering the release time and cleaning activity constraints was constructed. To verify the effectiveness of the proposed algorithm for different scale instances, the performance of the proposed heuristic algorithm was compared with the results from CPLEX and the lower bound algorithm in simulation experiments. © 2023 CIMS. All rights reserved.
引用
收藏
页码：581 / 592
页数：11
相关论文
共 19 条
  • [1] LU Z Q, GUI W W, HAN X L., Integrated production and preventive maintenance scheduling for a single machine with failure uncertainty, Computers & Industrial Engineering, 80, 2, pp. 236-244, (2015)
  • [2] LIAO C J, CHEN W J., Single-machine scheduling with periodic maintenance and nonresumable jobs, Computers cooperations Research, 30, 9, pp. 1335-1347, (2003)
  • [3] LEE C Y., Machine scheduling with an availability constraint, Journal of Global Optimization, 9, 3-4, pp. 395-416, (1996)
  • [4] KACEM I, CHU C., Efficient branch-and-bound algorithm for minimizing the weighted sum of completion times on a single machine with one availability constraint, International Journal of Production Economics, 112, 1, pp. 138-150, (2008)
  • [5] QI X, CHEN T, TU F., Scheduling the maintenance on a single machine, Journal of the Operational Research Society, 50, 10, pp. 1071-1078, (1999)
  • [6] GRAVES G H, LEE C., Scheduling maintenance and semire-sumable jobs on a single machine, Naval Research Logistics, 46, 7, pp. 845-863, (1999)
  • [7] ZHANG Lihua, TU Bengsheng, Single machine scheduling with controllable maintenance [J], Journal of Jilin University: Information Science, 22, 4, pp. 303-305, (2004)
  • [8] LOW C, JI M, HSU C, Et al., Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance [J], Applied Mathematical Modelling, 34, 2, pp. 334-342, (2010)
  • [9] GUI W W, LU Z Q., Minimizing the makespan on a single machine with flexible maintenances and jobs'release dates [J], Computers &. Operations Research, 80, pp. 11-22, (2017)
  • [10] WU Hui, WANG Bing, Single-machine scheduling problem with preventative maintenance activities, Control and Decision, 36, 2, pp. 141-148, (2021)
12