×
Balas, E.

Machine sequencing: Disjunctive graphs and degree-constrained subgraphs. (English) Zbl 0202.18503

Nav. Res. Logist. Q. 17, 1-10 (1970).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0202.18503
Cite Review PDF
Full Text: DOI

References:

[1] Balas, Operations Research 13 pp 517– (1965)
[2] Balas, Operations Research 15 pp 915– (1967)
[3] ”Finding a Minimaximal Path in a Disjunctive PERT Network.” Théorie des Graphes. Journées internationales d’étude, Rome, Juillet 1966(Dunod (Paris) – Gordon and Beach, New York, 1967), pp. 21–30.
[4] Balas, Operations Research 17 (1969)
[5] ”Minimax and Duality for Linear and Nonlinear Mixed-Integer Programming,” Integer and Nonlinear Programming ( Ed.), North-Holland, 1970). · Zbl 0346.90071
[6] ”Project Scheduling with Resource Constraints,” Proceedings of the NATO Conference on the Applications of Mathematical Programming–June 24–28, 1968 (Cambridge).
[7] Benders, Numerische Mathematik 4 pp 238– (1962)
[8] Theory of Graphs (Methuen, London, 1966).
[9] Bowman, Operations Research 7 pp 621– (1959)
[10] , and , Theory of Scheduling (Addison-Wesley, 1967).
[11] Dantzig, Management Science 6 pp 191– (1960)
[12] Giffler, Operations Research 8 pp 487– (1960)
[13] Johnson, Naval Research Logistics Quarterly 1 pp 61– (1954)
[14] Lemke, Operations Research 15 pp 892– (1967)
[15] Manne, Operations Research 8 pp 219– (1960)
[16] Németi, Mathematika 6 pp 87– (1964)
[17] ”An Algorithm for the Exact Solution of the Machine Scheduling Problem,” IBM, New York Scientific Center Report No. 320–2930 (Feb. 1968).
[18] and , Les problémes d’ordonnancement avec contraintes disjonctives. SEMA, Note D. S. No. 9 bis (décembre 1964).
[19] Wagner, Naval Research Logistics Quarterly 6 pp 131– (1959)
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.