| 关于问题Pm|intree;pj=1;rj|Cmax的分支定界算法 |
| |
| 引用本文： | 张玉忠,张咸昭,孙志慧. 关于问题Pm|intree;pj=1;rj|Cmax的分支定界算法[J]. 运筹学学报, 2006, 10(2): 93-102 |
| |
| 作者姓名： | 张玉忠 张咸昭 孙志慧 |
| |
| 作者单位： | 曲阜师范大学运筹与管理学院,山东日照,276826 |
| |
| 基金项目： | 国家自然科学基金山东自然科学基金(Y2004A05)资助． |
| |
| 摘 要： | 本文针对一个尚未解决的问题Pm|intree;pj=1;rj|Cmax进行了研究,借助于决策论中的递阶层次结构的概念提出一个全新的分支定界算法,并用这一算法得到了问题Pm|intree;pj=1;rj|Cmax的最优排序．
|
| 关 键 词： | 运筹学 排序 同型机 分支定界 入树 |
| 收稿时间： | 2004-10-21 |
| 修稿时间： | 2004-10-21 |
A Branch-and-Bound Algorithm for Pm|intree; pj = 1; rj|Cmax Problem |
| |
| Zhang Yuzhong,Zhang Xianzhao,Sun Zhihui. A Branch-and-Bound Algorithm for Pm|intree; pj = 1; rj|Cmax Problem[J]. OR Transactions, 2006, 10(2): 93-102 |
| |
| Authors: | Zhang Yuzhong Zhang Xianzhao Sun Zhihui |
| |
| Affiliation: | College of Operations Research and Management Science of Qufu Normal University, Rizhao 276826, China |
| |
| Abstract: | In this paper, we study the problem Pm|intree;pj = 1; rj|Cmax that has been considered open before. By means of the concept of level-by-level which has been in the theory of strategy, we put forward a branch-and-bound algorithm from a completely new perspective. Furthermore,we get the optimal schedule for the problem Pm|intree;pj = 1;rj|Cmax. |
| |
| Keywords: | Operations research scheduling indentical machines branch-and-bound intree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
