V-shape property for job sequences that minimize the expected completion time variance
暂无分享,去创建一个
[1] Samuel Eilon,et al. Minimising Waiting Time Variance in the Single Machine Problem , 1977 .
[2] John J. Kanet,et al. Minimizing Variation of Flow Time in Single Machine Systems , 1981 .
[3] C. R. Bector,et al. Minimizing the Flow-time Variance in Single-machine Systems , 1990 .
[4] M. Raghavachari. A V-shape property of optimal schedule of jobs about a common due date , 1986 .
[5] Suresh P. Sethi,et al. Earliness-Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date , 1991, Oper. Res..
[6] 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..
[7] Gary D. Scudder,et al. Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..
[8] M. Raghavachari,et al. Deterministic and Random Single Machine Sequencing with Variance Minimization , 1987, Oper. Res..
[9] Alan G. Merten,et al. Variance Minimization in Single Machine Sequencing Problems , 1972 .
[10] Madabhushi Raghavachari,et al. V-shape property for optimal schedules with monotone penalty functions , 1992, Comput. Oper. Res..
[11] Prabuddha De,et al. On the Minimization of Completion Time Variance with a Bicriteria Extension , 1992, Oper. Res..
[12] Marc E. Posner,et al. Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date , 1991, Oper. Res..