Sequencing independent jobs with a single resource
暂无分享,去创建一个
[1] H. Emmons. One machine sequencing to minimize mean flow time with minimum number tardy , 1975 .
[2] Horace W. Heck,et al. A note on the extension of a result on scheduling with secondary criteria , 1972 .
[3] A. J. Clewett,et al. Introduction to sequencing and scheduling , 1974 .
[4] L. Gelders,et al. Coordinating Aggregate and Detailed Scheduling Decisions in the One-Machine Job Shop: Part I. Theory , 2015, Oper. Res..
[5] Hamilton Emmons,et al. A note on a scheduling problem with dual criteria , 1975 .
[6] E. Lawler. A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness , 1977 .
[7] Eugene L. Lawler. On Scheduling Problems with Deferral Costs , 1964 .
[8] J. M. Moore,et al. A Functional Equation and its Application to Resource Allocation and Sequencing Problems , 1969 .
[9] Ludo Gelders,et al. Coordinating Aggregate and Detailed Scheduling in the One-Machine Job Shop: II - Computation and Structure , 1975, Oper. Res..
[10] Jeffrey B. Sidney,et al. An Extension of Moore’s Due Date Algotithm , 1973 .
[11] Linus Schrage,et al. Dynamic Programming Solution of Sequencing Problems with Precedence Constraints , 1978, Oper. Res..
[12] J. M. Moore. An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .
[13] Eugene L. Lawler,et al. Optimal Sequencing of a Single Machine Subject to Precedence Constraints , 1973 .
[14] Hamilton Emmons,et al. One-Machine Sequencing to Minimize Certain Functions of Job Tardiness , 1969, Oper. Res..