Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013, Article ID 436701, 14 pages
http://dx.doi.org/10.1155/2013/436701
Research Article

Scheduling Semiconductor Multihead Testers Using Metaheuristic Techniques Embedded with Lot-Specific and Configuration-Specific Information

1Department of Industrial Engineering and Engineering Management, National Tsing Hua University, Hsinchu 300, Taiwan
2Department of Business Administration and Graduate Institute of Logistics Management, National Dong Hwa University, Hualien 974, Taiwan

Received 16 August 2013; Revised 22 October 2013; Accepted 23 October 2013

Academic Editor: Chin-Chia Wu

Copyright © 2013 Yi-Feng Hung et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. A. K. Gupta and A. I. Sivakumar, “Job shop scheduling techniques in semiconductor manufacturing,” The International Journal of Advanced Manufacturing Technology, vol. 27, no. 11-12, pp. 1163–1169, 2006. View at Publisher · View at Google Scholar · View at Scopus
  2. R. Uzsoy, C.-Y. Lee, and L. A. Martinvega, “A review of production planning and scheduling models in the semiconductor industry part i: system characteristics, performance evaluation and production planning,” IIE Transactions, vol. 24, no. 4, pp. 47–60, 1992. View at Publisher · View at Google Scholar
  3. R. Uzsoy, C.-Y. Lee, and L. A. Martinvega, “A review of production planning and scheduling models in the semiconductor industry part ii: shop-floor control,” IIE Transactions, vol. 26, no. 5, pp. 44–55, 1994. View at Publisher · View at Google Scholar
  4. M. Mathirajan and A. I. Sivakumar, “A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor,” The International Journal of Advanced Manufacturing Technology, vol. 29, no. 9-10, pp. 990–1001, 2006. View at Publisher · View at Google Scholar · View at Scopus
  5. L. Danping and C. K. M. Lee, “A review of the research methodology for the re-entrant scheduling problem,” International Journal of Production Research, vol. 49, no. 8, pp. 2221–2242, 2011. View at Publisher · View at Google Scholar · View at Scopus
  6. R. C. Leachman, J. Kang, and V. Lin, “SLIM: short cycle time and low inventory in manufacturing at samsung electronics,” Interfaces, vol. 32, no. 1, pp. 61–77, 2002. View at Publisher · View at Google Scholar · View at Scopus
  7. H. -C. Wu and T. Chen, “A fuzzy-neural ensemble and geometric rule fusion approach for scheduling a wafer fabrication factory,” Mathematical Problems in Engineering, vol. 2013, Article ID 956978, 14 pages, 2013. View at Publisher · View at Google Scholar
  8. L. Li, Z. Sun, M. C. Zhou, and F. Qiao, “Adaptive dispatching rule for semiconductor wafer fabrication facility,” IEEE Transactions on Automation Science and Engineering, vol. 10, no. 2, pp. 354–364, 2013. View at Publisher · View at Google Scholar
  9. Y. H. Lee, M. Ham, B. Yoo, and J. S. Lee, “Daily planning and scheduling system for the EDS process in a semiconductor manufacturing facility,” The International Journal of Advanced Manufacturing Technology, vol. 41, no. 5-6, pp. 568–579, 2009. View at Publisher · View at Google Scholar · View at Scopus
  10. K. P. Ellis, Y. Lu, and E. K. Bish, “Scheduling of wafer test processes in semiconductor manufacturing,” International Journal of Production Research, vol. 42, no. 2, pp. 215–242, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  11. J.-Z. Wu and C.-F. Chien, “Modeling semiconductor testing job scheduling and dynamic testing machine configuration,” Expert Systems with Applications, vol. 35, no. 1-2, pp. 485–496, 2008. View at Publisher · View at Google Scholar · View at Scopus
  12. Y. Song, M. T. Zhang, J. Yi, L. Zhang, and L. Zheng, “Bottleneck station scheduling in semiconductor assembly and test manufacturing using ant colony optimization,” IEEE Transactions on Automation Science and Engineering, vol. 4, no. 4, pp. 569–578, 2007. View at Publisher · View at Google Scholar · View at Scopus
  13. Z. Zhang, L. Zheng, F. Hou, and N. Li, “Semiconductor final test scheduling with Sarsa(λ, k) algorithm,” European Journal of Operational Research, vol. 215, no. 2, pp. 446–458, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  14. Y. Deng, J. F. Bard, G. R. Chacon, and J. Stuber, “Scheduling back-end operations in semiconductor manufacturing,” IEEE Transactions on Semiconductor Manufacturing, vol. 23, no. 2, pp. 210–220, 2010. View at Publisher · View at Google Scholar · View at Scopus
  15. M. Fu, R. Askin, J. Fowler et al., “Batch production scheduling for semiconductor back-end operations,” IEEE Transactions on Semiconductor Manufacturing, vol. 24, no. 2, pp. 249–260, 2011. View at Publisher · View at Google Scholar · View at Scopus
  16. T. Freed and R. C. Leachman, “Scheduling semiconductor device test operations on multihead testers,” IEEE Transactions on Semiconductor Manufacturing, vol. 12, no. 4, pp. 523–530, 1999. View at Publisher · View at Google Scholar · View at Scopus
  17. R. M. Karp, “Reducibility among Combinatorial Problems,” in Complexity of Computer Computation, R. E. Miller and J. W. Thatcher, Eds., pp. 85–103, Plenum Press, New York, NY, USA, 1972. View at Google Scholar
  18. N. Piersma and W. van Dijk, “A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search,” Mathematical and Computer Modelling, vol. 24, no. 9, pp. 11–19, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  19. M.-W. Park and Y.-D. Kim, “Search heuristics for a parallel machine scheduling problem with ready times and due dates,” Computers & Industrial Engineering, vol. 33, no. 3-4, pp. 793–796, 1997. View at Publisher · View at Google Scholar · View at Scopus
  20. R. Cheng and M. Gen, “Parallel machine scheduling problems using memetic algorithms,” Computers & Industrial Engineering, vol. 33, no. 3-4, pp. 761–764, 1997. View at Publisher · View at Google Scholar · View at Scopus
  21. C. A. Glass, C. N. Potts, and P. Shade, “Unrelated parallel machine scheduling using local search,” Mathematical and Computer Modelling, vol. 20, no. 2, pp. 41–52, 1994. View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  22. D. Prot, O. Bellenguez-Morineau, and C. Lahlou, “New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria,” European Journal of Operational Research, vol. 231, no. 2, pp. 282–287, 2013. View at Publisher · View at Google Scholar
  23. E. B. Edis, C. Oguz, and I. Ozkarahan, “Parallel machine scheduling with additional resources: notation, classification, models and solution methods,” European Journal of Operational Research, vol. 230, no. 3, pp. 449–463, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  24. C. F. Liu, “A hybrid genetic algorithm to minimize total tardiness for unrelated parallel machine scheduling with precedence constraints,” Mathematical Problems in Engineering, vol. 2013, Article ID 537127, 11 pages, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  25. Y.-K. Lin, “Particle swarm optimization algorithm for unrelated parallel machine scheduling with release dates,” Mathematical Problems in Engineering, vol. 2013, Article ID 409486, 9 pages, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  26. S. Kirkpatrick, C. D. Gelatt Jr., and M. P. Vecchi, “Optimization by simulated annealing,” Science, vol. 220, no. 4598, pp. 671–680, 1983. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  27. P. J. M. van Laarhoven and E. M. L. Aarts, Simulated Annealing: Theory and Application, Springer, New York, NY, USA, 2nd edition, 2010.
  28. F. Glover, “Heuristics for integer programming using surrogate constraints,” Decision Sciences, vol. 8, no. 1, pp. 156–166, 1977. View at Publisher · View at Google Scholar
  29. F. Glover and M. Laguna, Tabu Search, Kluwer Academic Publishers, Boston, Mass, USA, 1997.
  30. J. H. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, Mich, USA, 1975. View at MathSciNet
  31. Z. Michaelewicz, Genetic Algorithms + Data Structures = Evolution Programs, Springer, New York, NY, USA, 3rd edition, 2013.
  32. M. Gen and R. Cheng, Genetic Algorithms & Engineering Design, John Wiley & Sons, New York, NY, USA, 1997.
  33. W.-C. Lee, C.-C. Wu, and P. Chen, “A simulated annealing approach to makespan minimization on identical parallel machines,” The International Journal of Advanced Manufacturing Technology, vol. 31, no. 3-4, pp. 328–334, 2006. View at Publisher · View at Google Scholar · View at Scopus
  34. I. Sariçiçek and Ç. Çelik, “Two meta-heuristics for parallel machine scheduling with job splitting to minimize total tardiness,” Applied Mathematical Modelling, vol. 35, no. 8, pp. 4117–4126, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  35. G. Waligóra, “Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation,” European Journal of Operational Research, vol. 193, no. 3, pp. 849–856, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  36. D. Y. Hu and Z. Q. Yao, “Parallel machines scheduling with sequence-dependent setup times constraints,” Advanced Science Letters, vol. 4, no. 6-7, pp. 2528–2531, 2011. View at Publisher · View at Google Scholar · View at Scopus
  37. I. A. Chaudhry and P. R. Drake, “Minimizing total tardiness for the machine scheduling and worker assignment problems in identical parallel machines using genetic algorithms,” The International Journal of Advanced Manufacturing Technology, vol. 42, no. 5-6, pp. 581–594, 2009. View at Publisher · View at Google Scholar · View at Scopus
  38. A. J. Ruiz-Torres, G. Paletta, and E. Pérez, “Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects,” Computers & Operations Research, vol. 40, no. 8, pp. 2051–2061, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  39. Y.-F. Hung, C.-H. Liang, and J. C. Chen, “Sensitivity search for the rescheduling of semiconductor photolithography operations,” The International Journal of Advanced Manufacturing Technology, vol. 67, no. 1–4, pp. 73–84, 2013. View at Publisher · View at Google Scholar
  40. W. Y. Jia, Z. B. Jiang, and Y. Li, “Closed loop control-based real-time dispatching heuristic on parallel batch machines with incompatible job families and dynamic arrivals,” International Journal of Production Research, vol. 51, no. 15, pp. 4570–4584, 2013. View at Publisher · View at Google Scholar
  41. C. A. Glass, C. N. Potts, and P. Shade, “Unrelated parallel machine scheduling using local search,” Mathematical & Computer Modelling, vol. 20, no. 2, pp. 41–52, 1994. View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  42. G. E. Liepins and M. R. Hilliard, “Genetic algorithms: foundations and applications,” Annals of Operations Research, vol. 21, no. 1, pp. 31–57, 1989. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  43. D. E. Goldberg, Genetic Algorithms in Search, Optimization & Machine Learning, Addison-Wesley, New York, NY, USA, 1989.
  44. E. G. Coffman, Jr., M. R. Garey, and D. S. Johnson, “An application of bin-packing to multiprocessor scheduling,” SIAM Journal on Computing, vol. 7, no. 1, pp. 1–17, 1978. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  45. R. L. Graham, “Bounds on multiprocessing timing anomalies,” SIAM Journal on Applied Mathematics, vol. 17, no. 2, pp. 416–429, 1969. View at Publisher · View at Google Scholar · View at Scopus
  46. M. Lundy and A. Mees, “Convergence of an annealing algorithm,” Mathematical Programming, vol. 34, no. 1, pp. 111–124, 1986. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  47. C. K. Y. Lin, K. B. Haley, and C. Sparks, “A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems,” European Journal of Operational Research, vol. 83, no. 2, pp. 330–346, 1995. View at Publisher · View at Google Scholar · View at Scopus
  48. F. Glover, “Tabu search: a tutorial,” Interfaces, vol. 20, no. 4, pp. 74–94, 1990. View at Publisher · View at Google Scholar
  49. F. Glover, E. Taillard, and D. Werra, “A user's guide to tabu search,” Annals of Operations Research, vol. 41, no. 1, pp. 3–28, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  50. M. Srinivas and L. M. Patnaik, “Adaptive probabilities of crossover and mutation in genetic algorithms,” IEEE Transactions on Systems, Man, and Cybernetics, vol. 24, no. 4, pp. 656–667, 1994. View at Publisher · View at Google Scholar · View at Scopus