학술논문
INVESTIGATION OF VARIOUS BOUNDING PROCEDURES FOR PRODUCTION SCHEDULING PROBLEMS.
Document Type
Article
Author
Source
Subject
*Production (Economic theory)
*Production scheduling
*Problem solving
*Empirical research
Methodology
Branching processes
Computational complexity
*
*
*
Language
ISSN
0020-7543
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. [ABSTRACT FROM AUTHOR]