Full metadata record
DC FieldValueLanguage
dc.contributor.authorLin, Bertrand M. T.en_US
dc.contributor.authorHwang, F. J.en_US
dc.contributor.authorGupta, Jatinder N. D.en_US
dc.date.accessioned2018-08-21T05:53:59Z-
dc.date.available2018-08-21T05:53:59Z-
dc.date.issued2017-06-01en_US
dc.identifier.issn1094-6136en_US
dc.identifier.urihttp://dx.doi.org/10.1007/s10951-016-0493-xen_US
dc.identifier.urihttp://hdl.handle.net/11536/145440-
dc.description.abstractThis paper studies the problem of scheduling three-operation jobs in a two-machine flowshop subject to a predetermined job processing sequence. Each job has two preassigned operations, which are to be performed on their respective dedicated machines, and a flexible operation, which may be processed on either of the two machines subject to the processing order as specified. Five standard objective functions, including the makespan, the maximum lateness, the total weighted completion time, the total weighted tardiness, and the weighted number of tardy jobs are considered. We show that the studied problem for either of the five considered objective functions is ordinary NP-hard, even if the processing times of the preassigned operations are zero for all jobs. A pseudo-polynomial time dynamic programming framework, coupled with brief numerical experiments, is then developed for all the addressed performance metrics with different run times.en_US
dc.language.isoen_USen_US
dc.subjectFlowshopen_US
dc.subjectThree-operation joben_US
dc.subjectFixed job sequenceen_US
dc.subjectNP-hardnessen_US
dc.subjectDynamic programen_US
dc.titleTwo-machine flowshop scheduling with three-operation jobs subject to a fixed job sequenceen_US
dc.typeArticleen_US
dc.identifier.doi10.1007/s10951-016-0493-xen_US
dc.identifier.journalJOURNAL OF SCHEDULINGen_US
dc.citation.volume20en_US
dc.citation.spage293en_US
dc.citation.epage302en_US
dc.contributor.department資訊管理與財務金融系 註:原資管所+財金所zh_TW
dc.contributor.departmentDepartment of Information Management and Financeen_US
dc.identifier.wosnumberWOS:000400364500006en_US
Appears in Collections:Articles