论文信息 - Single machine scheduling with coefficient of variation minimization

Single machine scheduling with coefficient of variation minimization

Abstract The problem of scheduling n jobs on a single machine so as to minimize the coefficient of variation of the job completion times is considered in this paper. Some results on the characterization of an optimal schedule including its V-shape are proved. Explicit optimal schedules for some small values of n are also given. A heuristic method for solving the problem is proposed and its efficiency is investigated.

M. Raghavachari | M. Zammouri

[1] John J. Kanet,et al. Minimizing Variation of Flow Time in Single Machine Systems , 1981 .

[2] M. Raghavachari,et al. Deterministic and Random Single Machine Sequencing with Variance Minimization , 1987, Oper. Res..

[3] Yih-Long Chang,et al. MINIMIZING MEAN ABSOLUTE DEVIATION OF COMPLETION TIMES ABOUT A COMMON DUE DATE. , 1986 .

[4] Alan G. Merten,et al. Variance Minimization in Single Machine Sequencing Problems , 1972 .

[5] M. Raghavachari. A V-shape property of optimal schedule of jobs about a common due date , 1986 .

[6] C. R. Bector,et al. Minimizing the Flow-time Variance in Single-machine Systems , 1990 .

[7] Samuel Eilon,et al. Minimising Waiting Time Variance in the Single Machine Problem , 1977 .

[8] C. R. Bector,et al. V-shape property of optimal sequence of jobs about a common due date on a single machine , 1989, Comput. Oper. Res..

[9] 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 .

[10] L. Schrage. Minimizing the Time-in-System Variance for a Finite Jobset , 1975 .

[11] Prabuddha De,et al. On the Minimization of Completion Time Variance with a Bicriteria Extension , 1992, Oper. Res..