Several Results Of Rescheduling Problems

The scheduling problem refers to allocate and process sequence of the job and the machine to optimize one or more the subjective functions under some certain constraint conditions. The single rescheduling problem is one of the most complex and important scheduling problem. Rescheduling model is a new scheduling type: A group of the original jobs have been scheduled optimally to minimize some natural cost objective. But if a number of new jobs arrive just before the start of procession or in processing process, we would schedule the new arrived jobs together with the original jobs. Thus, the trade off between the scheduling cost and the disruption cost must be considered in detail. Hall and Potts considered scheduling problems when a set of original jobs has already been scheduled to minimize some cost objective. When a new set of jobs arrives and creates a disruption, they minimized the scheduling cost of all the jobs subject to a limit on the disruption caused to the original schedule, Where this disruption is measured in various ways.In capt 2, We consider the scheduling problems with deteriorating effect and learning effect. We study the rescheduling problem under the restriction of dislocation to minimize the maximum completion and minimization the maximum complete tardiness on the constraints with deteriorating effect, And their computational complexities are given.In capt 3, We consider the rescheduling problems with the constant time or the same processing time or the same due date. Rescheduling problems with the time disruption and sequence disruption are convex combination relations to minimize the total complete time. We also obtain the optimality of minimizing the maximum tardiness with the same processing time or the same due date. And their computational complexities are given.