论文信息 - Approximation algorithms for common due date assignment and job scheduling on parallel machines

Approximation algorithms for common due date assignment and job scheduling on parallel machines

We consider the problem of assigning a common due date to a set of jobs and scheduling the jobs on a set of parallel machines so that the weighted sum of the due date, total earliness, and total tardiness is minimized. A heuristic is developed to solve this problem, and an absolute performance ratio is provided for this heuristic. Another heuristic with a better worst-case performance bound is presented for the case with a zero earliness penalty. A fully polynomial approximation scheme is also developed.

Chung-Lun Li | Chung-lun Li | Wen-Qiang Xiao | Wenqiang Xiao | Chung-Lun Li

[1] Sartaj Sahni,et al. Algorithms for Scheduling Independent Tasks , 1976, J. ACM.

[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3] S. S. Panwalkar,et al. Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem , 1982, Oper. Res..

[4] Hamilton Emmons,et al. Scheduling to a common due date on parallel uniform processors , 1987 .

[5] T.C.E. Cheng,et al. A Heuristic for Common Due-date Assignment and Job Scheduling on Parallel Machines , 1989 .

[6] Prabuddha De,et al. On the Multiple-machine Extension to a Common Due-date Assignment and Scheduling Problem , 1991 .

[7] Marc E. Posner,et al. Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date , 1991, Oper. Res..

[8] Prabuddha De,et al. Scheduling to minimize weighted earliness and tardiness about a common due-date , 1991, Comput. Oper. Res..

[9] P. De,et al. Due‐date assignment and early/tardy scheduling on identical parallel machines , 1994 .

[10] Jeffrey E. Diamond,et al. Error bound for common due date assignment and job scheduling on parallel machines , 2000 .