Heuristic Algorithms for Multistage Flowshop Scheduling Problem

References

• Baskshi , M. K. , and Arora , S. R. , “ The Sequencing Problem ,” Management Science , 16 , B247 – B263 , ( 1969 ).
   Google Scholar
• Brown , A. P. G. , and Lomnicki , Z. A. , “ Some Applications of the ‘Branch and Bound’ Algorithm to the Machine Scheduling Problem ,” Operational Research Quarterly , 17 , 173 – 186 , ( 1966 ).
   Google Scholar
• Campbell , H. G. , Dudek , R. A. , and Smith , M. L. , “ A Heuristic Algorithm for the n Job, m Machine Sequencing Problem ,” Management Science 16 , B630 – B637 , ( 1970 ).
   Web of Science ®Google Scholar
• Conway , R. W. , Maxwell , W. L. , and Miller , L. W. , Theory of Scheduling , Addison Wesley , Reading , Massachusetts , ( 1967 ) .
   Google Scholar
• Dudek , R. A. , and Teuton , O. F. , Jr. , “ Development of M-State Decision Rule for Scheduling n Jobs through M-Machines ,” Operational Research , 12 , 471 – 497 , ( 1964 ).
   Web of Science ®Google Scholar
• Gupta , J. N.D. , “ Heuristic Rules for n × M Flowshop Scheduling Problem ,” Opsearch (India) 5 , 165 – 170 , ( 1968 ).
   Google Scholar
• Gupta , J. N. D. , “ A General Algorithm for the n × M Flowshop Scheduling Problem ,” The International Journal of Production Research , 7 , 241 – 247 , ( 1969 ).
   Google Scholar
• Gupta , J. N.D. , “ M-Stage Flowshop Scheduling by Branch and Bound ,” Opsearch (India) 7 , 37 – 43 , ( 1970 ).
   Google Scholar
• Gupta , J. N.D. , “ Economic Aspects of Production Scheduling Systems ,” Journal of Operations Research Society of Japan , 13 , 169 – 193 , ( 1971 ).
   Web of Science ®Google Scholar
• Gupta , J. N.D. , “ M-Stage Scheduling Problem–A Critical Appraisal ,” The International Journal of Production Research , 9 , 267 – 281 , ( 1971 ).
   Google Scholar
• Gupta , J. N.D. , “ An Improved Combinatorial Algorithm for the Flowshop Scheduling Problem ,” Operations Research , 19 , 1753 – 1758 , ( 1971 ).
   Google Scholar
• Gupta , J. N. D. , and Dudek , R. A. , “ Optimality Criteria for Flowshop Schedules ,” AIIE Transactions , 3 , 199 – 205 , ( 1971 ).
   Google Scholar
• Ignall , E. , Scharge , L. , “ Application of the Branch and Bound Technique to Some Flowshop Scheduling Problems ,” Operations Research 13 , 400 – 412 , ( 1965 ).
   Web of Science ®Google Scholar
• Johnson , S. M. , “ Optimal Two-and Three-Stage Production Schedules with Set-Up Times Included ,” Naval Research Logistics Quarterly 1 , 61 – 68 , ( 1954 ).
   Google Scholar
• Page , E. S. , “ An Approach to the Scheduling of Jobs on Machines ,” Journal of Royal Statistical Society , 23 , Series B, 484 – 492 , ( 1961 ).
   Google Scholar
• Palmer , D. S. , “ Sequencing Jobs through a Multistage Process in the Minimum Total Time–A Quick Method of Obtaining a Near Optimum ,” Operations Research Quarterly 16 , 101 – 107 , ( 1965 ).
   Google Scholar
• Sisson , R. L. , “ Sequencing Theory ,” Chapter 7 in Progress in Operations Research , Ackoff R. L. (ed.) 1 , John Wiley and Sons Inc. , New York , 295–325, ( 1961 ) .
   Google Scholar
• Smith , M. L. , “ A Critical Analysis of Flowshop Scheduling ,” Ph D Dissertation , Texas Tech University , Lubbock , Texas , ( 1968 ) .
   Google Scholar
• Smith , R. D. , and Dudek , R. A. , “ A General Algorithm for the Solution of the n-Job, m-Machine Sequencing Problem of the Flowshop ,” Operations Research 15 , 71 – 82 , (also see “ERRATA” Operations Research 17, 756, ( 1969 ).
   Google Scholar