论文信息 - Parallel-machine scheduling with an availability constraint

Parallel-machine scheduling with an availability constraint

e consider two parallel machines scheduling problem where one machine is not available in a specified time period. The unavailable time period is fixed and known in advance. The objective is to minimize the total weighted completion time. The problem is known to be NP-hard. We give a fully polynomial-time approximation scheme (FPTAS) for the problem. We then generalize the results to the case with m parallel machines.

[1] Chung-Yee Lee,et al. Capacitated Two-Parallel Machines Scheduling to Minimize Sum of Job Completion Times , 1993, Discret. Appl. Math..

[2] H.-C. Hwang,et al. Parallel Machines Scheduling with Machine Shutdowns , 1998 .

[3] Kangbok Lee,et al. The effect of machine availability on the worst-case performance of LPT , 2005, Discret. Appl. Math..

[4] Gur Mosheiov,et al. Minimizing the sum of job completion times on capacitated parallel machines , 1994 .

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

[6] Wieslaw Kubiak,et al. A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs , 1998, J. Heuristics.

[7] Wieslaw Kubiak,et al. A Fully Polynomial Approximation Scheme for the Weighted Earliness-Tardiness Problem , 1999, Oper. Res..

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

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