A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
暂无分享,去创建一个
[1] Jan Karel Lenstra,et al. Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence Constraints , 1983, Oper. Res..
[2] Toshihide Ibaraki,et al. A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times , 1978, Oper. Res..
[3] M.-C. Rubinstein,et al. Application de la théorie des graphes au choix des investissements à court terme dans un réseau électrique sujet à avaries , 1976 .
[4] J. M. Moore. An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .
[5] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[6] J. M. Moore,et al. A Functional Equation and its Application to Resource Allocation and Sequencing Problems , 1969 .