| 具有优势机器的无空闲同顺序Flow Shop排序问题 |
| |
| 引用本文： | 赵传立,唐恒永.具有优势机器的无空闲同顺序Flow Shop排序问题[J].运筹学学报,2005,9(4):14-20. |
| |
| 作者姓名： | 赵传立 唐恒永 |
| |
| 作者单位： | 沈阳师范大学数学与系统科学学院,沈阳,110034 |
| |
| 基金项目： | This work was supported by National Natural Science Foundation of China(NNSFC) 10471096
and Shenyang Normal University Doctoral Foundation 55440101007. |
| |
| 摘 要： | 本文讨论具有优势机器的无空闲同顺序Flow Shop排序问题的两种特殊情况,第一种情况是具有增减系列优势机器,第二种情况是具有减增系列优势机器．对于目标函数是最大完工时间,加权完工时间和,最大延误和延误工件数等问题,给出了求解最优排序的有效方法．
|
| 关 键 词： | 运筹学 排序 同顺序Flow Shop 无空闲 多项式算法 |
| 收稿时间： | 2004-10-12 |
| 修稿时间： | 2004年10月12 |
No-idle Permutation Flow Shop Scheduling Problem with Dominant Machines |
| |
| Zhao Chuanli,Tang Hengyong.No-idle Permutation Flow Shop Scheduling Problem with Dominant Machines[J].OR Transactions,2005,9(4):14-20. |
| |
| Authors: | Zhao Chuanli Tang Hengyong |
| |
| Abstract: | This paper deals with two special cases of the no-idle permutation flow shop scheduling problem.The first special case assumes a pair of joint series of increasing and decreasing dominating machines,while the second special case assumes a pair of joint series of decreasing and increasing dominating machines. Efficient solution procedures for finding the optimal permutation schedules for various performance measures,including makespan, weighted sum of completion times,maximum lateness, and the number of tardy jobs, are developed. |
| |
| Keywords: | Operations research scheduling permutation flow shop no-idle polynomial algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
