论文信息 - Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties

Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties

We consider the problem of assigning a common due-date and sequencing a set of simultaneously available jobs on several identical parallel-machines. The objective is to minimize some penalty function of earliness, tardiness and due-date values. We show that the problem is NP-hard with either a total or a maximal penalty function. For the problem with a total penalty function, we show that the special case in which all jobs have an equal processing time is polynomially-solvable.

T.C.E. Cheng | Zl-L. Chen | T. Cheng | Zl-L. Chen

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

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

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

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

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

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