Efficient heuristic and optimal approaches for n/2/F/ΣCi scheduling problems
文献类型：期刊论文
| 作者 | Wang CE(王成恩); Chu CB(储诚斌); Jean-Marie Proth |
| 刊名 | International Journal of Production Economics
 |
| 出版日期 | 1996 |
| 卷号 | 44期号:3页码:225-237 |
| 关键词 | Flow shop Scheduling Heuristic method Branch-and-bound algorithm Job completion time |
| ISSN号 | 0925-5273 |
| 产权排序 | 1 |
| 中文摘要 | The n-job two-machine flow shop scheduling problem is studied in this paper, with the criterion of minimizing the sum of job completion times. The scheduling problem is first formulated mathematically. Three heuristic methods are then invented to find near optimal schedules. Three lower bound generation schemata are designed to compute three different lower bounds from which the tightest one is used. To further reduce the search space, some dominance properties are proved. Then a branch-and-bound algorithm is developed to obtain an optimal schedule. Finally, results and analysis of numerical computations are presented. |
| 收录类别 | EI |
| 语种 | 英语 |
| 公开日期 | 2012-05-29 |
| 源URL | [http://ir.sia.cn/handle/173321/6880]  |
| 专题 | 沈阳自动化研究所_沈阳自动化所知识产出(2000年前) |
| 推荐引用方式 GB/T 7714 | Wang CE,Chu CB,Jean-Marie Proth. Efficient heuristic and optimal approaches for n/2/F/ΣCi scheduling problems[J]. International Journal of Production Economics,1996,44(3):225-237. |
| APA | Wang CE,Chu CB,&Jean-Marie Proth.(1996).Efficient heuristic and optimal approaches for n/2/F/ΣCi scheduling problems.International Journal of Production Economics,44(3),225-237. |
| MLA | Wang CE,et al."Efficient heuristic and optimal approaches for n/2/F/ΣCi scheduling problems".International Journal of Production Economics 44.3(1996):225-237. |
入库方式： OAI收割
来源：沈阳自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。