关于问题P_m|intree;p_j=1;r_j|C_(max)的分支定界算法

A Branch-and-Bound Algorithm for P_m|intree;p_j = 1;r_j|C_(max) Problem

本文针对一个尚未解决的问题Pm|intree;pj=1;rj|Cmax进行了研究,借助于决策论中的递阶层次结构的概念提出一个全新的分支定界算法,并用这一算法得到了问题Pm|intree;pj=1;rj|Cmax的最优排序．

In this paper, we study the problem Pm｜intree;pj=1;rj｜Cmax that has been consid- ered 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.