Stability Radius of an Optimal Schedule: A Survey and Recent Developments

This publication has 16 references indexed in Scilit:

• Optimal schedules with infinitely large stability radius^∗
  Optimization, 1995
• Sensitivity analysis of list scheduling heuristics
  Discrete Applied Mathematics, 1994
• Chapter 9 Sequencing and scheduling: Algorithms and complexity
  Published by Elsevier ,1993
• Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
  Discrete Applied Mathematics, 1991
• Algorithms of polynomial complexity for computing the radius of instability in two classes of trajectory problems
  USSR Computational Mathematics and Mathematical Physics, 1987
• The complexity of the tabulation of trajectory problems
  USSR Computational Mathematics and Mathematical Physics, 1985
• Computational algorithms for finding the radius of stability in problems of choice
  USSR Computational Mathematics and Mathematical Physics, 1983
• Arc tolerances in shortest path and network flow problems
  Networks, 1980
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
  Operations Research, 1978
• Stability of the travelling salesman problem
  USSR Computational Mathematics and Mathematical Physics, 1975