×

Minimizing mean absolute deviation of completion times about a common due date. (English) Zbl 0599.90049

The authors consider a one machine scheduling problem in which the objective is to minimize the mean absolute deviation of job completion times about a common due date d. They give two algorithms, the first to be applied if d is larger than a certain measure derived from the processing times, the second to be applied in the other case. The first algorithm enumerates all optimal solutions, while the second uses an implicit enumeration of the feasible solutions and properties of optimal solutions to curtail the enumeration. The relation of the problem to the two parallel machines mean flow time problem is also examined.
Reviewer: A.Gaillard

MSC:

90B35 Deterministic scheduling theory in operations research
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Introduction to Sequencing and Scheduling, Wiley, New York, 1974.
[2] Eilon, Management Science 23 pp 567– (1977)
[3] Kanet, Naval Research Logistics Quarterly 28 pp 643– (1981)
[4] Kanet, Management Science 27 pp 1453– (1981)
[5] Merten, Management Science 18 pp 518– (1972)
[6] Schrage, Management Science 21 pp 540– (1975)
[7] Sidney, Operations Research 25 pp 62– (1977)
[8] Sundararaghavan, Naval Research Logistics Quarterly 31 pp 325– (1984)
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.