A Two-Stage Assembly-Type Flowshop Scheduling Problem for Minimizing Total Tardiness
Joint Authors
Source
Mathematical Problems in Engineering
Issue
Vol. 2016, Issue 2016 (31 Dec. 2016), pp.1-10, 10 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2016-07-18
Country of Publication
Egypt
No. of Pages
10
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Lee, Ju-Yong& Bang, June-Young. 2016. A Two-Stage Assembly-Type Flowshop Scheduling Problem for Minimizing Total Tardiness. Mathematical Problems in Engineering،Vol. 2016, no. 2016, pp.1-10.
https://search.emarefa.net/detail/BIM-1112452
Modern Language Association (MLA)
Lee, Ju-Yong& Bang, June-Young. A Two-Stage Assembly-Type Flowshop Scheduling Problem for Minimizing Total Tardiness. Mathematical Problems in Engineering No. 2016 (2016), pp.1-10.
https://search.emarefa.net/detail/BIM-1112452
American Medical Association (AMA)
Lee, Ju-Yong& Bang, June-Young. A Two-Stage Assembly-Type Flowshop Scheduling Problem for Minimizing Total Tardiness. Mathematical Problems in Engineering. 2016. Vol. 2016, no. 2016, pp.1-10.
https://search.emarefa.net/detail/BIM-1112452
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1112452