×

A fully polynomial approximation scheme for the total tardiness problem. (English) Zbl 0511.90074


MSC:

90B35 Deterministic scheduling theory in operations research
68Q25 Analysis of algorithms and problem complexity
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Korte, B.; Schrader, R., On the existence of fast approximation schemes, (Report 115-WP80163 (1980), Institut für Ökonometrie und Operations Research, Universität Bonn) · Zbl 0462.68009
[2] Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H.G., Recent developments in deterministic sequencing and scheduling: A survey, (Dempster, M. A.H.; Lenstra, J. K.; Rinnooy Kan, A. H.G., Deterministic and Stochastic Scheduling (1982), D. Reidel Publ. Co: D. Reidel Publ. Co Dordrecht), 35-74 · Zbl 0482.68035
[3] Lawler, E. L., A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness, Ann. Discrete Math, 1, 331-342 (1977) · Zbl 0353.68071
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.