MINIMIZING MAXIMUM COMPLETION TIME IN A TWO-BATCH-PROCESSING-MACHINE FLOWSHOP WITH DYNAMIC ARRIVALS ALLOWED

References

• Ahmadi , J. H. , Ahmadi , R. H. , Dasu , S. and Tang , C. S. ( 1992 ). Batching and scheduling jobs on batch and discrete processors . Operations Research , 39 , 750 – 763 .
   Web of Science ®Google Scholar
• Chandru , V. , Lee , C. Y. and Uzsoy , R. ( 1993 ). Minimizing total completion time on a batch processing machine with job families . Operations Research Letters , 13 , 61 – 65 .
   Web of Science ®Google Scholar
• Chandru , V. , Lee , C. Y. and Uzsoy , R. ( 1993 ). Minimizing total completion time on batch processing machines . International Journal of Production Research , 31 , 2097 – 2121 .
   Web of Science ®Google Scholar
• Dobson , G. , Karmarkar , U. S. and Rummel , J. L. ( 1987 ). Batching to minimize flow times on one machine . Management science , 33 , 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 , 607 – 613 .
   Web of Science ®Google Scholar
• Glassey , C. R. and Weng , W. W. ( 1991 |). Dynamic batching heuristic for simultaneous processing . IEEE Transactions on Semiconductor Manufacturing , 4 , 77 – 82 .
   Web of Science ®Google Scholar
• Hochbaum , D. S. and Landy , D. ( 1994 ). Algorithms and heuristics for scheduling semiconductor burn-in operations . Technical Report , Engineering Systems Research Centre. University of California , Berkeley .
   Google Scholar
• Ikura , Y. and Gimple , M. ( 1986 ). Scheduling algorithms for a single batch processing machine . Operations Research letters , 5 , 764 – 775 .
   Google Scholar
• Lee , C. Y. , Uzsoy , R. and Martin-Vega , L.A. ( 1992 ). Efficient algorithms of scheduling semiconductor burn-in operations . Operations Research , 40 , 764 – 775 .
   Web of Science ®Google Scholar
• Santos , C. and Magazine , M. ( 1985 ). Batching in single operation manufacturing systems . Operations Research Letters , 4 , 99 – 013 .
   Web of Science ®Google Scholar
• Slomson , A. ( 1991 ), An introduction la combinatorics . Chapman and Hall , London .
   Google Scholar
• Sung , C. S. and Joo , U. G. ( 1997 ). Batching to minimize weighted mean flow time on a single machine with batch size restrictions . Computers and I. E. ( to appear ).
   Google Scholar
• Uzsoy , R. ( 1994 ). Scheduling a single batch processing machine with non-identical job sizes . International Journal of Production Research , 32 , 1615 – 1635 .
   Web of Science ®Google Scholar
• Webster , S. and Baker , K. R. ( 1995 ). Scheduling groups of jobs on a single machine . Operations Research , 43 , 692 – 703 .
   Web of Science ®Google Scholar