New Models And Algorithms For Machine Scheduling With Due Window

With the rapid development of the world economic situation,the resources are becoming scarcer,the competition among enterprises is becoming more intense,and in the meantime customers' demand is becoming diversified and personalized.The changing market environment requires enterprises to improve their efficiency,product quality and the utilization rate of resources so as to improve their competitiveness.As the core part of manufacturing enterprise,production scheduling is the main means for these enterprises to implement production plan,which determines the quality of final products and production efficiency in the enterprises.Under this background,how to use advanced modeling and optimization algorithm to improve the production scheduling technology of enterprises so as to improve the whole level of manufacturing industry and utilization rate of resources,which brings an unprecedented challenge to both manufacturing enterprises and academic circles.First of all,this paper recommends the research background and significance of production scheduling,analyzes and summarizes some research status related to this topic,and proposes the scheduling problem to be studied.Secondly,this paper presents a general production scheduling model for job position-dependent processing about DeJong learning(aging)effects.In different parameter settings,this model can be expressed as a learning model or as an aging effect model.In the new model,when it expresses a learning effects model,with the increase of the number of the workpiece,the processing time will not be to zero;when it expresses an aging effect model,with the increase of the number of the workpiece,the processing time will not be infinite.Compared with the traditional model of learning effect or aging effect,this model is more accordant with the actual situation,it is also a creative point of this thesis.In addition,the actual processing time of jobs will be affected by the resource factors,so we consider resource allocation situation to combine with the above model in order to be closer to the reality of production.Then,considering the punctual delivery time is an important factor in improving the competitiveness of manufacturing enterprises,and under the current research background of JIT production,we thus study the production scheduling problem with due windows.In this paper,we propose two different due window mechanisms,common due window and slack due window.The former means that all jobs have the same delivery time,and the latter means that each job has its own delivery time.We combine the two new models above-mentioned with the two types of due-window mechanisms to study further.By changing the value of the factor M,the four models can be simplified into eight specific scheduling problems,and we give the optimal algorithms to solve these four kinds of models through study and analysis.Finally,we use LINGO tools for data analysis on the designed algorithms,analyze and compare the results of each model.We ultimately draw some conclusion and illustrate the effectiveness of the algorithms from the perspective of practice.