Scheduling in a Semi-Ordered Flow-shop Without Intermediate Queues

References

• Aroia , R. K. and Rana , S. P. , ‘ On Finding Minimum Make-span Sequence in an Ordered Flow-shop Sequencing Problem ,’ (Communicated for publication).
   Google Scholar
• Baker , K. R. , Introduction to Sequencing and Scheduling , John Wiley and Sons, Inc. , New York ( 1974 ) .
   Google Scholar
• Coffman , E. G. , Jr. , Ed. , Computer and Job-shop Scheduling Theory , John Wiley and Sons, Inc. , New York ( 1976 ) .
   Google Scholar
• Gupta , J. N.D. , “ Optimal Flow-shop Schedules with No Intermediate Storage Space ,” Nav. Res. Log. Quart. , 23 , 235 – 243 ( 1976 ).
   Google Scholar
• Panwalkar , S. S. , Dudek , R. and Smith , M. , “ Sequencing Research and the Industrial Scheduling Problem ,” Lectur Notes in Economics and Mathematical Systems, 86, ‘ Symposium on the Theory of Scheduling and its applications ,’ 29 – 39 , Springer-Verlag , New York ( 1973 ) .
   Google Scholar
• Panwalkar , S. S. and Woolam , C. R. , ‘ Ordered flow-shop sequencing problem with no intermediate storage ,”
   Google Scholar
• Reddi , S. S. and Ramamoorthy , C. V. , ‘ On the flow-shop sequencing problem with no wait in process ,’ Opl Res. O. 23 , 323 – 331 ( 1972 ).
   Google Scholar
• Szwarc , W. , ‘ Permutation Flow-shop Theory Revisited ,’ Nav. Res. Log. Quart.
   Google Scholar
• Wismer , D. A. , “ Solution of the Flow-Shop Scheduling Problem with No Intermediate Queues ,” Operations Research , 20 , 687 – 697 , No. 3 ( May 1972 ).
   Google Scholar