Production Scheduling For Job Shop And Cellular Manufacturing Considering Buffer And Transportation Capacity Constraint

With the development of level of production,and the diversity of demand,the production mode changes from large scale to multispecies,small scale step by step.In recently years,because of the competition becoming more and more intense,the enterprises have to consider to save the cost of production from all aspects,such as space usage,efficiency of machines and inventory of production,and increasing of complexity of processing route of production leads to the movement between different machines become an element can not be ignored,which can influence efficiency of production directly.Due to the limitation of equipment of single workshop,the phenomenon collaborative product between different workshops becomes more and more frequent in the enterprise,providing a high quality scheduling plan according to collaborative product between different workshops(cells)quickly is difficult.The efficiency and complexity of the collaborative product between different workshops(cells)would influence the quality of enterprise production directly,and the location of different cells makes the transportation between them becomes an inevitable link.Based on analyzing the review the status of workshop scheduling and cell manufacture scheduling,this dissertation refines the science question in line with the important elements which can influence scheduling and the existing problems of the enterprise,provides theory basis for the pratical product in the enterprise.This work was financially supported by the National Natural Science Foundation of China(No.71420107028)and the National Science Fund for Innovative Research Groups(No.71021061).The research problem and research content in the paper are as followed:(1)Job shop scheduling problem with limited buffer is addressed.For an enterprise,reducing the space occupation of machines is an effective way to save cost of production.With the objective minimizing the process make-span,an integer nonlinear programming(INLP)model is proposed to describe the problem.Based on the disjunctive graph model,a two-stage algorithm consisting of local search is proposed.Computational results are presented for a set of 40 benchmark tests,show the effectiveness of the proposed algorithm and discuss the influence of the buffer capacity on scheduling.(2)No buffer Job Shop problem with blocking constraints and automated guided vehicles is addressed.It is a further research of above problem,and reducing using of the source of transportation can also save the cost of production.According to whether considering L/U station or not,two integer nonlinear programming(INLP)models are proposed respectively with the objective minimizing the process make-span.Based on former researches,new disjunctive graph model from viewpoint of machine is presented,also improve and put forward new related properties,accordingly,a two-stage heuristic algorithm that combines an improved timetabling method and a local search is proposed.Computational results are presented for a set of 96 benchmark tests,show the effectiveness of the proposed algorithm through comparing with Lingo.(3)Job shop cell scheduling problem with inter-cell moves and automated guided vehicles is addressed.The transportation between different cells is inevitable in multi-cell part scheduling,in practical production,usually,the source of transportation is time-restricted.A nonlinear programming(NLP)model is proposed to determine the sequences of the parts processed on the machines.Because of the complexity of the CPS problem,it is divided into two sub-problems:the Intra-cell part scheduling problem(Intra-CPS)and the Inter-cell part scheduling problem(Inter-CPS).A genetic algorithm based on local search and a heuristic based on roulette are proposed to solve two sub-problems respectively.Computational results are presented for a set of randomly generated tests,show the effectiveness of the proposed algorithm through comparing with CPLEX and other heuristic algorithms in literature.(4)Cell part scheduling(CPS)problem with consideration Inter-cell transportation time is addressed.The processing route of parts can be flexible.Through applying a mature mechanism,it can promotes the efficiency of cooperation between different cells,which makes the scheduling scheme with a higher quality.The objective is to minimize the overall process make-span.An integer nonlinear programming(INLP)model is formulated to determine the schedule scheme of all parts.An auction-based heuristic approach is proposed to solve it,which focuses on dealing with cooperation between different cells.Computational results are presented for a set of randomly generated tests,show the effectiveness and stability of the proposed algorithm,and discuss the influence of parameters on the approach through sensitivity analysis.