A note on polynomially-solvable cases of common due date early-tardy scheduling with release dates

Jorge M. S. Valente *

Rui A. F. S. Alves *

* Faculdade de Economia, Universidade do Porto

{jvalente, ralves}@fep.up.pt

Abstract:

In this paper we consider the single machine scheduling problem with integer release dates and the objective of minimising the sum of deviations of jobs' completion times from a common integer due date. We present an efficient polynomial algorithm for the unit processing time case. We also show how to calculate in polynomial time the minimum non-restrictive due date for the general case.

Keywords: scheduling, early-tardy, common due date, unit processing times, release dates

Texto completo apenas disponível em PDF.

Full text only available in PDF format.

Bibliography

1. BAGCHI, U., SULLIVAN, R., AND CHANG, Y. Minimizing mean absolute deviation of completion times about a common due date. Naval Research Logistics Quarterly 33 (1986), 227-240.         [ Links ]

2. BAKER, K. R., AND SCUDDER, G. D. Sequencing with earliness and tardiness penalties: A review.
Operations Research 38 (1990), 22-36. 

3. BANK, J., AND WERNER, F. Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties. Mathematical and Computer Modelling 33 (2001), 363-383.          [ Links ]

4. HALL, N., KUBIAK, W., AND SETHI, S. Earliness-tardiness scheduling problems, ii: Deviation of completion times about a restrictive common due date. Operations Research 39 (1991), 847-856.          [ Links ]

5. KANET, J. Minimizing the average deviation of job completion times about a common due date. Naval Research Logistics Quarterly 28 (1981), 643-651.          [ Links ]

6. LAWLER, E. L., LENSTRA, J. K., RINNOOY KAN, A. H. G., AND SHMOYS, D. B. Sequencing and scheduling: Algorithms and complexity. In Logistics of Production and Inventory, Handbooks in Operations Research and Management Science, pp. 445-522, S. C. Graves, A. H. G. Rinnooy Kan, and P. H. Zipkin, Eds. North-Holland, Amsterdam, 1993.          [ Links ]

7. NANDKEOLYAR, U., AHMED, M. U., AND SUNDARARAGHAVAN, P. S. Dynamic single-machine-weighted absolute deviation problem: Predictive heuristics and evaluation. International Journal of Production Research 31 (1993), 1453-1466.          [ Links ]

8. SRIDHARAN, V., AND ZHOU, Z. A decision theory based scheduling procedure for single machine weighted earliness and tardiness problem. European Journal of Operational Research 94 (1996), 292-301.         [ Links ]