Research On Parallel Batch Machines Scheduling Problem Considering Step-deteriorating Jobs

With the updating of new information technology,manufacturing technology and other software and hardware technologies,as well as the increasing market demand,the original classic scheduling has been far from meeting the actual production and manufacturing requirements.Compared with the classic scheduling,the batch scheduling is more suitable for many modern production and manufacturing.Therefore,in-depth research on batch scheduling has become one of the key issues to achieve efficient utilization of production resources and maximization of production efficiency.This paper focuses on the actual production and manufacturing problems in heat treatment of steel.Based on the application of new information technology such as intelligent sensing and cloud computing in actual production and manufacturing,the parallel batch scheduling problems considering different types of step-deterioration of processing times are studied.The main research work of this paper is as follows:(1)The parallel-batching machines scheduling problem with two-step deteriorating jobs is studied.The goal is to maximize the total net revenue,and the corresponding mathematical model is constructed.Then the problem is described in detail and the structural properties of different situations in the problem are proved.Based on the structural properties,one heuristic algorithm is proposed to determine the optimal scheduling scheme for the single machine problem.A novel hybrid VNS-IRG algorithm is proposed to solve the multiple machines problem.The effectiveness of the proposed algorithm is verified by a large number of experiments.(2)The parallel-batching machines scheduling problem considering step-deterioration of processing times with maximum deterioration date is studied.The goal is to minimizing the maximum completion time of all jobs,and the corresponding mathematical model is constructed.Then some structural properties of the problem are analyzed in detail,and the improved iterated reference search algorithm(the improved IRG)is proposed to solve the problem based on the concept of “less is more”.Through a large number of experiments,it is proved that the improved IRG algorithm can obtain better solutions in a shorter time,which is highly efficient and effective.