| 基于改进的RA算法的混合Flowshop调度问题的求解 |
| |
| 引用本文： | 李霄峰,戴晓明,邵惠鹤,任德祥.基于改进的RA算法的混合Flowshop调度问题的求解[J].计算机工程,2002,28(6):152-153. |
| |
| 作者姓名： | 李霄峰 戴晓明 邵惠鹤 任德祥 |
| |
| 作者单位： | 1. 上海交通大学自动化研究所,上海,200030
2. 上海宝钢技术中心自动化所,上海,201900 |
| |
| 摘 要： | 针对混合Flowshop系统的最小化Makespan调度问题,提出基于改进的RA斜度指标的启发式算法来对工件进行排序,采用FAM算法来分配设备并给出其最优值的下界检验该算法。仿真结果表明该方法优于目前最好的启发式算法能较好地解决混合Flowshop的调度问题。
|
| 关 键 词： | 混合Flowshop 斜度 下界值 Makespan 调度 |
| 文章编号： | 1000-3428(2002)06-0152-02 |
| 修稿时间： | 2001年8月1日 |
A New Approach of Improved RA Algorithm for Hybrid Flowshop Scheduling |
| |
| LI Xiaofeng,DAI Xiaoming,SHAO Huihe,REN Dexiang.A New Approach of Improved RA Algorithm for Hybrid Flowshop Scheduling[J].Computer Engineering,2002,28(6):152-153. |
| |
| Authors: | LI Xiaofeng DAI Xiaoming SHAO Huihe REN Dexiang |
| |
| Affiliation: | LI Xiaofeng1,DAI Xiaoming1,SHAO Huihe1,REN Dexiang2 |
| |
| Abstract: | This paper proposes a scheduling approach of improved RA heuristic to Minimize makespan problem in hybrid Flowshop, in which improved RA heuristic algorithm is used to get a sequence of jobs and the first available machine (FAM) rule is designed for allocating devices for jobs. A lower bound is proposed to check this algorithm's deviation of the optimum makespan. The simulation result shows that the algorithm can get a good schedule for hybrid Flowshop. |
| |
| Keywords: | Hybrid Flowshop Gradient Lower bound Makespan Scheduling |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
