On scheduling with earliest starts and due dates on a group of identical machines. (English) Zbl 0322.90029


90B35 Deterministic scheduling theory in operations research
90C10 Integer programming
65K05 Numerical mathematical programming methods
Full Text: DOI


[1] Balas, Operations Res. 17 pp 941– (1969)
[2] Bratley, Nav. Res. Log. Quart. 18 pp 511– (1971)
[3] Bratley, Nav. Res. Log. Quart. 20 pp 57– (1973)
[4] Bratley, Nav. Res. Log. Quart. 22 pp 165– (1975)
[5] Charlton, Operations Res. 18 pp 689– (1970)
[6] and , ”The One-Machine Sequencing Problem with Early Start and Due Dates,” Technical Report, University of Illinois at Urbana-Champaign (Apr. 1972).
[7] , and , ”An Implicit Enumeration Algorithm for Complex JobShop Problems,” Département d’Informatique de I’Université de Montréal, Publication No. 102 (Juil. 1972). To appear in the International Journal of Production Research, 1975.
[8] Florian, Management Science: Applications 17 pp 782– (1971)
[9] and , ”Les problémes d’ordonnancement avec contraintes disjonctives”, SEMA, Direction Scientifique, document technique, No. 23 (Dec. 1971).
[10] ”Obtaining Optimal Solutions to Resource Constrained Network Scheduling Problems,” Center for Mathematical Studies in Business and Economics Reports, University of Chicago (Sept. 1970).
[11] Schrage, Operations Research 18 pp 263– (1970)
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.