摘要
This paper gives the sensitivity analysis for some scheduling problems, including the following： what are the limits to a parameter change such that the solution remain optimal？ Given a specific change of a parameter, what is the new optimal cost？ Given a specific change of a parameter, what is a new optimal solution？ Here, the concern is mainly with the sensitivity analysis for some single-machine and flowshop scheduling problems with polynomial time algorithms. It is shown that, for these problems, the sensitivity analysis results depend on the positions of jobs with changed parameters.
This paper gives the sensitivity analysis for some scheduling problems, including the following： what are the limits to a parameter change such that the solution remain optimal？ Given a specific change of a parameter, what is the new optimal cost？ Given a specific change of a parameter, what is a new optimal solution？ Here, the concern is mainly with the sensitivity analysis for some single-machine and flowshop scheduling problems with polynomial time algorithms. It is shown that, for these problems, the sensitivity analysis results depend on the positions of jobs with changed parameters.
