论文信息 - Minimizing Total Weighted Completion Time on a Single Machine Scheduling Problem with Resumable Jobs and Flexible Maintenance

Minimizing Total Weighted Completion Time on a Single Machine Scheduling Problem with Resumable Jobs and Flexible Maintenance

This paper considers the problem of scheduling n resumable jobs to minimize total weighted completion time, in which maintenance activities periodically occur after a continuously working time. This problem has been proven to be NP-hard. Using lower bounds and several dominance rules, a branch and bound scheme is proposed to solve optimally efficiently for small problems. A mixed integer programming model is also introduced to obtain benchmark solutions.

Fuh-Der Chou | Yarong Chen | Ya-Chih Tsai

[1] Boris Detienne,et al. Minimizing the weighted number of late semi-resumable jobs with deterministic machine availability , 2012 .

[2] Guoqing Wang,et al. Preemptive Scheduling with Availability Constraints to Minimize Total Weighted Completion Times , 2005, Ann. Oper. Res..

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

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

[5] Chengbin Chu,et al. A survey of scheduling with deterministic machine availability constraints , 2010, Comput. Ind. Eng..

[6] Chung-Yee Lee,et al. Machine Scheduling with Availability Constraints , 2004, Handbook of Scheduling.

[7] Li Zhou,et al. Scheduling resumable deteriorating jobs on a single machine with non-availability constraints , 2011, Theor. Comput. Sci..

[8] Wen-Chiung Lee,et al. Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine , 2003, Inf. Process. Lett..

[9] Maw-Sheng Chern,et al. MINIMIZING THE MAKESPAN IN A SINGLE MACHINE SCHEDULING PROBLEM WITH A FLEXIBLE MAINTENANCE , 2002 .