Makespan minimization for a 2-stage assembly scheduling problem subject to component available time constraint

Chang Sup Sung and Jaeho Juhn

International Journal of Production Economics, 2009, vol. 119, issue 2, 392-401

Abstract: This paper considers a 2-stage assembly flowshop scheduling problem where each job is assembled with two types of components and makespan is the objective measure. For the assembly, one type of the components is outsourced subject to job-dependent lead time but the other type is fabricated in-house, at the first stage. The problem is shown to be NP-complete in the strong sense. Some solution properties are characterized, based on which three heuristic algorithms are derived. A branch-and-bound algorithm is also derived by use of the associated three lower bounds and several dominance properties. Numerical experiments are conducted to evaluate the performances of the proposed branch-and-bound and heuristic algorithms.

Keywords: Assembly; flowshop; scheduling; Component; available; time; Heuristic; Branch-and-bound (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0925-5273(09)00094-2
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:proeco:v:119:y:2009:i:2:p:392-401

Access Statistics for this article

International Journal of Production Economics is currently edited by Stefan Minner

More articles in International Journal of Production Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().