Study On Cell Manufacturing Scheduling Problem Based On The Analytical Target Cascading

In the existing competitive world of business, the productive companies are competingon providing services or producing goods based on the rapid changes of the market withhigher quality in minor expense. Short production life cycles, short delivery times, highproduction variety and diverse customer need have challenged manufacturers to improvetheir production efficiency and meet changing market demands quickly. Cellularmanufacturing (CM) is a production system, in which parts requiring a similar productionprocess are grouped in distinct manufacturing cells. It incorporates the flexibility of jobshops and the high production rate of flow shop lines. Currently cellular manufacturing isbecoming more and more popular. Reported benefits of the implementation of cellularmanufacturing systems include reductions in work-in-Process, finished goods inventory,response time to orders, transportation distance/time, setup time and production cost.Based on analyzing the research status of cellular manufacturing in a deep going way,this thesis detailed study the crucial problems on implementation and operation of cellularmanufacturing systems, which is cell scheduling problem. Components scheduling inCellular manufacturing system mainly solve parts intra-cell and inter-cell schedulingproblem after the cell construction and cell layout finished. This paper considers the actualmanufacture information. A cell scheduling problem in cellular manufacturing systemconsidering dynamic parts family with different routings processed on machines in multiplecells are studied. A grading scheduling algorithm of the problem is proposed by minimizingthe flow time in a cellular manufacturing system. The algorithm could distributedynamically the number of parts of every cell, forming the dynamic parts families andprogram the path of every part reasonably and effectively in cellular manufacturing system,considering the processing time and quantity. Secondly, according to the dynamic changesof production tasks, combination the superiority of virtual scheduling technique to dynamicenvironment, a dynamic scheduling general framework of manufacturing cell based on cellmanufacturing system is proposed and a dynamic scheduling algorithm of manufacturingcell is developed. Calculating the similarity of each parts of a new phase, when a certainamount of the similarity of parts are less than a constant, dynamic scheduling strategy istaken. This way can make the cell manufacturing system better adapt to the changes ofmarket environment, highlighting the cell manufacturing advantages. According to the characteristics of dynamic scheduling, the corresponding mathematic dynamic schedulingmodel was constructed and Genetic Algorithm is design to solving this model. Schedulingobjective is weighted makespan and total traveling distance minimization. Combined withthe effectiveness of the genetic algorithm to solve the complicated problem, the solvingprocess of the virtual operation model is proposed based on genetic algorithm.This paper also provided an application of the cell scheduling into a shipbuilding plant.First, the basic situation of the plant is introduced, and the status and problems aboutproduction management is analyzed. Then, by collecting data of the production system, themethod about scheduling proposed in this paper is successfully applied to the Neiyeworkshop of this company. Finally, analyze and compare with the original productionplanning.