On 3xn sequencing problem involving equivalent-job for a job-block with transportation-times of jobs

References

• Maggu , P.L. and Das , G. 1977 . Equivalent jobs for job-blocks in job sequencing . OPSEARCH , 14 ( 4 ) : 277 – 281 .
   Google Scholar
• Das , Ghanshiam . 1978 . Equivalent jobs for job-blocks for 'n-job, 3-machine' sequencing problem . Pure Appl. Math. Sci. VIII , 1-2 ( 4 ) : 35 – 40 .
   Google Scholar
• Maggu , P.L. and Das , G. 1980 . On 2Xn Sequencing Problem with transportation times of jobs . Pure Appl. Math. Sci. XII , 1-2 ( 4 ) : 1 – 6 .
   Google Scholar
• Johnson , S.M. 1954 . Optimal two- and three-stage production Schedules, with set up times included . Naval Res. Log. Quart. I , 1-2 ( 4 )
   Google Scholar
• Burns , F. and Rooker , J. 1975 . A Special case of the 3xn flow-shop problem . Naval Res. Log. Quart , 22 ( 4 ) : 811 – 817 .
   Google Scholar
• Szwarc , W. 1974 . Mathematical Aspects of the 3 Xn job-shop sequencing problem . Naval, Res. Log. Quart , 21 ( 4 ) : 145 – 153 .
   Google Scholar
• Kurisu , T. 1976 . Two-machine Scheduling under required Precedence among jobs . J. O. R. Soc. of Japan , 19 ( 4 ) : 1 – 13 .
   Google Scholar
• Kurisu , T. 1977 . Three-machine Scheduling Problem with precendence constraints . J. O. R. Soc. of Japan , 20 ( 4 ) : 231 – 242 .
   Google Scholar
• Johnson , S.M. 1959 . “ Discussion Sequencing n-jobs on two machines with arbitrary time lags ” . In Managements Science 5-3
   Google Scholar
• Mitten , L.G. 1959 . “ Sequencing n-jobs on two machines with arbitrary time lags ” . In Management Science 5-3
   Google Scholar
• Jackson , J.R. 1956 . “ An extension of Johnson's results on job-lot scheduling ” . In Naval Log. Review Quart Vol. 3-3 ,
   Google Scholar
• Maggu , P.L. , Das , G. and Singh , M. 1980 . “ Three-Machine n-job flowshop problem with transportation times of jobs ” . In Management Science (communicated)
   Google Scholar