论文信息 - Single Stage Minimum Absolute Lateness Problem with a Common Due Date on Non-Identical Machines

Single Stage Minimum Absolute Lateness Problem with a Common Due Date on Non-Identical Machines

In this paper we consider scheduling n single operation jobs with a common due date on m non-identical machines (in parallel) so as to minimize the sum of the absolute lateness. We reduce the problem to a transportation problem that can be solved by a polynomial time algorithm. Furthermore, we consider the problem in the case of identical machines and we give a heuristic algorithm to minimize makespan among all schedules that minimize the absolute lateness problem.

Bahram Alidaee | S. S. Panwalkar | S. S. Panwalkar | B. Alidaee | S. Panwalkar

[1] Yih-Long Chang,et al. MINIMIZING MEAN ABSOLUTE DEVIATION OF COMPLETION TIMES ABOUT A COMMON DUE DATE. , 1986 .

[2] J. J. Kanet. Minimizing the average deviation of job completion times about a common due date , 1981 .

[3] Jan Karel Lenstra,et al. Sequencing and scheduling : an annotated bibliography , 1997 .

[4] P Dileepan,et al. Bicriterion static scheduling research for a single machine , 1988 .

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

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

[7] A. J. Clewett,et al. Introduction to sequencing and scheduling , 1974 .

[8] Mesbah U. Ahmed,et al. Minimizing the sum of absolute lateness in single‐machine and multimachine scheduling , 1984 .

[9] Gary D. Scudder,et al. Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..

[10] Edward G. Coffman,et al. Scheduling independent tasks to reduce mean finishing time , 1974, CACM.

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