A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date
暂无分享,去创建一个
[1] A. J. Clewett,et al. Introduction to sequencing and scheduling , 1974 .
[2] J. J. Kanet. Minimizing the average deviation of job completion times about a common due date , 1981 .
[3] Mesbah U. Ahmed,et al. Minimizing the sum of absolute lateness in single‐machine and multimachine scheduling , 1984 .
[4] Nicholas G. Hall. Single- and multiple-processor models for minimizing completion time variance , 1986 .
[5] Yih-Long Chang,et al. MINIMIZING MEAN ABSOLUTE DEVIATION OF COMPLETION TIMES ABOUT A COMMON DUE DATE. , 1986 .
[6] Yih-Long Chang,et al. Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date , 1987 .
[7] J. A. Hoogeveen,et al. Scheduling around a small common due date , 1991 .
[8] Mesbah U. Ahmed,et al. Minimizing the Weighted Sum of Late and Early Completion Penalties in a Single Machine , 1990 .
[9] Gary D. Scudder,et al. Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..
[10] Esther M. Arkin,et al. Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights , 1991, Oper. Res..
[11] Chung-Yee Lee,et al. Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date , 1991, Comput. Oper. Res..
[12] Bahram Alidaee,et al. Single Stage Minimum Absolute Lateness Problem with a Common Due Date on Non-Identical Machines , 1993 .