Scheduling under a common due-data on parallel unrelated machines

Abstract Due-data determination problems have gained significant attention in recent years due to the industrial focus in the just-in-time philosophy. In this paper the problem of scheduling a set of independent jobs on parallel unrelated processors under a common due-date is examined. The common due-date is a decision variable. The objective is to allocate and sequence the jobs on the machines and to determine the optimal due-data, so that the total cost be minimised. This cost is composed of the due-date assignment, the total earliness and the total tardiness cost. As the problem is NP-hard, a polynomial time heuristic procedure, which provides efficient solutions, is developed. The procedure is illustrated by means of an example and is tested via two small size experiments.

[1]  Nicholas G. Hall.  Single- and multiple-processor models for minimizing completion time variance , 1986 .

[2]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[3]  S. S. Panwalkar,et al.  Single-machine sequencing with controllable processing times , 1992 .

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

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

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

[7]  T.C.E. Cheng.  An alternative proof of optimality for the common due-date assignment problem , 1988 .

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

[9]  T.C.E. Cheng,et al.  Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties , 1994 .

[10]  Yih-Long Chang,et al.  Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date , 1987 .

[11]  T.C.E. Cheng,et al.  A state-of-the-art review of parallel-machine scheduling research , 1990 .

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

[13]  Bahram Alidaee,et al.  Single Stage Minimum Absolute Lateness Problem with a Common Due Date on Non-Identical Machines , 1993 .

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

[15]  T. Cheng.  A Note on the Common Due-Date Assignment Problem , 1986 .