Two-machine flowshop scheduling to minimize total tardiness
暂无分享,去创建一个
[1] Wayne E. Smith. Various optimizers for single‐stage production , 1956 .
[2] Linus Schrage,et al. Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks , 1978, Oper. Res..
[3] A. Kan. Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .
[4] Marshall L. Fisher,et al. A dual algorithm for the one-machine scheduling problem , 1976, Math. Program..
[5] L. Gelders,et al. Four simple heuristics for scheduling a flow-shop , 1978 .
[6] Hamilton Emmons,et al. One-Machine Sequencing to Minimize Certain Functions of Job Tardiness , 1969, Oper. Res..
[7] Maurice Queyranne,et al. The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling , 1978, Oper. Res..
[8] B. J. Lageweg,et al. Minimizing Total Costs in One-Machine Scheduling , 1975, Oper. Res..
[9] Yeong-Dae Kim,et al. Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness , 1993 .
[10] W. Townsend. Note---Sequencing n Jobs on m Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution , 1977 .
[11] Linus Schrage,et al. Dynamic Programming Solution of Sequencing Problems with Precedence Constraints , 1978, Oper. Res..
[12] Chris N. Potts,et al. A decomposition algorithm for the single machine total tardiness problem , 1982, Oper. Res. Lett..
[13] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .
[14] Jatinder N. D. Gupta,et al. The two-machine flowshop scheduling problem with total tardiness , 1989, Comput. Oper. Res..