On some geometric methods in scheduling theory: a survey
- 28 October 1994
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 55 (1) , 59-82
- https://doi.org/10.1016/0166-218x(94)90036-1
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Bounding algorithm for the routing problem with arbitrary paths and alternative serversCybernetics and Systems Analysis, 1987
- An Algorithm for the Open-Shop ProblemMathematics of Operations Research, 1983
- A Vector-Sum Theorem and its Application to Improving Flow Shop GuaranteesMathematics of Operations Research, 1981
- “Integer-making” theoremsDiscrete Applied Mathematics, 1981
- Open Shop Scheduling to Minimize Finish TimeJournal of the ACM, 1976
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954
- Zwei sätze über ebene vektorpolygoneAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1931
- Ein neuer beweis eines satzes von E. SteinitzAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1931
- Bedingt konvergente ReihenMonatshefte für Mathematik, 1917
- Bedingt konvergente Reihen und konvexe Systeme.Journal für die reine und angewandte Mathematik (Crelles Journal), 1913