| 最大化流水作业加权成套订单数的研究 |
| |
| 引用本文： | 周水银,傅青. 最大化流水作业加权成套订单数的研究[J]. 控制工程, 2007, 14(2): 212-214 |
| |
| 作者姓名： | 周水银 傅青 |
| |
| 作者单位： | 华中科技大学,管理学院,湖北,武汉,430074 |
| |
| 摘 要： | 针对流水作业的加工过程及其复杂性,建立了基于两台机器流水作业工件排序的0-1混合整数规划模型,以最大化加权成套订单数为目标函数.基于求解此类NP难题主要用启发式近似算法,提出了合成分派规则与局部搜索算法相结合的近似算法,用来求解所提出的混合整数规划模型.应用实例表明,用启发式近似算法,以最大化两机流水作业成套订单数为目标,可得出较满意的工件排列次序,从而表明了该算法的有效性.
|
| 关 键 词： | 流水作业 加权成套订单数 合成分派规则 局部搜索 |
| 文章编号： | 1671-7848(2007)02-0212-03 |
| 修稿时间： | 2006-03-10 |
Maximizing the Weighted Whole-set Orders of Flow Shop |
| |
| ZHOU Shui-yin,FU Qing. Maximizing the Weighted Whole-set Orders of Flow Shop[J]. Control Engineering of China, 2007, 14(2): 212-214 |
| |
| Authors: | ZHOU Shui-yin FU Qing |
| |
| Abstract: | Considered the process of flow shop and its complexity,a 0-1 mixed integer model is built to show the jobs scheduling in two-machine flow shop to maximize the weighted whole-set orders.Heuristic approximate algorithm is used to solve these NP programs.The composite dispatching rule is combined with local searching to solve the model.An example show the effectiveness of this approximate algorithm on solving the object of maximizing the weighted whole-set orders. |
| |
| Keywords: | flow shop weighted whole-set orders composite dispatching rule local searching |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
