论文信息 - A dynamic programming method for single machine scheduling - 字舞流文

A dynamic programming method for single machine scheduling

T. Ibaraki | Yuichi Nakamura

[1] T. S. Abdul-Razaq,et al. Dynamic Programming State-Space Relaxation for Single-Machine Scheduling , 1988 .

[2] Chris N. Potts,et al. A Branch and Bound Algorithm for the Total Weighted Tardiness Problem , 1985, Oper. Res..

[3] Chris N. Potts,et al. A decomposition algorithm for the single machine total tardiness problem , 1982, Oper. Res. Lett..

[4] Paolo Toth,et al. State-space relaxation procedures for the computation of bounds to routing problems , 1981, Networks.

[5] Marshall L. Fisher,et al. A dual algorithm for the one-machine scheduling problem , 1976, Math. Program..

[6] B. J. Lageweg,et al. Minimizing Total Costs in One-Machine Scheduling , 1975, Oper. Res..

[7] M. Held,et al. A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[8] Boris Polyak. Minimization of unsmooth functionals , 1969 .