M-stage scheduling problem—a critical appraisal

References

• ASHOUR , S. , 1970 , A branch-and-bound algorithm for flow shop scheduling problems , AIIE Trans. , 2 , 172 .
   Google Scholar
• ASHOUR , S. , and QURAISHI , N. , 1989 , Investigation of various bounding procedures for production scheduling problems , Int. J. Prod. Res. , 7 , 249 .
   Google Scholar
• BAKSHI , M. K. , and ARORA , S. R. , 1969 , The machine sequencing problem , Mgmt Sci. , 16 , B274 .
   Google Scholar
• BALAS , E. , 1967 , Discrete programming by filter method , Ops Res. , 15 , 915 ; 1969, Machine sequencing via disjunctive graphs an implicit enumeration algorithm, Ops Res., 17, 941 .
   Web of Science ®Google Scholar
• BEENHAKKER , H. L. , 1963 , The development of alternate criteria for optimality in the machine sequencing problem , Ph.D. Dissertation , Purdue University .
   Google Scholar
• BOWMAN , E. H. , 1959 , Schedule-sequencing problems , Ops Res. , 7 , 621 .
   Web of Science ®Google Scholar
• BROOKS , G. H. , and WHITE , C. R. , 1965 , An algorithm for finding optimal or near optimal solutions to the industrial scheduling problem , J. indust, Engng , 16 , 34 .
   Web of Science ®Google Scholar
• BROWN , A. P. G. , and LOMNICKI , Z. A. , 1966 , Some applications of the ‘ branch and bound ’ algorithm to machine scheduling problem , Opt Res. Q. , 17 , 173 .
   Google Scholar
• CHARLTON , J. M. , and DEATH , C. C. , 1969 , A general method for machining scheduling , Int. J. Prod. Res. , 7 , 207 ; 1970, A method of solution for general scheduling problems, Ops Res., 18, 689 .
   Google Scholar
• CONWAY , R. , MAXWELL , W. L. ,MILLER, L, W., 1967 , Theory of scheduling ( Reading , Mass. Addison-Wesley ).
   Google Scholar
• DUDEK , R. A. , and TEUTON , O. F. , 1964 , Development of M-stage decision rule for scheduling n jobs through M-machines , Ops Res. , 12 , 471 .
   Web of Science ®Google Scholar
• ELMAGHRABY , S. E. , 1968 , The machine sequencing problem—review and extensions , Nav. Res. Logist. Q. , 15 , 205 .
   Google Scholar
• FLORTAN , F. , TREPANT , P. , and MCMAHON , G. , 1970 , An implicit enumeration algorithm for the machine sequencing problem , Publication No. 8 , Department of Information , University of Montreal , Montreal , Canada .
   Google Scholar
• GREENBERG , H. H. , 1968 , A branch and bound solution to the general scheduling problem , Ops Res. , 16 , 353 .
   Web of Science ®Google Scholar
• GUPTA , J. N. D. , 1967 , Combinatorial search algorithms for scheduling problems , M.S. Thesis, Department of Mechanical Engineering , Indian Institute of Technology , Kharagpur , India ; 1969 a, A general algorithm for the n×M flowshop scheduling problem, Int. J. Prod. Res., 7, 241 ; 1969 b, Economic aspects of scheduling theory, Ph.D. Dissertation, Texas Tech University, Lubbock, Texas ; 1969 c, On the n-job, M-machine flowshop scheduling problem, Working Paper, Division of Engineering, The University of Alabama in Huntsville, Huntsville, Ala. ; 1969 d, Optimal scheduling in a multi-stage flowshop, Working Paper, Division of Engineering, The University of Alabama in Huntsville, Huntsville, Ala. ; 1970, M-stage flowshop scheduling by branch and bound, Opsearch (India), 7, 37 .
   Google Scholar
• IONALL , B. , and SCHRAGE , L. , 1965 , Application of the ‘ branch and bound ’ technique to some flowshop scheduling problems , Ops Res. , 13 , 400 .
   Google Scholar
• JOHNSON , S. M. , 1954 , Optimal two and three stage production schedules with set-up times included , Nav. Res. Logist. Q. , 1 , 61 .
   Google Scholar
• LITTLE , J. D. C. , MURTHY , K. G. , SWEENEY , D. W. , and KAREL , C. , 1963 , An algorithm for the traveling salesman problem , Ops. Res. , 11 , 972 .
   Web of Science ®Google Scholar
• MCMAHON , G. B. , 1969 , Optimal production schedules for flow shops , Can. Opl Res. Soc.J. , 7 , 141 .
   Google Scholar
• MCMAHON , G. B. , and BURTON , P. G. , 1967 , Flowshop scheduling with the ‘ branch and bound ’ , Ops Res. , 15 , 473 .
   Web of Science ®Google Scholar
• MANNE , A. S. , 1960 , On the job-shop scheduling problem , Ops Res. , 8 , 219 .
   Web of Science ®Google Scholar
• MITTEN , L. G. , 1959a , Sequencing n jobs on two machines with arbitrary time lags , Mgmt Sci. , 5 , 293 ; 1959 b, A scheduling problem, J. indust. Engng, 10, 131 .
   Web of Science ®Google Scholar
• MUTH , J. , and THOMPSON , G. L. , 1963 , Industrial Scheduling ( Englewood Cliffs , New Jersey Prentice-Hall, Inc. ).
   Google Scholar
• NABESHIMA , I. , 1961 , The order of n items processed on m machines , J. Ops Res. Soc. Japan , 3 , 170 ; 1967a, On the bounds of make-spans and its application in M-machine scheduling problem, J. Ops. Res. Soc. Japan, 9, 98 ; 1967 b. Some extensions of the M-machine scheduling problem, J. Ops. Res. Soc. Japan, 10, 1 .
   Google Scholar
• PANDIT , S. N. N. , 1962 , The loading problem , Ops Res. , 12 , 639 ; 1963. Some Quantitative combinatorial search problems, Ph.D. Thesis, Indian Institute of Technology, Kharagpur, India .
   Google Scholar
• POUNDS , W. P. , 1963 , The scheduling environment, Chapter 1 in Muth and Thompson (1963) .
   Google Scholar
• SCHRAGE , L. , 1970, Solving resource constrained network problems by implicit enumeration—nonpreemptive case , Ops Res. , 18 , 263 .
   Google Scholar
• SMITH , M. L. , 1968 , A critical analysis of flowshop sequencing , Ph.D. Dissertation, Department of Industrial Engineering , Texas Technological College , Lubbock , Texas .
   Google Scholar
• SMITH , W. E. , 1956 , Various optimizers for single-stage production , Nav. Res. Logist. Q. , 3 , 59 .
   Google Scholar
• SMITH , R. D. , and DUDEK , R. A. , 1967 , A general algorithm for solution of the n-job , M-machine sequencing problems of the flowshop , Ops Res. , 15 , 71 .
   Web of Science ®Google Scholar
• SPENCER , D. L. , 1969 , An investigation of the relationships between sequencing and scheduling problems , Ph.D. Dissertation, Department of Industrial Engineering , Texas Technological College , Lubbock , Texas .
   Google Scholar
• STORY , A. E. , and WAGNER , H. M. , 1963 , Computational experience with integer programming for job-shop scheduling , Chapter 14 in Muth and Thompson (1963) .
   Google Scholar
• VON LANZENAUR , C. H. , and HIMES , R. C. , 1970 , A linear programming solution to the general sequencing problem , Can. Opl Res. Soc, J. , 8 , 129 .
   Google Scholar
• WAGNER , H. M. , 1959 , An integer linear programming model for machine scheduling , Nav. Res. Logist. Q. , 6 , 131 .
   Google Scholar