Computational Experience with a Sequencing Algorithm Adapted to the Tardiness Problem
暂无分享,去创建一个
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.
[1] V. Srinivasan. A hybrid algorithm for the one machine sequencing problem to minimize total tardiness , 1971 .
[2] Marshall L. Fisher,et al. A dual algorithm for the one-machine scheduling problem , 1976, Math. Program..
[3] Kenneth R. Baker,et al. An experimental comparison of solution algorithms for the single‐machine tardiness problem , 1974 .
[4] Hamilton Emmons,et al. One-Machine Sequencing to Minimize Certain Functions of Job Tardiness , 1969, Oper. Res..