Computational Experience with a Sequencing Algorithm Adapted to the Tardiness Problem
- 1 March 1977
- journal article
- research article
- Published by Taylor & Francis in A I I E Transactions
- Vol. 9 (1) , 32-35
- https://doi.org/10.1080/05695557708975118
Abstract
This paper summarizes computational experience with a generalized dynamic programming algorithm known as the Chain Algorithm. This algorithm is a general purpose procedure for solving sequencing problems, and in this study the procedure is adapted to the problem of minimizing total tardiness in the single-machine model. The results indicate that at the present state of the art, 50-job problems can normally be solved in a few seconds of computer time, although memory requirements may be extensive.Keywords
This publication has 0 references indexed in Scilit: