SCHEDULING FOR A SINGLE SEMICONDUCTOR BATCH-PROCESSING MACHINE TO MINIMIZE TOTAL WEIGHTED TARDINESS

REFERENCES

• Balasubramanian , H. , Monch , L. , Fowler , J. and Pfund , M. 2004 . Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness . International Journal of Production Research , 42 : 1621 – 1638 .
   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
• Chang , P. C. , Hsieh , J. C. and Liu , C. H. 2006 . A case-injected genetic algorithm for single machine scheduling problems with release time . International Journal of Production Economics , 103 : 551 – 564 .
   Web of Science ®Google Scholar
• Chang , P. C. and Wang , H. M. 2004 . A heuristic for a batch processing machine scheduled to minimize total completion time with non-identical job sizes . International Journal of Advanced Manufacturing Technology , 24 : 615 – 620 .
   Web of Science ®Google Scholar
• Chou , F. D. , Chang , P. C. and Wang , H. M. 2005 . A hybrid genetic algorithm to minimize makespan for the single batch machine dynamic scheduling problem . International Journal of Advanced Manufacturing Technology , 31 : 350 – 359 .
   Web of Science ®Google Scholar
• DuPont , L. and Dhaenens-Flipo , C. 2002 . Minimizing the makespan on a batch machine with non-identical jobs sizes: an exact procedure . Computers and Operations Research , 29 : 807 – 819 .
   Web of Science ®Google Scholar
• Ghazvini , F. J. and DuPont , L. 1998 . Minimizing mean flow times criteria on a single batch processing machine with non-identical jobs sizes . International Journal of Production Economics , 55 : 273 – 280 .
   Web of Science ®Google Scholar
• Kashan , A. H. , Karimin , B. and Jolai , F. 2006 . Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes . International Journal of Production Research , 44 : 2337 – 2360 .
   Web of Science ®Google Scholar
• Lawler , E. L. 1977 . A pseudo-polynomial algorithm for sequencing jobs to minimize total tardiness . Annals of Discrete Mathematics , 1 : 331 – 342 .
   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 – 774 .
   Web of Science ®Google Scholar
• Lee , C. Y. and Uzsoy , R. 1999 . Minimizing makespan on a single processing machine with dynamic job arrivals . International Journal of Production Research , 37 : 219 – 236 .
   Web of Science ®Google Scholar
• Li , C. L. and Lee , C. Y. 1997 . Scheduling with agreeable release times and due dates on a batch processing machine . European Journal of Operational Research , 96 : 564 – 569 .
   Web of Science ®Google Scholar
• Li , S. , Li , G. , Wang , X. and Liu , Q. 2005 . Minimizing makespan on a single batching machine with release times and non-identical job sizes . Operations Research Letters , 33 : 157 – 164 .
   Web of Science ®Google Scholar
• Mathirajan , M. and Sivakumar , A. I. 2006 . A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor . International Journal of Advanced Manufacturing Technology , 29 : 990 – 1001 .
   Web of Science ®Google Scholar
• Mehta , S. V. and Uzsoy , R. 1998 . Minimizing total tardiness on a batch processing machine with incompatible job families . IIE Transactions , 30 : 165 – 178 .
   Web of Science ®Google Scholar
• Melouk , S. , Damodaran , P. and Chang , P. Y. 2004 . Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing . International Journal of Production Economics , 87 : 141 – 147 .
   Web of Science ®Google Scholar
• Perez , I. C. , Fowler , J. W. and Carlyle , M. 2005 . Minimizing total weighted tardiness on a single batch process machine with incompatible job families . Computers and Operations Research , 32 : 327 – 341 .
   Web of Science ®Google Scholar
• Potts , C. N. and Van Wassenhove , L. N. 1991 . Single machine tardiness sequencing heuristics . IIE Transactions , 23 : 346 – 354 .
   Web of Science ®Google Scholar
• Sung , C. S. and Choung , Y. I. 2000 . Minimizing makespan on a single burn-in oven in semiconductor manufacturing . European Journal of Operational Research , 120 : 559 – 574 .
   Web of Science ®Google Scholar
• Uzsoy , R. 1995 . Scheduling batch processing machines with incompatible job families . International Journal of Production Research , 33 : 2605 – 2708 .
   Web of Science ®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
• Vepsalainen , A. and Morton , T. 1987 . Priority rules for job shops with weighted tardiness costs . Management Science , 33 : 1035 – 1047 .
   Web of Science ®Google Scholar
• Wang , C. S. and Uzsoy , R. 2002 . A genetic algorithm to minimize maximum lateness on a batch processing machine . Computers and Operations Research , 29 : 1621 – 1640 .
   Web of Science ®Google Scholar
• Zhang , G. , Cai , X. , Lee , C. Y. and Wong , C. K. 2001 . Minimizing makespan on a single batch processing machine with nonidentical job sizes . Naval Research Logistics , 48 : 226 – 240 .
   Web of Science ®Google Scholar