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

Cited 47 time in webofscience Cited 0 time in scopus
  • Hit : 623
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorSung, Chang Supko
dc.contributor.authorKim, Hyun Ahko
dc.date.accessioned2013-03-06T11:27:14Z-
dc.date.available2013-03-06T11:27:14Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued2008-
dc.identifier.citationINTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, v.113, no.2, pp.1038 - 1048-
dc.identifier.issn0925-5273-
dc.identifier.urihttp://hdl.handle.net/10203/86838-
dc.description.abstractThis 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. (C) 2008 Elsevier B.V. All rights reserved.-
dc.languageEnglish-
dc.publisherElsevier Science Bv-
dc.subjectTOTAL WEIGHTED FLOWTIME-
dc.subjectPARALLEL MACHINES-
dc.subjectHEURISTIC ALGORITHM-
dc.subject2-MACHINE FLOWSHOP-
dc.subjectBOUND ALGORITHM-
dc.subjectHYBRID FLOWSHOP-
dc.subjectSTAGE-
dc.subjectFABRICATION-
dc.subjectSHOP-
dc.subjectAPPROXIMATION-
dc.titleA two-stage multiple-machine assembly scheduling problem for minimizing sum of completion times-
dc.typeArticle-
dc.identifier.wosid000256933200042-
dc.identifier.scopusid2-s2.0-43549101965-
dc.type.rimsART-
dc.citation.volume113-
dc.citation.issue2-
dc.citation.beginningpage1038-
dc.citation.endingpage1048-
dc.citation.publicationnameINTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS-
dc.identifier.doi10.1016/j.ijpe.2007.12.007-
dc.contributor.localauthorSung, Chang Sup-
dc.type.journalArticleArticle-
dc.subject.keywordAuthortwo-stage assembly scheduling-
dc.subject.keywordAuthorsum of completion times-
dc.subject.keywordAuthorbranch-and-bound-
dc.subject.keywordPlusTOTAL WEIGHTED FLOWTIME-
dc.subject.keywordPlusPARALLEL MACHINES-
dc.subject.keywordPlusHEURISTIC ALGORITHM-
dc.subject.keywordPlus2-MACHINE FLOWSHOP-
dc.subject.keywordPlusBOUND ALGORITHM-
dc.subject.keywordPlusHYBRID FLOWSHOP-
dc.subject.keywordPlusSTAGE-
dc.subject.keywordPlusFABRICATION-
dc.subject.keywordPlusSHOP-
dc.subject.keywordPlusAPPROXIMATION-
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 47 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0