Showing papers on "Bounding overwatch published in 1968"
TL;DR: Five promising bounding procedures are studied and investigated empirically and their effects on the efficiency of the branch-and-bound technique for solving the production scheduling problem are investigated.
Abstract: SUMMARY This paper is concerned with the efficiency of the branch-and-bound technique for solving the production scheduling problem. Since the efficiency of this technique depends on a powerful lower bound, five promising bounding procedures are studied and investigated empirically. This investigation is based on the number of nodes explored and the computational time involved. Several computational experiments are conducted and results reported.
15 citations