摘要
通过大量的企业调研,提出了一类新的目标排序问题——单机带调整时间加权成套订单数排序问题:n个工件来自m个订单,分属B个不同类别,不同类之间的工件连续加工有调整时间,各工件有自己的交货期,一个订单中所有工件均按期完工则该订单成套完工,目标为加权成套延迟订单数最小。提出两类问题并且通过数学模型进行表述,设计相应的遗传算法,仿真结果表明该算法是可行而有效的。
An actual single machine scheduling problem with setup time to maximize the numbers of wholeset orders is put forward. A mathematics model is presented to express the problem. Two algorithms based on genetic algorithm are designed to solve the two problems. An example and many random data show that the effectiveness of the algorithm is good.
出处
《工业工程》
2007年第3期119-122,共4页
Industrial Engineering Journal
关键词
单机
成套订单
遗传算法
分组排序
single machine
whole-set orders
genetic algorithm
scheduling with batching
