Research Of Related Problems Of Flow-shop Scheduling And Rescheduling

Scheduling is to complete given task optimally using some machines and resources.When performing these tasks,some constraints must be satisfied,such as the processing order of the jobs,the limitation of disruption,etc.The optimal completion refers to optimizing the objective functions.Scheduling problems are common in real life and many practical problems can be attributed to scheduling problems.Therefore,the scheduling problem is of great significance to the rational utilization of resources and the effective improvement of efficiency.Rescheduling is the process in which the decision maker reorder the new jobs together after optimally sorting the original set of jobs.Flow shop is the process in which each job is processed in the same order on each machine.The following is the research content of this paper:1 ? We consider the rescheduling models of two machine flow-shop under machine compatible,job anticompatible or compatible,four disruption constraints,respectively.This part analyzes the properties of these models,designs the corresponding algorithm,and proves the optimal and feasible of the algorithm.2?We consider the rescheduling models of two machine flow-shop under machine anticompatible,job anticompatible,four disruption constraints,respectively.This part analyzes the properties of these models,designs the corresponding algorithm,and proves the optimal and feasible of the algorithm.3?We consider under the constraints of maximum completion time for original jobs,the rescheduling models of two machine flow-shop with minimize the maximum completion time for new jobs,respectively.This part analyzes the properties of these models,designs the corresponding algorithm,and proves the optimal and feasible of the algorithm.