Pseudopolynomial algorithms for CTV minimization in single machine scheduling
暂无分享,去创建一个
[1] M. Raghavachari,et al. Deterministic and Random Single Machine Sequencing with Variance Minimization , 1987, Oper. Res..
[2] John J. Kanet,et al. Minimizing Variation of Flow Time in Single Machine Systems , 1981 .
[3] Wieslaw Kubiak,et al. Proof of a conjecture of Schrage about the completion time variance problem , 1991, Oper. Res. Lett..
[4] C. R. Bector,et al. Minimizing the Flow-time Variance in Single-machine Systems , 1990 .
[5] Wieslaw Kubiak,et al. New Results on the Completion Time Variance Minimization , 1995, Discret. Appl. Math..
[6] Samuel Eilon,et al. Minimising Waiting Time Variance in the Single Machine Problem , 1977 .
[7] Madabhushi Raghavachari,et al. A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions , 1993, Comput. Oper. Res..
[8] Yih-Long Chang,et al. Minimizing Mean Squared Deviation of Completion Times About a Common Due Date , 1987 .
[9] Wieslaw Kubiak,et al. Completion time variance minimization on a single machine is difficult , 1993, Oper. Res. Lett..
[10] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[11] Prabuddha De,et al. On the Minimization of Completion Time Variance with a Bicriteria Extension , 1992, Oper. Res..
[12] Alan G. Merten,et al. Variance Minimization in Single Machine Sequencing Problems , 1972 .
[13] Prabuddha De,et al. Scheduling about a common due date with earliness and tardiness penalties , 1990, Comput. Oper. Res..
[14] Yash P. Gupta,et al. Minimizing flow time variance in a single machine system using genetic algorithms , 1993 .