A Two-Stage Assembly-Type Flowshop Scheduling Problem for Minimizing Total Tardiness. (18th July 2016)

• Record Type: Journal Article
• Authors: Lee, Ju-Yong; Bang, June-Young
• Other Names: Verbeek Fons J. Academic Editor.
• Is Part Of: Mathematical problems in engineering. Volume 2016(2016)
• Publication Date: 2016-07-18
• Subjects: Engineering mathematics -- Periodicals; 510.2462
• DOI: 10.1155/2016/6409321
• Languages: English
• ISSNs: 1024-123X

Abstract

Abstract : 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.