论文信息 - A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs

A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs

Abstract Given a set of identical parallel machines and a set of jobs with different due dates and release times, we consider the problem of finding a schedule such that the number of late jobs is minimized, where the given due dates and release times are assumed to be agreeable. A heuristic algorithm is presented and a dynamic programming lower bounding procedure is developed. Computational experiments are performed to show the effectiveness of the heuristic.

Chung-Lun Li | Chung-Lun Li

[1] W. Maxwell. On Sequencing n Jobs on One Machine to Minimize the Number of Late Jobs , 1970 .

[2] George L. Nemhauser,et al. Handbooks in operations research and management science , 1989 .

[3] Clyde L. Monma,et al. Linear-Time Algorithms for Scheduling on Parallel Processors , 1982, Oper. Res..

[4] Eugene L. Lawler,et al. Scheduling a Single Machine to Minimize the Number of Late Jobs , 1983 .

[5] Herbert S. Wilf,et al. Algorithms and Complexity , 1994, Lecture Notes in Computer Science.

[6] L. B. J. M. Sturm. A Simple Optimality Proof of Moore's Sequencing Algorithm , 1970 .

[7] Charles U. Martel,et al. Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs , 1989, Oper. Res..

[8] J. M. Moore. An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .

[9] Eugene L. Lawler,et al. Sequencing and scheduling: algorithms and complexity , 1989 .

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

[11] Jeffrey B. Sidney,et al. An Extension of Moore’s Due Date Algotithm , 1973 .

[12] Toshihide Ibaraki,et al. A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times , 1978, Oper. Res..

[13] H. Kunzi,et al. Lectu re Notes in Economics and Mathematical Systems , 1975 .