Minimizing total completion time on batch processing machines

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
• BAKER , K. R. , 1974 , Introduction to Sequencing and Scheduling ( New York John Wiley ).
   Google Scholar
• BARNES , J. W. and BRENNAN , J. J. , 1977 , An improved algorithm for scheduling jobs on identical machines . AIIE Transactions, 9 , 25 – 31 .
   Google Scholar
• DEB , R. K. and SERFOZO , R. F. , 1973 , Optimal control of batch service queues. Advances in Applied Probability, 5 , 340 – 361 .
   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
• ELMAGHRABY , S. E. and PARK , S. H. , 1974 , Scheduling jobs on a number of identical machines . A FIE Transactions, 6 , 1 – 13 .
   Google Scholar
• FRENCH , S. , 1982 , Sequencing and Scheduling An Introduction to the Mathematics of the Job-Shop ( New York Wiley ).
   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 , Efficient scheduling algorithms for a single batch processing machine . Operations Research Letters, 5 , 61 – 65 .
   Web of Science ®Google Scholar
• KAWAGUCHI , T. and KYAN , S. , 1986 , Worst-case of an LRF schedule for the mean weighted flow time problem . SIAM Journal on Computing, 15 , 1119 – 1129 .
   Web of Science ®Google Scholar
• LAGEWEG , B. J. , LAWLER , E. L. , LENSTRA , J. K. ,RINNOOY KAN , A. H. G. , 1981 ,C omputer-aided complexity classification of deterministic scheduling problems . Report No. BW138 , Mathematisch Centrum , Amsterdam .
   Google Scholar
• LAWLER , E. L. and MOORE , J. M. , 1969 , A functional equation and its application to resource allocation and sequencing problems . Management Science, 16 , 77 – 84 .
   Web of Science ®Google Scholar
• LEE , C. Y. and UZSOY , R. , 1992 , A new dynamic programming algorithm for the parallel machine total weighted completion time problem . Operations Research Letters, 11 , 73 – 75 .
   Web of Science ®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
• LENSTRA , J. K. , RINNOOY KAN , A. H. G. and BRUCKER , P. , 1977 , Complexity of machine scheduling problems . Annals of Discrete Mathematics, 1 , 343 – 362 .
   Google Scholar
• MEDHI , J. , 1975 , Waiting time distribution in a poisson queue with a general bulk service rule . Management Science, 21 , 777 – 782 .
   Web of Science ®Google Scholar
• NEUTS , M. , 1967 , A general class of bulk queues with poisson input. , Annals of Mathematical Statistics 38 , 759 – 770 .
   Google Scholar
• ROTHKOPF , M. H. , 1966 , Scheduling independent tasks on parallel processors . Management Science 12 , 437 – 447 .
   Google Scholar
• SAHNI , S. K. , 1976 , Algorithms for scheduling independent tasks . Journal of the ACM, 23, 116 – 127 .
   Google Scholar
• SARIN , S. C, AHN , S. and BISHOP , A. B. , 1988 , An improved branching scheme for the branch and bound procedure of scheduling n jobs on m parallel machines to minimize total weighted flowtime . International Journal of Production Research, 26 , 1183 – 1191 .
   Web of Science ®Google Scholar
• UZSOY , R. , LEE , C. Y. , MARTIN-VEGA , L. A. and HINCHMAN , J. , 1992 , Scheduling semiconductor test operations optimization and approximation , in New Directions for Operations Research in Manufacturing, G. Fandel, T. Gulledge and A. Jones (eds) ( Springer-Verlag ) pp. 179 – 199 .
   Google Scholar