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

A Two-Stage Assembly-Type Flowshop Scheduling Problem for Minimizing Total Tardiness

1System Engineering Team, Device Solution Business, Samsung Electronics Co., Ltd., Yongin-si, Gyeonggi-do 17113, Republic of Korea
2Department of Industrial Management Engineering, Sungkyul University, Anyang-si, Gyeonggi-do 14097, Republic of Korea

Received 11 March 2016; Accepted 20 June 2016

Academic Editor: Fons J. Verbeek

Copyright © 2016 Ju-Yong Lee and June-Young Bang. 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. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. Rinnooy Kan, “Optimization and approximation in deterministic sequencing and scheduling: a survey,” Annals of Discrete Mathematics, vol. 5, pp. 287–326, 1979. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  2. C. Koulamas, “The total tardiness problem: review and extensions,” Operations Research, vol. 42, no. 6, pp. 1025–1041, 1994. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  3. C.-Y. Lee, T. C. E. Cheng, and B. M. T. Lin, “Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem,” Management Science, vol. 39, no. 5, pp. 616–625, 1993. View at Publisher · View at Google Scholar · View at Scopus
  4. C. S. Sung and H. A. Kim, “A two-stage multiple-machine assembly scheduling problem for minimizing sum of completion times,” International Journal of Production Economics, vol. 113, no. 2, pp. 1038–1048, 2008. View at Publisher · View at Google Scholar · View at Scopus
  5. C. N. Potts, S. V. Sevast’janov, V. A. Strusevich, L. N. Van Wassenhove, and C. M. Zwaneveld, “The two-stage assembly scheduling problem: complexity and approximation,” Operations Research, vol. 43, no. 2, pp. 346–355, 1995. View at Publisher · View at Google Scholar · View at MathSciNet
  6. A. M. A. Hariri and C. N. Potts, “A branch and bound algorithm for the two-stage assembly scheduling problem,” European Journal of Operational Research, vol. 103, no. 3, pp. 547–556, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  7. M. Haouari and T. Daouas, “Optimal scheduling of the 3-machine assembly-type flow shop,” RAIRO Operations Research, vol. 33, no. 4, pp. 439–445, 1999. View at Publisher · View at Google Scholar · View at MathSciNet
  8. X. Sun, K. Morizawa, and H. Nagasawa, “Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling,” European Journal of Operational Research, vol. 146, no. 3, pp. 498–516, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. C. Koulamas and G. J. Kyparisis, “The three-stage assembly flowshop scheduling problem,” Computers and Operations Research, vol. 28, no. 7, pp. 689–704, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. C.-S. Sung and J.-H. Juhn, “Makespan minimization for a 2-stage assembly scheduling problem subject to component available time constraint,” International Journal of Production Economics, vol. 119, no. 2, pp. 392–401, 2009. View at Publisher · View at Google Scholar · View at Scopus
  11. A. Tozkapan, O. Kirca, and C.-S. Chung, “A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem,” Computers & Operations Research, vol. 30, no. 2, pp. 309–320, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. F. S. Al-Anzi and A. Allahverdi, “A hybrid tabu search heuristic for the two-stage assembly scheduling problem,” International Journal of Operations Research, vol. 3, no. 2, pp. 109–119, 2006. View at Google Scholar · View at MathSciNet
  13. A. Allahverdi and F. S. Al-Anzi, “The two-stage assembly scheduling problem to minimize total completion time with setup times,” Computers & Operations Research, vol. 36, no. 10, pp. 2740–2747, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. A. Allahverdi and F. S. Al-Anzi, “A PSO and a Tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application,” Computers and Operations Research, vol. 33, no. 4, pp. 1056–1080, 2006. View at Publisher · View at Google Scholar · View at Scopus
  15. F. S. Al-Anzi and A. Allahverdi, “A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times,” European Journal of Operational Research, vol. 182, no. 1, pp. 80–94, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. A. Allahverdi and H. Aydilek, “The two stage assembly flowshop scheduling problem to minimize total tardiness,” Journal of Intelligent Manufacturing, vol. 26, no. 2, pp. 225–237, 2015. View at Publisher · View at Google Scholar · View at Scopus
  17. J. Schaller, “Note on minimizing total tardiness in a two-machine flowshop,” Computers and Operations Research, vol. 32, no. 12, pp. 3273–3281, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  18. C. N. Potts and L. N. Van-Wassenhove, “Branch and bound algorithm for the total weighted tardiness problem,” Operations Research, vol. 33, no. 2, pp. 363–377, 1985. View at Publisher · View at Google Scholar · View at Scopus
  19. M. Nawaz, E. E. Enscore Jr., and I. Ham, “A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem,” Omega, vol. 11, no. 1, pp. 91–95, 1983. View at Publisher · View at Google Scholar · View at Scopus
  20. C. Chu, “A branch-and-bound algorithm to minimize total tardiness with different release dates,” Naval Research Logistics, vol. 39, no. 2, pp. 265–283, 1992. View at Publisher · View at Google Scholar · View at Scopus
  21. S. Kondakci, Ö. Kirca, and M. Azizoğlu, “An efficient algorithm for the single machine tardiness problem,” International Journal of Production Economics, vol. 36, no. 2, pp. 213–219, 1994. View at Publisher · View at Google Scholar · View at Scopus
  22. Y.-D. Kim, “A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops,” Computers and Operations Research, vol. 20, no. 4, pp. 391–401, 1993. View at Publisher · View at Google Scholar · View at Scopus
  23. Y.-D. Kim, “Minimizing total tardiness in permutation flowshops,” European Journal of Operational Research, vol. 85, no. 3, pp. 541–555, 1995. View at Publisher · View at Google Scholar · View at Scopus