检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《系统工程》2017年第9期121-127,共7页Systems Engineering
基 金:国家自然科学基金重点项目(71131006)
摘 要:本文讨论了具有确定目标时间窗的并行批处理机生产配送组合问题,且订单最后一道工序需要在目标时间窗内发生并完成。本文提出分组生产配送策略,在该系统中,全部订单被分为若干组,按组在并行批处理机上加工完成后,各订单被分别配送至对应目的地。研究目的在于安排合理的订单分组及加工机器分配,从而最小化全部订单的配送提早时间及延迟时间之和。提出了混合整数规划模型及两种遗传算法来解决此生产调度问题。实验结果显示本文提出的启发式算法明显优于传统方法,算法有一定借鉴意义。This paper investigates the integrated scheduling of production and distribution on parallel identical batch processing machines with incompatible job families and a common due window, where the last phase to complete orders should take place within the due window. In this system, orders are integrated into several groups to be processed on parallel batching machines, and then delivered separately. The objective of the study is to determine an order schedule and machine assignment, so as to minimize the sum of earliness and tardiness. Mathematical modeling and two genetic algorithms (M-GA, G-GA) have been proposed to solve the problem. The experimental results demonstrate that the proposed heuristic algorithms are outperformed than the traditional method with acceptable computation time.
分 类 号:O221[理学—运筹学与控制论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.134.81.178