Full metadata record
DC FieldValueLanguage
dc.contributor.authorLin, BMTen_US
dc.contributor.authorWu, JMen_US
dc.date.accessioned2014-12-08T15:16:22Z-
dc.date.available2014-12-08T15:16:22Z-
dc.date.issued2006-06-15en_US
dc.identifier.issn0020-7543en_US
dc.identifier.urihttp://dx.doi.org/10.1080/00207540500446394en_US
dc.identifier.urihttp://hdl.handle.net/11536/12143-
dc.description.abstractIn this paper we consider a production scheduling problem in a two-machine flowshop. The bicriteria objective is a linear combination or weighted sum of the makespan and total completion time. This problem is computationally hard because the special case concerning the minimization of the total completion time is already known to be strongly NP-hard. To find an optimal schedule, we deploy the Johnson algorithm and a lower bound scheme that was previously developed for total completion time scheduling. Computational experiments are presented to study the relative performance of different lower bounds. While the best known bound for the bicriteria problem can successfully solve test cases of 10 jobs within a time limit of 30 min, under the same setting our branch-and-bound algorithm solely equipped with the new scheme can produce optimal schedules for most instances with 30 or less jobs. The results demonstrate the convincing capability of the lower bound scheme in curtailing unnecessary branching during problem-solving sessions. The computational experience also suggests the practical significance and potential implications of this scheme.en_US
dc.language.isoen_USen_US
dc.subjectflowshopen_US
dc.subjectmakespanen_US
dc.subjecttotal completion timeen_US
dc.subjectlower bounden_US
dc.subjectbranch-and-bound algorithmen_US
dc.titleBicriteria scheduling in a two-machine permutation flowshopen_US
dc.typeArticleen_US
dc.identifier.doi10.1080/00207540500446394en_US
dc.identifier.journalINTERNATIONAL JOURNAL OF PRODUCTION RESEARCHen_US
dc.citation.volume44en_US
dc.citation.issue12en_US
dc.citation.spage2299en_US
dc.citation.epage2312en_US
dc.contributor.department資訊管理與財務金融系 註:原資管所+財金所zh_TW
dc.contributor.departmentDepartment of Information Management and Financeen_US
dc.identifier.wosnumberWOS:000237577400002-
dc.citation.woscount6-
Appears in Collections:Articles


Files in This Item:

  1. 000237577400002.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.