Lot splitting to minimize average flow-time in a two-machine flow-shop

References

• Baker , K. R. ( 1974 ) Introduction to Sequencing and Scheduling , Wiley, New York . NY .
   Google Scholar
• Baker , K. R. and Jia , D. ( 1993 ) A comparative study of lot streaming procedures. OMEGA International Journal of Management Science , 21 ( 5 ), 561 – 566 .
   Web of Science ®Google Scholar
• Chen , J. and Steiner , G. ( 1996 ) Lot streaming with detached setups in three-machine flow shops. European Journal of Operational Research , 26 , 591 – 611 .
   Google Scholar
• Chen , J. and Steiner , G. ( 1998 ) Lot streaming with attached setups in three-machine flow shops. IIE Transactions , 30 , 1075 – 1084 .
   Web of Science ®Google Scholar
• Cheng , T. C. E. , Chen , Z. L. , Kovalyov , M. Y. and Lin , B. M. T. ( 1996 ) Parallel-machine batching and scheduling to minimize total completion time. IIE Transactions , 28 , 953 – 956 .
   Web of Science ®Google Scholar
• Cheng , T. C. E. , Lin , B. M. T. and Toker , A. ( 2000 ) Makespan minimization in the two-machine flowshop batch scheduling problem. Naval Research Logistics , 47 , 128 – 144 .
   Web of Science ®Google Scholar
• Conway , R. W. , Maxwell , W. L. and Miller , L. W. ( 1967 ) Theary of Scheduling , Addison-Wesley, Reading, MA.
   Google Scholar
• Dobson , G. , Karmarkar , U. and Rummel , J. ( 1987 ) Batching to minimize flow times on one machine. Management Science , 33 ( 6 ), 784 – 799 .
   Web of Science ®Google Scholar
• Dobson , G. , Karmarkar , U. S. and Rummel , J. L. ( 1989 ) Batching to minimize flow times on parallel heterogeneous machines. Management Science , 35 ( 5 ). 607 – 613 .
   Web of Science ®Google Scholar
• Fourer , R. , Gay , D. M. and Kernighan , B. W. ( 1993 ) AMPL: A Modeling Language for Mathematical Programming , Boyd and Fraser, Danvers , MA .
   Google Scholar
• Kalir , A. A. and Sarin , S. C. ( 2001 ) Optimal solutions for the single batch flow-shop lot streaming problem with equal sublots. Decision Sciences , 32 ( 2 ), 387 – 397 .
   Web of Science ®Google Scholar
• Kropp , D. H. and Smunt , T. L. ( 1990 ) Optimal and heuristic models for lot-splitting in a flow-shop. Decision Sciences , 21 ( 4 ), 691 – 709 .
   Web of Science ®Google Scholar
• Naddef , D. and Santos , C. ( 1988 ) One-pass batching algorithm for the one-machine problem. Discrete Applied Mathematics , 21 , 133 – 145 .
   Web of Science ®Google Scholar
• Pinedo , M. ( 1995 ) Scheduling: Theory, Algorithms and Systems , Prentice-Hall, Englewood Cliffs , NJ .
   Google Scholar
• Potts , C. N. and Kovalyov , M. Y. ( 2000 ) Scheduling with batching: a review. European Journal of Operational Research , 120 , 228 – 249 .
   Web of Science ®Google Scholar
• Santos , C. and Magazine , M. ( 1985 ) Batching in single operation manufacturing systems. Operations Research Letters , 4 ( 3 ), 99 – 103 .
   Web of Science ®Google Scholar
• Sen , A. , Topaloglu , E. and Benli , o. S. ( 1998 ) Optimal streaming of a single job in a two-stage flow shop. European Journal of Operational Research , 110 , 42 – 62 .
   Web of Science ®Google Scholar
• Shallcross , D. F. ( 1992 ) A polynomial algorithm for a one machine batching problem. Operations Research Letters , 11 , 213 – 218 .
   Web of Science ®Google Scholar
• Trietsch , D. and Baker , K. R. ( 1993 ) Basic techniques for lot streaming. Operations Research , 41 ( 6 ), 1065 – 1076 .
   Web of Science ®Google Scholar
• Truscott , W. G. ( 1985 ) Scheduling production activities in multi-stage manufacturing systems. International Journal of Production Research , 23 ( 2 ). 315 – 328 .
   Web of Science ®Google Scholar
• Truscott , W. G. ( 1986 ) Production scheduling with capacity constrained transportation activities. Journal of Operations Management , 6 ( 3 ), 1986, 333 – 348 .
   Google Scholar