Paralle-machine Scheduling With Potential Machine Disruptions

Modern industrial production often operates in a dynamic and uncertain environ-ment.In which unexpected events sometimes occur.If the expected events interrupt,they may cause some resources(machines or equipment)to be unavailable for a certain period of time,which will directly affect the utilization of resources and task completion.There are many destructive events in the production process.For example,machine failure,power failure,bad weather(typhoon,snow disaster),transportation delay and shortage of raw materials will cause machine interruption,but the starting time of interruption is known(will occur).However,the duration of interruption is unknown.This paper is divided into four chapters.To study the problem of parallel machines with potential disturbances under workpiece deterioration and maintenance interval constraints.1.Paralle-machine scheduling of potential machine disruptions(non-resumable).Machine disturbance occurs at a special time,and the actual processing time of work-piece increases with the wear degree of machine,that is,workpiece degradation,on the disturbed machine,a random maintenance service is taken and the maintenance is car-ried out after a workpiece is processed and repaired.The wear degree of the machine will be cleared,that is to say,the state of the machine is the same as that of the new machine.Aiming at the unrecoverable processing condition of the workpiece,the objec-tive function is to minimize the expected total completion time.Based on SPT rule,a pseudo-polynomial time algorithm is proposed to optirnize the processing sequence,and the time cornplexity of the algorithm is given.2.Paralle-machine scheduling of potential machine disruptions(resumable).The working condition of the workpiece is recoverable,that is,the workpiece interrupted by disturbance can continue to process the processed part.The maintenance interval can be divided into three cases:before the disturbance interval,the overlapping part of the maintenance interval and the disturbance interval,or the continuous part,and after the disturbance interval,a pseudo-polynomial time algorithm is proposed for each case.The corresponding proof of time complexity is given.