A two-stage multiple-machine assembly scheduling problem for minimizing sum of completion times

C.S. Sung and Hyun Ah Kim

International Journal of Production Economics, 2008, vol. 113, issue 2, 1038-1048

Abstract: This paper considers a two-stage multiple-machine assembly scheduling problem for minimizing the sum of completion times. The first stage consists of two independent machines, each of which produces its own type of components. The second stage consists of two identical and independent parallel machines. The processing of the second stage cannot begin until the processing of the first stage is finished. Minimizing the sum of completion times at the second stage is considered as the scheduling measure. A lower bound based on the SPT rule is derived, which is then used to develop a branch-and-bound algorithm. An efficient simple heuristic algorithm is also developed.

Date: 2008
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0925-5273(08)00005-4
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:113:y:2008:i:2:p:1038-1048

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 ().