Restricted job completion time variance minimisation on identical parallel machines

European Journal of Industrial Engineering

Volumn 3, Issue 3, 2009, Pages 261-276

  Chen, Yuerong ^a   Li, Xueping ^a   Sawhney, Rapinder ^a  

^a University of Tennessee   (United States)

Author keywords

Completion time variance; CTV; Job scheduling; Production planning; Service stability

Indexed keywords

HEURISTIC ALGORITHMS; JUST IN TIME PRODUCTION; OPTIMIZATION; SCHEDULING;

COMPLETION TIME VARIANCE; COMPUTATIONALLY EFFICIENT; IDENTICAL PARALLEL MACHINES; JOB SCHEDULING; NUMERICAL RESULTS; PERFORMANCE MEASURE; PROBLEM INSTANCES; PRODUCTION PLANNING;

JOB SHOP SCHEDULING;

EID: 65649113961     PISSN: 17515254     EISSN: 17515262     Source Type: Journal    
DOI: 10.1504/EJIE.2009.025048     Document Type: Article

References (25)

1. Al-Turki, U., Fediki, C. and Andijani, A. (2001) 'Tabu search for a class of single-machine scheduling problems', Computers and Operations Research, Vol. 28, pp. 1223-1230.
2. Baker, K.R. and Scudder, G.D. (1990) 'Sequencing with earliness and tardiness penalties: A review', Operations Research, January-February, Vol. 38, No. 1, pp. 22-36.
3. Cai, X. and Cheng, T. (1998) 'Multi-machine scheduling with variance minimization', Discrete Applied Mathematics, Vol. 84, pp. 55-70.
4. Chen, B., Potts, C. and Woeginger, G. (1998) A Review of Machine Scheduling: Complexity, Algorithms, and Approximation, Dordrecht: Kluwer.
5. Cheng, T. and Sin, C. (1990) 'A state-of-the-art review of parallel-machine scheduling research', European Journal of Operational Research, Vol. 47, pp. 271-292.
6. De, P., Ghosh, J.B. and Wells, C.E. (1992) 'On the minimization of completion time variance with a bicriteriaextension', Operations Research, November-December, Vol. 40, No. 6, pp. 1148-1155.
7. Eilon, S. and Chowdhury, I.G. (1977) 'Minimizing waiting time variance in the single machine problem', Management Science, February, Vol. 23, No. 6, pp. 567-575.
8. Gajpal, Y. and Rajendran, C. (2006) 'An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops', Int. J. Production Economics, Vol. 101, pp. 259-272.
9. Graham, R.L., Lawler, E.L., Lenstra, J.K. and Kan, A.H.R. (1979) 'Optimization and approximation in deterministic sequencing and scheduling: A survey', Annals of Discrete Mathematics, Vol. 5, pp. 287-326.
10. Gupta, M.C., Gupta, Y.P. and Bector, C.R. (1990) 'Minimizing the flow-time variance in single-machine systems', Journal of the Operational Research Society, Vol. 41, pp. 767-779.
11. Gupta, M.C., Gupta, Y.P. and Kumar, A. (1993) 'Minimizing flow time variance in a single machine system using geneticalgorithm', European Journal of Operational Research, Vol. 70, pp. 289-303.
12. Hall, N.G. and Kubiak, W. (1991) 'Proof of a conjecture of schrage about the completion time variance problem', Operations Research Letters Vol. 10, pp. 467-472.
13. Kanet, J.J. (1981) 'Minimizing variation of flow time in single machine systems', Management Science, Vol. 27, pp. 1453-1459.
14. Kubiak, W. (1993) 'Completion time variance on a single machine is difficult', Operations Research Letter, Vol. 12, pp. 49-59.
15. Kubiak, W., Cheng, J. and Kovalyov, M.Y. (2002) 'Fast fully polynomial approximation schemes for minimizing completion time variance', European Journal of Operational Research, Vol. 137, pp. 303-309.
16. Li, X., Chen, Y., Sun, Y. and Sawhney, R. (2007) 'On the minimization of job completion time variance on identical parallel machines', OMEGA in review.
17. Manna, D.K. and Prasad, V.R. (1997) 'Pseudopolynomial algorithms for CTV minimization in single machine scheduling', Computers and Operations Research, Vol. 24, No. 12, pp. 1119-1128.
18. Manna, D.K. and Prasad, V.R. (1999) 'Bounds for the position of the smallest job in completion time variance minimization', European Journal of Operational Research, Vol. 114, No. 2, pp. 411-419.
19. Merten, A. and Muller, M. (1972) 'Variance minimization in single machine sequencing problems', Management Science, May, Vol. 18, No. 9, pp. 518-528.
20. Mittenthal, J., Raghavachari, M. and Rana, A. (1993) 'A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions', Computers and Operations Research, Vol. 20, No. 2, pp. 103-111.
21. Schrage, L. (1975) 'Minimizing the time-in-system variance for a finite jobset', Management Science, January, Vol. 21, No. 5, pp. 540-543.
22. Vani, V. and Raghavachari, M. (1987) 'Deterministic and random single machine sequencing with variance minimization', Operations Research January-February, Vol. 35, No. 1, pp. 111-120.
23. Viswanathkumar, G. and Srinivasan, G. (2003) 'A branch and bound algorithm to minimize completion time variance on a single processor', Computers and Operations Research, Vol. 30, No. 8, pp. 1135-1150.
24. Xu, X. and Ye, N. (2007) 'Minimization of job waiting time variance on identical parallel machines', IEEE Transactions on Systems, Man, and Cyberntics, Part C, Vol. 37, No. 5, pp. 917-927.
25. Ye, N., Li, X., Farley, T. and Xu, X. (2007) 'Job scheduling methods for reducing waiting time variance', Computers and Operations Research Vol. 34, pp. 3069-3083.