Scheduling jobs and maintenance activities on parallel machines

In this article, we deal with the problem of scheduling N production jobs on M parallel machines. Each machine should be maintained once during the planning horizon. We consider the case where the maintenance of the machines should start at time zero and the resources that ensure the maintenance are not sufficient. For such a reason, the maintenance tasks must be continuously run during the planning horizon. We aim to find a schedule composed of the production jobs and the maintenance tasks for which the total sum of the jobs’ weighted completion times and the preventive maintenance cost are minimized. We optimally solve the problem by an integer linear programming method. We also propose a heuristic method computed in two phases. Computational experiments are performed on randomly generated instances and the results show that the proposed methods produce satisfactory solutions for the problem.

[1]  Chengbin Chu,et al.  Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period , 2008, Eur. J. Oper. Res..

[2]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[3]  Zhi-Long Chen,et al.  Scheduling jobs and maintenance activities on parallel machines , 2000 .

[4]  Hans Kellerer,et al.  Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates , 2011, J. Sched..

[5]  Chengbin Chu,et al.  Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times , 2008, Comput. Oper. Res..

[6]  Imed Kacem.  Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval , 2009, J. Comb. Optim..

[7]  Wieslaw Kubiak,et al.  Two-machine flow shops with limited machine availability , 2002, Eur. J. Oper. Res..

[8]  Imed Kacem,et al.  Strongly Fully Polynomial Time Approximation Scheme for the two-parallel capacitated machines scheduling problem , 2011 .

[9]  Maher Rebai,et al.  Earliness–tardiness minimization on a single machine to schedule preventive maintenance tasks: metaheuristic and exact methods , 2010, Journal of Intelligent Manufacturing.

[10]  Ali Ridha Mahjoub,et al.  Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval , 2009, Comput. Ind. Eng..

[11]  Chung Yee Lee,et al.  Scheduling maintenance and semiresumable jobs on a single machine , 1999 .

[12]  George Z. Li.  Single machine earliness and tardiness scheduling , 1997 .

[13]  Chung-Yee Lee,et al.  Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint , 1997, Oper. Res. Lett..

[14]  Chris N. Potts,et al.  A Branch and Bound Algorithm for the Total Weighted Tardiness Problem , 1985, Oper. Res..

[15]  Mohamed Haouari,et al.  Approximation algorithms for single machine scheduling with one unavailability period , 2009, 4OR.

[16]  El Houssaine Aghezzaf,et al.  An integrated production and preventive maintenance planning model , 2007, Eur. J. Oper. Res..

[17]  Chengbin Chu,et al.  Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times , 2009, Eur. J. Oper. Res..

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

[19]  Imed Kacem.  Approximation algorithm for the weighted flow-time minimization on a single machine with a fixed non-availability interval , 2008, Comput. Ind. Eng..

[20]  Jacek Blazewicz,et al.  An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints , 2005, Eur. J. Oper. Res..

[21]  Hans Kellerer,et al.  Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval , 2009, Eur. J. Oper. Res..

[22]  Shimon Even,et al.  Bounds for the Optimal Scheduling of n Jobs on m Processors , 1964 .