运输能力有限的分段两阶段多车间调度问题
发布时间：2019-02-23 11:21
【摘要】：为有效解决船舶分段生产过程中存在的返工、运输能力限制以及堆场面积约束等问题,分析两阶段多车间调度的特点,构建了运输能力有限的分段两阶段多车间调度模型。模型综合考虑了分段批次内重调度、批次间的分割合并、分段返工以及缓冲面积和运输能力约束,目标是最小化分段的最大完工时间,建立分段在加工车间、装配车间以及堆场中的调度数学模型。利用基于路径选择的分段两阶段多车间调度启发式算法进行求解,并通过数值实验以及对比分析验证了模型的合理性和算法的有效性。
[Abstract]:In order to effectively solve the problems of rework, transportation capacity limitation and yard area constraint in the process of ship segmented production, the characteristics of two-stage multi-workshop scheduling are analyzed, and a segmented two-stage multi-workshop scheduling model with limited transportation capacity is constructed. The model synthetically takes into account the intra-batch rescheduling, segmentation and merging between batches, piecewise rework, buffer area and transportation capacity constraints. The goal of the model is to minimize the maximum completion time of the segment and to establish the segmented workshop. The mathematical model of scheduling in assembly shop and yard. The heuristic algorithm of two-stage multi-job shop scheduling based on path selection is used to solve the problem. The rationality of the model and the validity of the algorithm are verified by numerical experiments and comparative analysis.
【作者单位】： 同济大学机械与能源工程学院;
【基金】：国家自然科学基金(No.70872076) 上海科技创新行动计划资助项目(No.11dz1121803)
【分类号】：U673;TP301.6
，
本文编号：2428774
[Abstract]:In order to effectively solve the problems of rework, transportation capacity limitation and yard area constraint in the process of ship segmented production, the characteristics of two-stage multi-workshop scheduling are analyzed, and a segmented two-stage multi-workshop scheduling model with limited transportation capacity is constructed. The model synthetically takes into account the intra-batch rescheduling, segmentation and merging between batches, piecewise rework, buffer area and transportation capacity constraints. The goal of the model is to minimize the maximum completion time of the segment and to establish the segmented workshop. The mathematical model of scheduling in assembly shop and yard. The heuristic algorithm of two-stage multi-job shop scheduling based on path selection is used to solve the problem. The rationality of the model and the validity of the algorithm are verified by numerical experiments and comparative analysis.
【作者单位】： 同济大学机械与能源工程学院;
【基金】：国家自然科学基金(No.70872076) 上海科技创新行动计划资助项目(No.11dz1121803)
【分类号】：U673;TP301.6
，
本文编号：2428774
本文链接：https://www.wllwen.com/kejilunwen/chuanbolw/2428774.html
