分支定界算法在调度问题上的应用  

Application of Branch and Bound Algorithm on Dispatching Problem

作　　者：朱景福[1] 李欣[1] 王馨[2] 

机构地区：[1]黑龙江八一农垦大学 [2]哈尔滨工程大学计算中心

出　　处：《哈尔滨理工大学学报》1999年第1期101-103,共3页Journal of Harbin University of Science and Technology

摘　　要：以在ｎ台机器上串行加工ｍ个工件为例，讨论调度问题的最优求解方法，在分支定界算法中利用串行加工原理选取下界函数，在得到一个可能解后，通过回潮来取得最优解，从而揭示分枝定界算法在调度问题上的应用．The application of branch and bound algorithm on dispatching problem is discussedby the example of m workpieces being processed on n machines serially. Branch and boundalgorithm is used to get the optimal solution, lower limit function is selected by using seriallyprocessing principle, and the optimal solution is obtained by tracing. The paper focuses on discussing the selection of lower limit function in order to reduce the times of tracing.

关 键 词：节点 串行加工 最优解 分支定界算法 调度问题 

分 类 号：O224[理学—运筹学与控制论]