摘要

Inverse scheduling problems deals with the determination of the minimum adjustments to the job parameters (such as processing time' due dates) for a given job sequences to be optimal with respect to some pre-defined objective functions. It has a wide range of applications in industrial and economic sectors. In this paper, a number of inverse scheduling problems have been studied. In this thesis, we studied some inverse problems of scheduling under three types of norms I1, I2 and one of them is on single machines: the inverse scheduling problem with maximum tardiness objective on single machines. We have presented the necessary and sufficient conditions for optimality of the maximum tardiness problem on single machines; also have given the mathematical formulations of the inverse scheduling and method of solving this inverse scheduling problem. For some special cases of the inverse scheduling problems, we have obtained the formulations for the optimal solutions. The experiment result shows it can improve the performance substantially.