The one-machine sequencing problem. (English) Zbl 0482.90045


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


[1] Baker, K.R., Introduction to sequencing and scheduling, (1974), Wiley Tokyo
[2] Baker, K.R.; Su, Z.S., Sequencing with due dates and early start times to minimize tardiness, Naval res. logist. quart., 21, 171-176, (1974) · Zbl 0277.90044
[3] Bratley, P.; Florian, M.; Robillard, P., On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/fmas) problem, Naval res. logist. quart., 20, 57-67, (1973) · Zbl 0256.90027
[4] Carlier, J., Probleme a une machine, rapport du groupe combinatoire de l’AFCET, (1976)
[5] M. Florian, R. Trepant and G. Mac Mahon, An implication enumeration algorithm for the machine sequencing problem Management Sci. 17, 782-792.
[6] Garey, M.R.; Johnson, D.S., Computers and intractability: A guide to the theory of NP-completeness, (1979), Freeman New York · Zbl 0411.68039
[7] Graham, C.L.; Lawler, E.L.; Lenstra, J.K.; Rinnooy Kan, A.H.G., Optimization and approximation in deterministic sequencing and scheduling; a survey, (1977) · Zbl 0388.90032
[8] Lageweg, B.J.; Lenstra, J.K.; Rinnooy Kan, A.H.G., Minimizing maximum lateness on one machine: computational experience and some applications, Statistica neerlandica, 30, 25-41, (1976) · Zbl 0336.90029
[9] Roy, B., Algèbre moderne et théorie des graphes, (1970), Dunod San Francisco
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.