On sequencing with earliest starts and due dates with application to computing bounds for the (\(n/m\)/G/F\(_{max}\)) problem. (English) Zbl 0256.90027


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


[1] Balas, Operations Research 17 (1969)
[2] and , ”An Algorithm for Finding Optimal or Near Optimal Solutions to the Production Scheduling Problem,” J. Indust. Eng. (Jan.-Feb 1965).
[3] , and , Theory of Scheduling (Addison-Wesley, 1967).
[4] Florian, Management Science: Applications 17 pp 782– (1971)
[5] and , Industrial Scheduling (Prentice-Hall, 1963).
[6] and , ”A Note on Lower Bounds for the Machine Sequencing Problem.” Publication No. 49, Dépt. d’informatique, Université de Montréal (Dec. 1970).
[7] Schrage, Operations Research 18 (1970)
[8] ”A Bound Based on the Equivalence of Min. Max. Completion Time and Min. Max. Lateness Scheduling Objectives.” Center for Mathematical Studies in Business and Economics Report, University of Chicago, Sept. 1970.
[9] ”Obtaining Optimal Solutions to Resource Constrained Network Scheduling Problems” (Mar. 1971).
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.