Full metadata record
DC FieldValueLanguage
dc.contributor.authorTsai, Yen-Shingen_US
dc.contributor.authorLin, Bertrand M. T.en_US
dc.date.accessioned2017-04-21T06:56:46Z-
dc.date.available2017-04-21T06:56:46Z-
dc.date.issued2016-03en_US
dc.identifier.issn0254-5330en_US
dc.identifier.urihttp://dx.doi.org/10.1007/s10479-015-2070-7en_US
dc.identifier.urihttp://hdl.handle.net/11536/133490-
dc.description.abstractIn a two-machine flow shop, the problem seeks to select and schedule jobs such that the processing of the selected jobs does not contain any idle time. The objective is to maximize the number of selected jobs. The problem is studied in the context of a resource-constrained scheduling problem. An O(n(2)) dynamic programming algorithm is proposed. The problem becomes ordinary NP-hard when job weights are introduced. A heuristic is designed and its performance ratio is analysed to be 3.en_US
dc.language.isoen_USen_US
dc.subjectFlow shopen_US
dc.subjectResource constraintsen_US
dc.subjectFinancial planningen_US
dc.subjectDynamic programmingen_US
dc.subjectPerformance analysisen_US
dc.titleFlow shop non-idle scheduling and resource-constrained schedulingen_US
dc.identifier.doi10.1007/s10479-015-2070-7en_US
dc.identifier.journalANNALS OF OPERATIONS RESEARCHen_US
dc.citation.volume238en_US
dc.citation.issue1-2en_US
dc.citation.spage577en_US
dc.citation.epage585en_US
dc.contributor.department資訊管理與財務金融系 註:原資管所+財金所zh_TW
dc.contributor.departmentDepartment of Information Management and Financeen_US
dc.identifier.wosnumberWOS:000373225500024en_US
Appears in Collections:Articles