Scheduling a single batch processing machine with non-identical job sizes

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 , 40 , 750 – 763 .
   Web of Science ®Google Scholar
• BRUNO , J. , COFFMAN , E. C. , and SETHI , R. , 1974 , Scheduling independent tasks to reduce mean finishing time . Communications of the ACM , 17 , 382 – 387 .
   Web of Science ®Google Scholar
• CHANDRA , P. , and GUPTA , S. , 1992 , An analysis of a last-station-bottleneck semiconductor packaging line . Research Working Paper , Faculty of Management, McGill University .
   Google Scholar
• CHANDRU , V. , LEE , C. Y. , and UZSOY , R. , 1993a , Minimizing total completion time on batch processing machines . International Journal of Production Research , 31 , 2097 – 2121 .
   Web of Science ®Google Scholar
• CHANDRU , V. , LEE , C. Y. , and UZSOY , R. , 1993b , Minimizing total completion time on a batch processing machine with job families . Operations Research Letters , 13 , 61 – 65 .
   Web of Science ®Google Scholar
• COFFMAN , E. G. , GAREY , M. R. , and JOHNSON , D. S. , 1984 , Approximation algorithms for bin- packing-an updated survey Algorithm Design for Computer System Design , edited by G. Ausiello, M. Lucertini and P. Serafini ( New York Springer-Verlag ) pp. 49 – 106
   Google Scholar
• DOBSON , G. , and NAMBINADOM , R. S. , 1992 , The batch loading and scheduling problem . Research Report , Simon School of Business Administration, University of Rochester , Rochester , NY .
   Google Scholar
• EASTMAN , W. L. , EVEN , S. , and ISAACS , I. M. , 1964 , Bounds for the optimal scheduling of n jobs on m processors . Management Science , 11 , 268 – 279 .
   Web of Science ®Google Scholar
• FOWLER , J. W. , HOGG , G. L. , and PHILLIPS , D. T. , 1992 , Control of multiproduct bulk server diffusion/oxidation processes . IIE Transactions on Scheduling and Logistics , 24 , 84 – 96 .
   Web of Science ®Google Scholar
• FRENCH , S. , 1982 , Sequencing and Scheduling An Introduction to the Mathematics of the Job-shop ( New York Wiley ).
   Google Scholar
• GAREY , M. R. , and JOHNSON , D. S. , 1979 , Computers and Intractability A Guide to the Theory of NP-Completeness ( San Francisco W. H. Freeman ),
   Google Scholar
• GLASSEY , C. R. , and WENG , W. W. , 1991 , Dynamic batching heuristics for simultaneous Processing . IEEE Transactions on Semiconductor Manufacturing , 4 , 77 – 82 .
   Web of Science ®Google Scholar
• IKURA , Y. , and GIMPLE , M. , 1986 , Scheduling algorithms for a single batch processing machine . Operations Research Letters , 5 , 61 – 65 .
   Web of Science ®Google Scholar
• JOHNSON , D. S. , DEMERS , A. , ULLMAN , J. , GAREY , M. R. , and GRAHAM , R. L. , 1974 , Worst-case performance bounds for simple one-dimensional packing problems . SIAM Journal on Computing , 3 , 299 – 325 .
   Google Scholar
• LEE , C. Y. , UZSOY , R. , and MARTIN-VEGA , L. A. , 1992 , Efficient algorithms for scheduling semiconductor burn-in operations . Operations Research , 40 , 764 – 775 .
   Web of Science ®Google Scholar
• OVACIK , I. M. , and UZSOY , R. , 1992 , A shifting bottleneck algorithm for scheduling semiconductor testing operations . Journal of Electronics Manufacturing , 2 , 119 – 134 .
   Google Scholar