On the calculation of the stability radius of an optimal or an approximate schedule

Annals of Operations Research

Volumn 83, Issue , 1998, Pages 213-252

  Sotskov, Yuri N ^a   Wagelmans, Albert P M ^b   Werner, Frank ^c  

^a UNITED INSTITUTE OF INFORMATICS PROBLEMS   (Belarus)

^b ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

^c OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

Disjunctive graph; Linear binary programming; Scheduling; Stability

Indexed keywords

EID: 0032347084     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/a:1018960030420     Document Type: Article

References (26)

1. H. Bräsel, Yu.N. Sotskov and F. Werner, Stability of a schedule minimizing mean flow time, Math. Comput. Modelling 24(1996)39-53.
2. M.J. Eisner and D.G. Severance, Mathematical techniques for efficient record segmentation in large shared databases, J. ACM 23(1976)619-635.
3. E. Girlich, Yu.N. Sotskov and F. Werner, Extreme values of the stability radius of an approximate solution of a linear Boolean minimization problem, Preprint 6/93, TU Magdeburg, 1993.
4. E.N. Gordeev and V.K. Leontev, The complexity of the tabulation of trajectory problems, U.S.S.R. Comput. Maths. Math. Phys. 25, No. 4(1985)199-201.
5. E.N. Gordeev and V.K. Leontev, Stability in bottleneck problems, U.S.S.R. Comput. Maths. Math. Phys. 20, No. 4(1980)275-280.
6. M.Y. Kovalyov and Yu.N. Sotskov, The stability of an ε-approximate solution of a minimization problem of Boolean linear forms, Vesti Akad. Navuk BSSR, Ser. Fyz.-Mat. Navuk 2(1990)111-116 (in Russian).
7. A.W.J. Kolen, A.H.G. Rinnooy Kan, C.P.M. van Hoesel and A.P.M. Wagelmans, Sensitivity analysis of list scheduling algorithms, Discrete Appl. Math. 55(1994)145-162.
8. S.A. Kravchenko, Yu.N. Sotskov and F. Werner, Optimal schedules with infinitely large stability radius, Optimization 33(1995)271-280.
9. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, Sequencing and scheduling: Algorithms and complexity, in: Logistics of Production and Inventory, Handbook in Operations Research and Management Science 4, eds. G.C. Graves, A.H.G. Rinnooy Kan and P.H. Zipkin, North-Holland, Amsterdam, 1993, pp. 445-522.
10. V.K. Leontev, The stability of the Traveling Salesman Problem, U.S.S.R. Comput. Maths. Math. Phys. 15, No. 5(1975)199-213.
11. V.K. Leontev, Stability in combinatorial choice problems, Soviet Math. Dokl. 17(1976)635-638.
12. M. Libura, Sensitivity analysis for minimum Hamiltonian path and Traveling Salesman Problems, Discrete Appl. Math. 30(1991)197-211.
13. M. Libura, E.S. van der Poort, G. Sierksma and J.A.A. van der Veen, Sensitivity analysis based on k-best solutions of the Traveling Salesman Problem, Research Report 96A14, University of Groningen, The Netherlands, 1996, 27 pages.
14. M. Pinedo, Scheduling, Theory, Algorithms, and Systems, Prentice-Hall, Englewood Cliffs, 1995.
15. R. Ramaswamy and N. Chakravarti, Complexity of determining exact tolerances for min-sum and min-max combinatorial optimization problems, Working Paper WPS-247/95, Indian Institute of Management, Calcutta, India, 1995, 34 pages.
16. B. Roy and B. Sussmann, Problèmes d'ordonnancement avec contraints disjunctives, SEMA, Note DS, No. 9 bis Montrauge, 1964.
17. Yu.N. Sotskov, The stability of high-speed optimal schedules, U.S.S.R. Comput. Maths. Math. Phys. 29, No. 3(1989)57-63.
18. Yu.N. Sotskov, Stability of an optimal schedule, European J. Oper. Res. 55(1991)91-102.
19. Yu.N. Sotskov, The stability of the approximate Boolean minimization of a linear form, Comput. Maths. Math. Phys. 33, No. 5(1993)699-707.
20. Yu.N. Sotskov, V.K. Leontev and E.N. Gordeev, Some concepts of stability analysis in combinatorial optimization, Discrete Appl. Math. 58(1995)169-190.
21. Yu.N. Sotskov, N.Y. Sotskova and F. Werner, Stability of an optimal schedule in a job shop, OMEGA (1997), to appear.
22. B. Sussmann, Scheduling problems with interval disjunctions, Z. Oper. Res. 16(1972)165-178.
23. V.S. Tanaev, Yu.N. Sotskov and V.A. Strusevich, Scheduling Theory, Multi-Stage Systems, Kluwer Academic, 1994.
24. R.E. Tarjan, Sensitivity analysis of minimum spanning trees and shortest path trees, Inform. Processing Letters 14(1982)30-33.
25. C.P.M. van Hoesel and A.P.M. Wagelmans, On the complexity of postoptimality analysis of 0/1 programs, Report 9167/A, Econometric Institute, Erasmus University Rotterdam, Rotterdam, The Netherlands, 1991, 18 pages.
26. R.E. Wendell, The tolerance approach to sensitivity analysis in linear programming, Management Sci. 31(1985)564-578.