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

Lot-Order Assignment Applying Priority Rules for the Single-Machine Total Tardiness Scheduling with Nonnegative Time-Dependent Processing Times

1Department of Industrial and Management Engineering, Incheon National University, 12-1 Songdo-dong, Yeonsu-gu, Incheon 406-840, Republic of Korea
2Department of Industrial and Management Engineering, Sungkyul University, 400-10 Anyang-dong, Manan-gu, Anyang, Gyeonggi-do 430-742, Republic of Korea

Received 21 January 2015; Accepted 13 March 2015

Academic Editor: Yunqiang Yin

Copyright © 2015 Jae-Gon Kim 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. K. Knutson, K. Kempf, J. Fowler, and M. Carlyle, “Lot-to-order matching for a semiconductor assembly and test facility,” IIE Transactions, vol. 31, no. 11, pp. 1103–1111, 1999. View at Publisher · View at Google Scholar · View at Scopus
  2. J. Fowler, K. Knutson, and M. Carlyle, “Comparison and evaluation of lot-to-order matching policies for a semiconductor assembly and test facility,” International Journal of Production Research, vol. 38, no. 8, pp. 1841–1853, 2000. View at Publisher · View at Google Scholar · View at Scopus
  3. M. Carlyle, K. Knutson, and J. Fowler, “Bin covering algorithms in the second stage of the lot to order matching problem,” Journal of the Operational Research Society, vol. 52, no. 11, pp. 1232–1243, 2001. View at Publisher · View at Google Scholar · View at Scopus
  4. T. G. Boushell, J. W. Fowler, A. B. Keha, K. R. Knutson, and D. C. Montgomery, “Evaluation of heuristics for a class-constrained lot-to-order matching problem in semiconductor manufacturing,” International Journal of Production Research, vol. 46, no. 12, pp. 3143–3166, 2008. View at Publisher · View at Google Scholar · View at Scopus
  5. T. S. Ng, Y. Sun, and J. Fowler, “Semiconductor lot allocation using robust optimization,” European Journal of Operational Research, vol. 205, no. 3, pp. 557–570, 2010. View at Publisher · View at Google Scholar · View at Scopus
  6. T. W. Wu, “Modular demand and supply pegging mechanism for semiconductor foundry,” in Proceedings of the IEEE International Symposium on Semiconductor Manufacturing, pp. 325–328, San Jose, Calif, USA, 2003.
  7. J.-Y. Bang, K.-Y. An, Y.-D. Kim, and S.-K. Lim, “A due-date-based algorithm for lot-order assignment in a semiconductor wafer fabrication facility,” IEEE Transactions on Semiconductor Manufacturing, vol. 21, no. 2, pp. 209–216, 2008. View at Publisher · View at Google Scholar · View at Scopus
  8. J.-G. Kim and S.-K. Lim, “Order-lot pegging for minimizing total tardiness in semiconductor wafer fabrication process,” Journal of the Operational Research Society, vol. 63, no. 9, pp. 1258–1270, 2012. View at Publisher · View at Google Scholar · View at Scopus
  9. S.-K. Lim, J.-G. Kim, and H.-J. Kim, “Simultaneous order-lot pegging and wafer release planning for semiconductor wafer fabrication facilities,” International Journal of Production Research, vol. 52, no. 12, pp. 3710–3724, 2014. View at Publisher · View at Google Scholar · View at Scopus
  10. T. C. Cheng, Q. Ding, and B. M. Lin, “A concise survey of scheduling with time-dependent processing times,” European Journal of Operational Research, vol. 152, no. 1, pp. 1–13, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. T. C. Cheng, C. C. Wu, and W. C. Lee, “Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects,” Information Sciences, vol. 178, no. 11, pp. 2476–2487, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. Y. Yin, D. Xu, K. Sun, and H. Li, “Some scheduling problems with general position-dependent and time-dependent learning effects,” Information Sciences, vol. 179, no. 14, pp. 2416–2425, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. Y. Yin and D. Xu, “Some single-machine scheduling problems with general effects of learning and deterioration,” Computers and Mathematics with Applications, vol. 61, no. 1, pp. 100–108, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. A. Allahverdi, C. T. Ng, T. C. Cheng, and M. Y. Kovalyov, “A survey of scheduling problems with setup times or costs,” European Journal of Operational Research, vol. 187, no. 3, pp. 985–1032, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. Y.-F. Hung, C.-C. Wang, and G.-H. Wu, “Scheduling semiconductor multihead testers using metaheuristic techniques embedded with lot-specific and configuration-specific information,” Mathematical Problems in Engineering, vol. 2013, Article ID 436701, 14 pages, 2013. View at Publisher · View at Google Scholar
  16. C. Koulamas, “The single-machine total tardiness scheduling problem: review and extensions,” European Journal of Operational Research, vol. 202, no. 1, pp. 1–7, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. A. P. J. Vepsalainen and T. E. Morton, “Priority rules for job shops with weighted tardiness costs,” Management Science, vol. 33, no. 8, pp. 1035–1047, 1987. View at Publisher · View at Google Scholar · View at Scopus
  18. Y.-D. Kim, “A comparison of dispatching rules for job shops with multiple identical jobs and alternative routeings,” International Journal of Production Research, vol. 28, no. 5, pp. 953–962, 1990. View at Publisher · View at Google Scholar · View at Scopus
  19. Y.-D. Kim, “A backward approach in list scheduling algorithms for multi-machine tardiness problems,” Computers & Operations Research, vol. 22, no. 3, pp. 307–319, 1995. View at Publisher · View at Google Scholar · View at Scopus
  20. D. H. Moon and D. P. Christy, “A simulation study for dynamic scheduling in a hybrid assembly/job shop considering the JIT context,” Production Planning and Control: The Management Operations, vol. 9, no. 6, pp. 532–541, 1998. View at Publisher · View at Google Scholar · View at Scopus
  21. T. C. Chiang and L. C. Fu, “Using dispatching rules for job shop scheduling with due date-based objectives,” International Journal of Production Research, vol. 45, no. 14, pp. 3245–3262, 2007. View at Publisher · View at Google Scholar · View at Scopus
  22. H. Emmons, “One-machine sequencing to minimize certain functions of job tardiness,” Operations Research, vol. 17, no. 4, pp. 701–715, 1969. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  23. K. R. Baker and J. W. Bertrand, “A dynamic priority rule for scheduling against due-dates,” Journal of Operations Management, vol. 4, no. 1, pp. 11–22, 1982. View at Google Scholar
  24. R. S. Russell, E. M. Dar-El, and B. W. Taylor III, “A comparative analysis of the COVERT job sequencing rule various shop performance measures,” International Journal of Production Research, vol. 25, no. 10, pp. 1523–1540, 1987. View at Publisher · View at Google Scholar · View at Scopus