Makespan minimization for scheduling on two identical parallel machiens with flexible maintenance and nonresumable jobs

ABSTRACT This paper addresses the problem of scheduling on two identical parallel machines with flexible maintenance and nonresumable jobs; the objective is minimizing the makespan. The properties of the optimal solution of this problem are analyzed. Then, two mixed-integer programming (MIP) models are developed to provide a benchmark for evaluating the effectiveness of the heuristic algorithms presented. Next, three heuristic algorithms and four procedures to improve the quality of the solutions generated by these algorithms are proposed based on the properties of the optimal solution. Finally, the solutions of the heuristic algorithms are compared with those obtained by the MIP models in terms of time and optimality. The results show that the three heuristic algorithms and their improved algorithms can all obtain near-optimal solutions with very little computation time. In particular, the sorting while allocating (SWA) algorithm and its improved algorithms are satisfactory in terms of both solution efficiency and accuracy.

[1]  T.C.E. Cheng,et al.  A heuristic for scheduling jobs on two identical parallel machines with a machine availability constraint , 2015 .

[2]  Ling‐Huey Su,et al.  Flexible preventive maintenance planning for two parallel machines problem to minimize makespan , 2010 .

[3]  Jatinder N. D. Gupta,et al.  Minimizing the makespan on two identical parallel machines with mold constraints , 2019, Comput. Oper. Res..

[4]  Antonio Costa,et al.  Total tardiness minimization in a parallel machine system with flexible periodic maintenance , 2016 .

[5]  Deming Lei,et al.  An artificial bee colony with division for distributed unrelated parallel machine scheduling with preventive maintenance , 2020, Comput. Ind. Eng..

[6]  Hongxing Li,et al.  Scheduling problems with multiple maintenance activities and non-preemptive jobs on two identical parallel machines , 2010 .

[7]  Ik Sun Lee,et al.  Parallel machine scheduling with maintenance activities , 2016, Comput. Ind. Eng..

[8]  Dehua Xu,et al.  Makespan minimization for two parallel machines scheduling with a periodic availability constraint: Mathematical programming model, average-case analysis, and anomalies , 2013 .

[9]  Bahram Alidaee,et al.  Effective heuristic for large-scale unrelated parallel machines scheduling problems , 2019, Omega.

[10]  Dehua Xu,et al.  Makespan Minimization for Two Parallel Machines Scheduling with a Periodic Availability Constraint: The Preemptive Offline Version , 2009, 2010 Third International Joint Conference on Computational Science and Optimization.

[11]  Lu-Wen Liao,et al.  Parallel machine scheduling with machine availability and eligibility constraints , 2008, Eur. J. Oper. Res..

[12]  Suresh P. Sethi,et al.  Parallel-machine scheduling with machine-dependent maintenance periodic recycles , 2017 .

[13]  Qingguo Li,et al.  Scheduling two parallel machines with machine-dependent availabilities , 2016, Comput. Oper. Res..

[14]  T.C.E. Cheng,et al.  Parallel-machine scheduling of deteriorating jobs with potential machine disruptions ☆ , 2017 .

[15]  Günter Schmidt,et al.  Scheduling with limited machine availability , 2000, Eur. J. Oper. Res..

[16]  Wen-Chiung Lee,et al.  A hybrid genetic algorithm for an identical parallel-machine problem with maintenance activity , 2015, J. Oper. Res. Soc..

[17]  Chien-Hung Lin,et al.  Makespan minimization for two parallel machines with an availability constraint , 2005, Eur. J. Oper. Res..

[18]  Min Ji,et al.  Parallel-machine scheduling with an availability constraint , 2011, Comput. Ind. Eng..

[19]  Bin Fu,et al.  Approximation schemes for parallel machine scheduling with availability constraints , 2011, Discret. Appl. Math..

[20]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[21]  Claver Diallo,et al.  Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints , 2016, INFOR Inf. Syst. Oper. Res..

[22]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[23]  T.C.E. Cheng,et al.  A state-of-the-art review of parallel-machine scheduling research , 1990 .

[24]  Gerd Finke,et al.  Parallel-machine scheduling with maintenance: Praising the assignment problem , 2016, Eur. J. Oper. Res..

[25]  Ji-Bo Wang,et al.  Parallel machine scheduling with a deteriorating maintenance activity and total absolute differences penalties , 2011, Appl. Math. Comput..

[26]  Claver Diallo,et al.  Makespan minimization for parallel machines scheduling with multiple availability constraints , 2014, Ann. Oper. Res..

[27]  Weiwei Cui,et al.  Heuristics for the identical machine scheduling problem with preventive maintenances , 2016 .

[28]  Chung-Yee Lee,et al.  Machine scheduling with an availability constraint , 1996, J. Glob. Optim..

[29]  Dehua Xu,et al.  Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan , 2008, Comput. Oper. Res..

[30]  Johnny Wong,et al.  Makespan minimization for m parallel identical processors , 1995 .

[31]  Ghorbanali Mohammadi,et al.  Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints , 2012, Comput. Math. Appl..