An evaluation of flow-shop scheduling algorithms for makespan reduction in a stochastic environment

References

• ASHOUR , S. , 1967 , A decomposition approach for the machine scheduling problem. International Journal of Production Research , 6 , 109 – 122 .
   Google Scholar
• BAKSHI , S. M. , and AURORA , S. R. , 1969 , The sequencing problem. Management Science , 16 , B 247 – 263 .
   Web of Science ®Google Scholar
• BROWN , A. P. G. , and LOMNICKI , Z. A. , 1966 , Some applications of the branch and bound algorithm to the machine scheduling problem. Operational Research Quarterly , 17 , 173 – 186 .
   Google Scholar
• CAMPBELL , H. G. , DUDEK , R. A. , and SMITH , M. L. , 1970 , A heuristic algorithm for the N job M machine problem. Management Science , 16 , B 630 – 637 .
   Web of Science ®Google Scholar
• CAO , J. , and BEDWORTH , D. D. , 1992 , Flow shop scheduling in serial multi-product processes with transfer and set -up times. International Journal of Production Research , 30 , y 1819 – 1830 .
   Web of Science ®Google Scholar
• DANNENBRING , D. D. , 1977 , An evaluation of Oowshop sequencing heuristics. Management Science , 23 , 1174 – 1183 .
   Web of Science ®Google Scholar
• DUDEK , R. A. , and TEUTON , O. F. , 1964 , Development of M-stage decision rule for scheduling jobs through machines. Operations Research , 12 , 471 – 497 .
   Web of Science ®Google Scholar
• ELVERS , D. A. , and TAUBE , L. R. 1983 , Time completion for various dispatching rules in job shops. OMEGA , 11 , 81 – 89 .
   Web of Science ®Google Scholar
• FRENCH , S. , 1982 , Sequencing and Scheduling: An Introduction to the Mathematics of the Job Shop ( Ellis Horwood., Chichester , England ).
   Google Scholar
• GARY , M. , and JOHNSON , D. , 1979 , Computers and Intractability: a Guide to the Theory of NP-Completeness ( W. H. Freeman, New York ).
   Google Scholar
• GIGLIO , R. H. , and WAGNER , H. M. , 1964 , Approximate solutions to the three machine scheduling problem. Operations Research , 12 , 305 – 324 .
   Web of Science ®Google Scholar
• GUPTA , J. N. D. , 1971 , A functional heuristic algorithm for the Oowshop scheduling problem. Operational Research Quartary , 22 , 39 – 47 .
   Google Scholar
• GUPTA , J. N. D. , 1972 , Heuristic algorithms for multistage flowshop scheduling problem. AIlE Transaction s , 4 11 – 18 .
   Google Scholar
• GUPTA , J. N. D. , and DUDEK , R. A. , 1971 , Optimality criteria for flowshop schedules. AIlE Transactions , 3 , 199 – 205 .
   Google Scholar
• Ho , J. C. , and CHANG , Y. L. , 1991 , A new heuristic for the n-Job, m-machine Dow-shop problem. European Joumal of Operational Research , 52 , 194 – 202 .
   Web of Science ®Google Scholar
• HUNDAL , T. S. , and RAjGOPAL , J. , 1988 , An extension of Palmer's heuristic for the Oow shop scheduling problem. International Journal of Production Research , 26 , 1119 – 1124 .
   Web of Science ®Google Scholar
• JOHNSON , S. M. , 1954 , Optimal two and three stage production schedules with setup times included. Naval Research Logistics Quarterly , 1 , 61 – 68 .
   Google Scholar
• MANNE , A. S. , 1960 , On the job shop scheduling problem. Operations Research , 8 , 219 – 223 .
   Web of Science ®Google Scholar
• MATSUURA , H. , TSUBONE , H. , and KANEZASHI , M. , 1993 , Sequencing, dispatching, and switching in a dynamic manufacturing environment. International Joumal of Production Research , 31 , 1671 – 1688 .
   Web of Science ®Google Scholar
• MONTGOMERY , D. C , 1991 , Design of Experiments ( Wiley, : New York ).
   Google Scholar
• NAWAZ , M. , ENSCORE , E. M. , and HAM , L. , 1983 , A heuristic algorithm for the m-machine, s-job flow-shop sequencing problem. OMEGA , 11 , 91 – 95 .
   Web of Science ®Google Scholar
• PALMER , D. S. , 1965 , Sequencing jobs through a multi-stage process in the minimum total time—A quick method of obtaining a near optimum. Operations Research Quarterly , 16 101 – 107 .
   Google Scholar
• PINEDO , M. , 1982 , Minimizing the expected makespan In stochastic flowshops. Operations Research , 30 , 148 – 162 .
   Web of Science ®Google Scholar
• RAJAGOPALAN , D. , and KARIMI , I. A. , 1987 , Scheduling in serial mixed-storage mult iproduct processes with transfer and set-up times. In G. V. Reklaitis and H. D. Spriggs (eds), Foundations of Computer Aided Process Operations ( Elsevier Science Publishers, New York ), p. 679 .
   Google Scholar
• RAJENDRAN , C. , 1993 , Heuristic algorithm for scheduling in a tlowshop to minimize total flow time. International Journal of Production Economics , 29 , 65 – 73 .
   Web of Science ®Google Scholar
• RAMASESH , R. , 1990 , Dynamic job shop scheduling: a survey of simulation research. OMEGA , 18 , 43 – 57 .
   Web of Science ®Google Scholar
• SMITH , R. D. , and DUDEK , R. A. , 1967 , A general algorithm for the solution of the n-job m-machine sequencing problem of the flowshop. Operations Research , 15 , 77 – 82 .
   Web of Science ®Google Scholar
• TAHA , H. A. , 1990 , Simulation with SIMNET II ( Simtec, Inc., : Fayetteville , AR ).
   Google Scholar
• YAMAMOTO , M. , and NOF , S. Y. , 1985 , Scheduling rescheduling in the manufacturing operating system environment. International foumal of Production Research , 23 , 705 – 722 .
   Web of Science ®Google Scholar