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

Cited 18 time in webofscience Cited 0 time in scopus
  • Hit : 381
  • Download : 0
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. (C) 2009 Elsevier B.V. All rights reserved.
Publisher
Elsevier Science Bv
Issue Date
2009-03
Language
English
Article Type
Article
Keywords

BOUND ALGORITHM; 3-MACHINE

Citation

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, v.119, no.2, pp.392 - 401

ISSN
0925-5273
DOI
10.1016/j.ijpe.2009.03.012
URI
http://hdl.handle.net/10203/94313
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 18 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0