Full metadata record
DC FieldValueLanguage
dc.contributor.authorHwang, F. J.en_US
dc.contributor.authorKovalyov, M. Y.en_US
dc.contributor.authorLin, B. M. T.en_US
dc.date.accessioned2014-12-08T15:36:21Z-
dc.date.available2014-12-08T15:36:21Z-
dc.date.issued2014-06-01en_US
dc.identifier.issn0254-5330en_US
dc.identifier.urihttp://dx.doi.org/10.1007/s10479-014-1531-8en_US
dc.identifier.urihttp://hdl.handle.net/11536/24684-
dc.description.abstractThis paper studies a problem of scheduling fabrication and assembly operations in a two-machine flowshop, subject to the same predetermined job sequence on each machine. In the manufacturing setting, there are n products, each of which consists of two components: a common component and a unique component which are fabricated on machine 1 and then assembled on machine 2. Common components of all products are processed in batches preceded by a constant setup time. The manufacturing process related to each single product is called a job. We address four regular performance measures: the total job completion time, the maximum job lateness, the total job tardiness, and the number of tardy jobs. Several optimality properties are presented. Based upon the concept of critical path and block schedule, a generic dynamic programming algorithm is developed to find an optimal schedule in O(n(7)) time.en_US
dc.language.isoen_USen_US
dc.subjectTwo-machine flowshopen_US
dc.subjectBatch schedulingen_US
dc.subjectFixed sequenceen_US
dc.subjectDynamic programmingen_US
dc.titleScheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequenceen_US
dc.typeArticleen_US
dc.identifier.doi10.1007/s10479-014-1531-8en_US
dc.identifier.journalANNALS OF OPERATIONS RESEARCHen_US
dc.citation.volume217en_US
dc.citation.issue1en_US
dc.citation.spage263en_US
dc.citation.epage279en_US
dc.contributor.department資訊管理與財務金融系 註:原資管所+財金所zh_TW
dc.contributor.departmentDepartment of Information Management and Financeen_US
dc.identifier.wosnumberWOS:000337184500012-
dc.citation.woscount0-
Appears in Collections:Articles


Files in This Item:

  1. 000337184500012.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.