Hierarchical minimization of completion time variance and makespan in jobshops

Computers and Operations Research

Volumn 33, Issue 5, 2006, Pages 1345-1367

  Ganesan, Viswanath Kumar ^a   Sivakumar, Appa Iyer ^b   Srinivasan, G ^c  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^c INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

Backward scheduling; Completion time variance; Jobshop; Makespan

Indexed keywords

COMPUTER SIMULATION; HEURISTIC METHODS; PROBLEM SOLVING; SCHEDULING;

BACKWARD SCHEDULING; COMPLETION TIME VARIANCE; JOBSHOP; MAKESPAN;

JOB ANALYSIS;

EID: 26444441957     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2004.09.019     Document Type: Article

References (37)

1. G. Mosheiov Simultaneous minimization of total completion time and total deviation of job completion times European Journal of Operational Research 157 2004 296 306
2. A. Federgruen, and G. Mosheiov Simultaneous optimization of efficiency and performance balance measure in single machine scheduling problems Naval Research Logistics 40 1993 951 970
3. J.J. Kanet Minimizing variance of flow time in single machine systems Management Science 27 1981 1453 1459
4. V. Vani, and M. Raghavachari Deterministic and random single machine sequencing with variance minimization Operations Research 35 1987 111 120
5. U. Bagchi, Y.L. Chang, and R.S. Sullivan Minimizing absolute and squared deviation of completion times with different earliness and tardiness penalties and a common due date Naval Research Logistics 34 1987 739 751
6. M.C. Gupta, Y.P. Gupta, and C.R. Bector Minimizing the flow time variance in single machine systems Journal of Operational Research Society 41 1990 767 779
7. J. Mittenthal, M. Raghavachari, and A.I. Rana A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions Computers & Operations Research 20 1993 103 111
8. M.C. Gupta, Y.P. Gupta, and A. Kumar Minimizing the flow time variance in single machine systems using genetic algorithms European Journal of Operational Research 70 1993 289 303
9. J. Ventura, and M.X. Weng Minimizing single machine completion time variance Management Science 41 1995 1448 1455
10. D.K. Manna, and V.R. Prasad Bounds for the position of the smallest job in completion time variance minimization European Journal of Operational Research 114 1999 411 419
11. G. Viswanathkumar, and G. Srinivasan A branch and bound algorithm to minimize completion time variance on a single processor Computers & Operations Research 30 2003 1135 1150
12. W. Kubiak Completion time variance minimization on a single machine is difficult Operations Research Letters 14 1993 49 59
13. C.A. Marangos, V. Govande, G. Srinivasan, and E.W. Zimmers Algorithms to minimize completion time variance in a two machine flow shop Computers and Industrial Engineering 35 1998 101 104
14. K. Gowrishankar, Chandrasekaran Rajendran, and G. Srinivasan Flowshop algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due-date European Journal of Operational Research 132 2001 643 665
15. A.S. Jain, and S. Meeran Deterministic job-shop scheduling past, present and future European Journal of Operational Research 113 1999 390 434
16. U. Bagchi Simultaneous minimization of mean and variation of flow time and waiting time in single machine systems Operations Research 37 1989 118 125
17. P. De, J.B. Ghosh, and C.E. Wells On the minimization of completion time variance with a bicriteria extension Operations Research 40 1992 1148 1155
18. A. Federgruen, and G. Mosheiov Heuristics for multi-machine scheduling problems with earliness and tardiness costs Management Science 42 1996 1544 1555
19. C. Stein, and J. Wein On the existence of schedules that are near-optimal for both makespan and total weighted completion time Operations Research Letters 21 1997 115 122
20. P.C. Chang, J.C. Hsieh, and S.G. Lin The development of gradual-priority weighting approach for the multi-objective flowshop scheduling problem International Journal of Production Economics 79 2002 171 183
21. S. Eilon, and I.C. Chowdhury Minimizing the waiting time variance in the single machine problem Management Science 23 1977 567 575
22. Lawrence S. Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (supplement). Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, 1984.
23. Y. Kim A backward approach in list scheduling algorithms for multi-machine tardiness problems Computers and Operations Research 31 1994 307 319
24. D.C. Bushee, and J.A. Svestka A bi-directional scheduling approach for jobshops International Journal of Production Research 37 2001 3823 3837
25. A. Brown, and Z. Lominicki Some applications of the branch and bound algorithm to the machine-scheduling problem Operational Research Quarterly 17 1966 173 186
26. G.B. McMahon, and P.G. Burton Flow shop scheduling with the branch and bound method Operations Research 15 1967 473 481
27. N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller Equations of state calculations by computing machines Journal Chemical Physics 21 1953 1087 1092
28. P.J.M. van LaarHoven, A.H.L. Emile, and J.K. Lenstra Job shop scheduling using simulated annealing Operations Research 40 1992 113 126
29. M. Pirlot General local search methods European Journal of Operational Research 92 1996 493 511
30. R.W. Eglese Simulated annealing a tool for operational research European Journal of Operational Research 46 1990 271 281
31. E. Taillard Some efficient heuristic methods for the flow shop sequencing problem European Journal of Operational Research 47 1990 65 74
32. Gen M, Chen R. Genetic algorithms and engineering optimization. Wiley Series in Engineering design and automation, 2000.
33. Fisher H, Thompson GL. Probabilistic learning combination of local job shop scheduling rules. Industrial Scheduling 1963;225-51.
34. R.H. Storer, S.D. Wu, and R. Vaccari New search spaces for sequencing problems with application to job shop scheduling Management Science 38 1992 1495 1509
35. D. Applegate, and W. Cook A computational study of jobshop problem ORSA Journal of Computing 3 1991 149 156
36. Yamada T, Nakano R. A genetic algorithm applicable to large scale job shop problems. Parallel problem solving from Nature 2, Manner and Manderick (ed.), Elsevier, Amsterdam: 1992. p. 281-90.
37. J. Adams, E. Balas, and D. Zawack The shifting bottleneck procedure for jobshop scheduling Management Science 34 1988 391 401