研究生数学建模竞赛选拔赛.docVIP

武汉大学 第十届全国研究生数学建模竞赛选拔赛 学 院：信息管理学院 专 业：管理科学与工程 姓 名：叶珍芳 学 号：2012201040002 流水线车间调度优化问题 摘要 本文通过建立三个模型：遗传算法模型、n/m/P/Fma模型、穷举算法模型，对题设的问题进行了全面的分析。 遗传算法模型中，以占用约束和顺序约束为约束条件，所有加工件完成加工所需的总时间最短为决策目标，运用遗传算法对模型求解，因而称之为遗传算法模型。虽然该模型适用性强，但对算法的要求高，作者没有做出成功的结果展示。 n/m/P/Fmax模型是解决流水线车间调度优化问题的典型模型，该模型计算量小，简单易用。本文给出来了工序完成时间的递推公式，运用启发式算法pamler的两种斜度指标，得到两个完工时间为35分钟的最优调度：(1,3,4,6,5,2)和(1,4,3,6,5,2)，并画出(1,3,4,6,5,2)顺序下的各工件的移动方式图。 以上两种模型都是解决车间调度问题的常用模型。具体问题需要具体分析，作者认为穷举法对于本问题是可行的。作者以matlab为辅助计算工具，穷举6种加工件的排列，得到14种不同的调度，工序完成时间均为35分钟。该模型较为全面的给出最优调度，同时验证了n/m/P/Fmax模型结论的正确性。 关键词： 车间调度优化 遗传算法 n/m/P/Fmax调度 穷举法 Abstract This paper puts forward three models to solve the particular flow shop scheduling problem comprehensively. In the first model, the paper analysis the flow shop scheduling problem and describes the problem through mathematic depiction . Genetic algorithm is applied to solve this model. But it demands a very understanding of the algorithm so that the author failed to show a successful result. Then, the paper introduces the n/m/P/Fmax model，which is classical to solve line shop scheduling optimization problem. In this part, the author obtains recursion formula to compute every jobs complete time and uses a heuristic algorithm called Pamler. Two optimal scheduling strategies is found and their complete time is both 35 minutes. They are (1,3,4,6,5,2) and (1,4,3,6,5,2). Although both models above are classical in solving job shop scheduling problem, enumeration method is feasible in this small-scale problem. With the help of matlab, try to display all the schedule, calculate their complete time and find out the minimum. In this way, 14 different scheduling is found and the two strategies provided in the second model are included. This model finds out all the optimal scheduling strategies. Also, it verifies the correctness of the second model. Keyword: Shop scheduling optimization Genetic Algorithm n/m/P/Fmax scheduling method of exhaustion 一、问题重述 某车间有三台机器,分别用于弯折金属管,焊接连接处,以及装配