Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2016 (2016), Article ID 6409321, 10 pages
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.


This research considers a two-stage assembly-type flowshop scheduling problem with the objective of minimizing the total tardiness. The first stage consists of two independent machines, and the second stage consists of a single machine. Two types of components are fabricated in the first stage, and then they are assembled in the second stage. Dominance properties and lower bounds are developed, and a branch and bound algorithm is presented that uses these properties and lower bounds as well as an upper bound obtained from a heuristic algorithm. The algorithm performance is evaluated using a series of computational experiments on randomly generated instances and the results are reported.