论文信息 - Minimizing the Flow-time Variance in Single-machine Systems

Minimizing the Flow-time Variance in Single-machine Systems

In this paper we deal with an n-job, single-machine scheduling problem. All jobs are available from the start, and the objective is to minimize the variance of job flow-times. A heuristic procedure which is based on the complementary pair-exchange principle is proposed. It has been concluded that this heuristic procedure provides improved results (in terms of objective-function value) when compared with other heuristics. Our heuristic procedure has the complexity of O(n log n).

C. R. Bector | Yash P. Gupta | Mahesh Gupta | M. C. Gupta | Y. P. Gupta

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

[2] J. J. Kanet. Minimizing the average deviation of job completion times about a common due date , 1981 .

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

[4] Yih-Long Chang,et al. Minimizing Mean Squared Deviation of Completion Times About a Common Due Date , 1987 .

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

[6] C. R. Bector,et al. Determination of an optimal common due date and optimal sequence in a single machine job shop , 1988 .

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

[8] Gary D. Scudder,et al. Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..

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