SEARCH-REDUCTION TESTS FOR A COMBINATORIAL PRODUCTION SEQUENCING ALGORITHM
CARNEGIE INST OF TECH PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP
Pagination or Media Count:
Recently a number of tree search algorithms have been proposed for solving combinatorial optimization problems. The practical value of such approaches depends heavily on the tests used to identify and exclude dominated alternatives from consideration. An interesting study by Pierce and Hatfield gives a useful tree search algorithm for a certain class of production sequencing problems, and further motivates the search for new theoretical results on which more effective tests can be based. The paper attempts to provide such results and to lay a foundation for exploiting them in an efficient way.
- Operations Research