국가지식-학술정보
A Study for Scheduling Jobs on Unrelated Parallel Processors
A Study for Scheduling Jobs on Unrelated Parallel Processors
- 한국국방경영분석학회
- Journal of the military operations research society of Korea
- Vol.9 No.1
-
1983.0151 - 61 (11 pages)
- 0
커버이미지 없음
Lagrangian relaxation is used to the problem of scheduling jobs on unrelated parallel processors with the objective of minimizing makespan. The implicit condition for optimality is drawn out explicitly in order to apply the subgradient algorithm. To obtain the optimal solution, branch-and-bound-search method is devised. In the search, the special structure of the problem is exploited effectively, Some computational experiences with the algorithm are presented, and comparisons are made with the Land and Doig method.
(0)
(0)