a Department of Industrial System Engineering, Faculty of Engineering, Canada
b Department of Computer Science, Faculty of Science University of Regina, Regina, Saskatchewan, Canada S4S OA2
Abstract:
Scheduling of traffic through a tree-structured model under a semi-parallel constraint is considered. The problem of finding the optimal root without resort to exhaustive search is studied. Several sufficient conditions to exclude a node as a optimal root candidate are presented.