Stability of an optimal schedule in a job shop

Omega

Volumn 25, Issue 4, 1997, Pages 397-414

  Sotskov, Y ^a   Sotskova, N Y ^b   Werner, F ^c  

^a UNITED INSTITUTE OF INFORMATICS PROBLEMS   (Belarus)

^b BELARUSIAN STATE UNIVERSITY   (Belarus)

^c OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

Graph; Job shop scheduling; Simulation; Stability

Indexed keywords

STABILITY CRITERIA;

GRAPH; JOB-SHOP; JOB-SHOP SCHEDULING; MAXIMUM FLOWS; MEAN FLOW; OPTIMAL SCHEDULE; OPTIMALITY; PROCESSING TIME; SIMULATION; STABILITY RADIUS;

JOB SHOP SCHEDULING;

EID: 0031206138     PISSN: 03050483     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0483(97)00012-1     Document Type: Article

References (15)

1. Tanaev, V. S., Sotskov, Yu. N. and Strusevich, V. A., Scheduling Theory, Multi-stage Systems, Kluwer Academic Publishers, 1994.
2. Gordeev, E. N. and Leontev, V. K., The complexity of the tabulation of trajectory problems. U.S.S.R. Computer Mathematics and Mathematical Physics, 1985, 25, 199-201.
3. Libura, M., Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems. Discrete Applied Mathematics, 1991, 30, 197-211.
4. Libura, M., On accuracy of solutions for discrete optimization problems with perturbed objective functions, Annals of Operations Research, (submitted), 1996.
5. Libura, M., van der Poort, E. S., Sierksma, G. and van der Veen, J. A. A., Sensitivity analysis based on k-best solutions of the traveling salesman problem, Research report 96A14, University of Groningen, 1996.
6. Tarjan, R. E., Sensitivity analysis of minimum spanning trees and shortest path trees. Information Processing Letters, 1982, 14, 30-33.
7. Sotskov, Y. N., Leontev, V. K. and Gordeev, E. N., Some concepts of stability analysis in combinatorial optimization. Discrete Applied Mathematics, 1995, 58, 169-190.
8. Bräsel, H., Sotskov, Y. N. and Werner, F., Stability of a schedule minimizing mean flow time. Mathematical and Computer Modelling, 1996, 24, 39-53.
9. Kravchenko, S. A., Sotskov, Y. N. and Werner, F., Optimal schedules with infinitely large stability radius. Optimization, 1995, 33, 271-280.
10. Sotskov, Y. N., Stability of an optimal schedule. European Journal of Operational Research, 1991, 55, 91-102.
11. Sotskov, Yu. N. and Werner, F., On the calculation of the stability radius of an optimal or an approximate schedule, Preprint 23/95, Otto-von-Guericke-Universität Magdeburg, 1995.
12. Fisher, H. and Thompson, M. L., Probabilistic learning combinations of local job-shop scheduling rules. In Industrial Scheduling, eds J. F. Muth and G. L. Thompson (eds). Prentice Hall, Englewood Cliffs, 1963, pp. 225-251.
13. Piper, C. J. and Zoltners, A. A., Some easy postoptimality analysis for zero-one programming. Management Science, 1976, 22, 759-765.
14. Wilson, G. R. and Jain, H. K., An approach to postoptimality and sensitivity analysis of zero-one goal programs. Naval Research Logistics, 1988, 35, 73-84.
15. Ramaswamy, R. and Chakravarti, N., Complexity of determining exact tolerances for min-sum and min-max combinatorial optimization problems, Report No. WPS-247/95, Indian Institute of Management, Calcutta, 1995.