INVESTIGATION OF VARIOUS BOUNDING PROCEDURES FOR PRODUCTION SCHEDULING PROBLEMS∗
- 1 January 1968
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 7 (3) , 249-252
- https://doi.org/10.1080/00207546808929815
Abstract
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.Keywords
This publication has 4 references indexed in Scilit:
- Flow-Shop Scheduling with the Branch-and-Bound MethodOperations Research, 1967
- Some Applications of the “Branch-and-Bound” Algorithm to the Machine Scheduling ProblemJournal of the Operational Research Society, 1966
- Application of the Branch and Bound Technique to Some Flow-Shop Scheduling ProblemsOperations Research, 1965
- A “Branch-and-Bound” Algorithm for the Exact Solution of the Three-Machine Scheduling ProblemJournal of the Operational Research Society, 1965