面向成套订单的作业车间转换瓶颈算法研究-管理科学与工程专业毕业论文.docxVIP

华 华 中 科 技 大 学 硕 士 学 位 论 文 II II Abstract Currently, manufacturing enterprises are facing increasingly fierce market competition, and customers’ requirements for personality and delivery are increasingly stringent. Under the situation of a majority of enterprises implementing Just-in-time production and agile manufacturing and other advanced manufacturing models, purchasing activities among the manufacturing enterprises usually require orders set strictly. Therefore, the production method of MTO would further contribute to enhancing customer satisfaction. At present, the pursuit of the largest number of orders set Scheduling has become a hot research. In this paper, some basic research has been done in the application of using bottleneck analysis to solve the job-shop scheduling problems of whole-set orders. This paper establishes mathematical models according to the Job shop scheduling facing whole-set orders, analyses some bottlenecks restricting output in the circumstances of unbalanced production capacity, and analyses establishment and characteristics of the time of delivery bottlenecks in the delivery time using the method system of decomposition and bottleneck analysis, and heuristic algorithm based on bottleneck analysis is described. In this paper, relatively simple situation of only existing a single bottleneck in the production systems is discussed, and through relaxation of the capacity of processing bottlenecks to maximize the utilization of machines, designs heuristic algorithm embedded transfer bottleneck algorithms to get better solution and the way is proved to solve the problem more effective. Finally, the paper makes the preliminary study to the problems of existing more than one binding machine scheduling problems of whole-set orders, and through analyzing the relationship between bottlenecks (binding machine), the paper divides the original problems with the computational complexity into some relatively simple problems of binding machines sched