Research On Incompatible Job Families Scheduling Problem With Module Changes

During the 13 th Five-Year Plan period,manufacturing industry is seeking for the new engine of economic growth.Meanwhile,with the development of the emerging technology,i.e.big data,data association,it is possible for enterprise to forecast market dynamics,make decision.Incompatible job families scheduling problem has been studied,under the new requirements of production and manufacturing.This research is motivated by a scheduling problem found in the special steel industry of continuous casting processing,where the special steel is produced on the parallel machines.Based on that,a incompatible job families scheduling problem is investigated,and the different types of deteriorating jobs,and the module change activity are taken into consideration simultaneously.The main tasks are as follows.(1)We attempt to investigate a parallel machine scheduling problem with the objective of minimizing the makespan,i.e.,the completion time of the last job.The effect of deterioration,incompatible job families,and the module changes activity are taken into consideration simultaneously,and the actual processing time of each job depends on its starting time and normal processing time.Some structural properties are derived for the single-machine scheduling problem,which provides a basis of making the optimal policy to minimize the makespan.A hybrid SADE-AFSA algorithm combining Self-Adaptive Differential Evolution(SADE)and Artificial fish swarm algorithm(AFSA)is proposed to tackle this problem.Finally,the computational experiments are conducted to evaluate the performance of the proposed algorithm.(2)We investigated an unrelated parallel machines scheduling problem,in which the different machines have nonidentical processing speed,and the incompatible job families,linear deteriorating jobs and linear module change activities are taken into consideration simultaneously.With the objective to minimize the makespan,a mixed integer programming model is formulated,and a heuristic algorithm is proposed to obtain the fitness function.Finally,a hybrid AFSA-VNS algorithm is designed to solve the unrelated parallel-machine scheduling problem.The computational experiments show that AFSA-VNS achieves a better balance between the capability of exploration and the converging speed.