Scheduling with forbidden sets

Discrete Applied Mathematics

Volumn 72, Issue 1-2, 1997, Pages 155-166

  Schäffter, Markus W ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Approximation; Approximation threshold; Forbidden sets; m Machine problem; Scheduling; Sensitivity

Indexed keywords

EID: 18844465146     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(96)00042-X     Document Type: Article

References (10)

1. M. Bartusch, R.H. Möhring and F.J. Radermacher, Scheduling project networks with resource constraints and time windows, Ann. Oper. Res. 16 (1988) 201-240.
2. M. Bartusch, R.H. Möhring and F.J. Radermacher, A conceptional outline of a DSS for scheduling problems in the building industry, Decision Support Systems 5 (1989) 321-344.
3. B. Bollobás, Graph Theory, An Introductory Course (Springer, Berlin, 1979).
4. M.R. Garey and D.S. Johnson, Computers and Intractability, A Guide to the Theory of script N sign℘-Completeness (Freeman, San Francisco, 1979).
5. M.R. Garey and D.S. Johnson and L. Stockmeyer, Some Simplified script N sign℘-Complete Graph Problems, Theor. Comput. Sci. 1 (1976) 237-267.
6. R.L. Graham, Bounds for certain multiprocessing anomalies, Bell System Technical J. 45 (1986) 1563-1581.
7. R.L. Graham, E.L. Lawler and J.K. Lenstra and A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling: a survey, Ann. Discrete Math. 5 (1979) 287-326.
8. D. Jungnickel, Graphen, Netzwerke und Algorithmen [German], (BI Wissenschaftsverlag, 2. revised edition, 1990).
9. L. Lovász, Covering and coloring of hypergraphs, in: Proc. 4th Southeastern Conference on Combinatorics, Graph Theory, and Computing (Utilitas Mathematica Publishing, Winnipeg, 1973) 3-12.
10. C.A. Tovey, Rescheduling to minimize makespan on a changing number of identical processors, Naval Res. Logist. Quat. 33 (1986) 717-724.