작업 스케쥴링 문제 해결을 위한 Branch & Bound 해법의 비교분석

Abstract

This article evaluates the efficiency of three branch-and-bound heuristics for a job scheduling problem that minimizes the sum of absolute deviations of completion times from a common due date. To improve the performance of the branch-and-bound procedure, Algorithm SA is presented for the initial feasible schedule and three heuristics : breadth-first, depth-first and best-first search are investigated depending on the candidate selection procedure. For the three heuristics the CPU time, memory space, and the number of nodes generated are computed and tested with nine small examples (6≤n≤4). Medium sized random problems (10≤n≤30) are also generated and examined. The computational results are compared and discussed for the three heuristics.