Fixed pre-assembly scheduling on multiple fabrication machines

This paper considers a scheduling problem to minimize total weighted completion time at a fixed pre-assembly stage composed of multiple fabrication machines. In the fixed pre-assembly stage, each component part is machined on a fabrication machine specified in advance. The completion time of a product is measured by the latest completion time of its all components at the pre-assembly stage. Minimizing the total weighted completion time of a finite number of products is considered as the scheduling measure. Two lower bounds are derived and tested in a branch-and-bound algorithm. Also, an efficient greedy-type heuristic algorithm is developed to generate near-optimal schedules. Numerical experiments are performed to evaluate the performance of the proposed branch-and-bound and heuristic algorithms. (c) 2004 Elsevier B.V. All rights reserved.
Publisher
Elsevier Science Bv
Issue Date
2005-04
Language
ENG
Keywords

SINGLE-MACHINE; 2-MACHINE FLOWSHOP; PRODUCTS; COMPONENTS; JOBS

Citation

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, v.96, no.1, pp.109 - 118

ISSN
0925-5273
DOI
10.1016/j.ijpe.2004.03.005
URI
http://hdl.handle.net/10203/5474
Appears in Collection
IE-Journal Papers(저널논문)
  • Hit : 508
  • Download : 3
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 4 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0