An ordered flow-shop sequencing problem with mean completion time criterion†

References

• DUDEK , R. A. , and TEUTON , O. F. , JR. , 1964 , Development of M-stage decision rule for scheduling n jobs through m machines , Opns Res. , 12 , 471 .
   Web of Science ®Google Scholar
• GUPTA , J. N. D. , 1971 , An improved combinational algorithm for the flow-shop scheduling problem , Opns Res. , 19 , 1753 .
   Google Scholar
• IONALL , E. , and SCHBAGE , L. , 1965 , Application of the branch-and bound technique to some flow-shop scheduling problems , Opns Res. , 13 , 400 .
   Google Scholar
• JOHNSON , S. M. , 1954 , Optimal two-and-three-stage production schedules with setup times included , Nav. Res. Logist. Q. , 1 , 61 .
   Google Scholar
• KHAN , A. W. , 1974 , On sequencing ordered matrix flowshop problems , Ph.D. Dissertation , Texas Tech University , Lubbock , TX .
   Google Scholar
• MCMAHON , G. B. , and BURTON , P. G. , 1967 , Flow-shop scheduling with the branch-and bound method , Opns Res. , 15 , 473 .
   Web of Science ®Google Scholar
• SMITH , M. L. , PANWALKAR , S. S. , and DUDEK , R. A. , 1975 , Flow-shop sequencing problem with ordered processing time matrices , Mgmt Sci. , 21 , 544 .
   Web of Science ®Google Scholar
• SMITH , M. L. , PANWALKAR , S. S. , and DUDEK , R. A. , 1976 , Flow-shop sequencing problem with ordered processing time matrices A general case , Nav. Res. Logist. Q. , 22 , ( in the press ).
   Google Scholar
• SMITH , R. D. , and DUDEK , R. A. , 1967 , A general algorithm for solution of the w-job, m-machine sequencing problem of the flow shop , Opns Res. , 15 , 71 ; 1969, Errata, Ibid., 17, 756 .
   Web of Science ®Google Scholar
• SZWARC , W. , 1971 , Elimination methods in the mxn sequencing problem , Nav. Res. Logist. Q. , 18 , 295 ; 1973, optimal elimination methods in the mxn flow-shop scheduling problem, Opns Res., 21, 1250 .
   Google Scholar
• † Partial support for this research was provided by the National Science Foundation Grant GK-2869.
   Google Scholar