Flow shop non-idle scheduling and resource-constrained scheduling

doi:10.1007/s10479-015-2070-7

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Tsai, Yen-Shing	en_US
dc.contributor.author	Lin, Bertrand M. T.	en_US
dc.date.accessioned	2017-04-21T06:56:46Z	-
dc.date.available	2017-04-21T06:56:46Z	-
dc.date.issued	2016-03	en_US
dc.identifier.issn	0254-5330	en_US
dc.identifier.uri	http://dx.doi.org/10.1007/s10479-015-2070-7	en_US
dc.identifier.uri	http://hdl.handle.net/11536/133490	-
dc.description.abstract	In 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.iso	en_US	en_US
dc.subject	Flow shop	en_US
dc.subject	Resource constraints	en_US
dc.subject	Financial planning	en_US
dc.subject	Dynamic programming	en_US
dc.subject	Performance analysis	en_US
dc.title	Flow shop non-idle scheduling and resource-constrained scheduling	en_US
dc.identifier.doi	10.1007/s10479-015-2070-7	en_US
dc.identifier.journal	ANNALS OF OPERATIONS RESEARCH	en_US
dc.citation.volume	238	en_US
dc.citation.issue	1-2	en_US
dc.citation.spage	577	en_US
dc.citation.epage	585	en_US
dc.contributor.department	資訊管理與財務金融系註：原資管所+財金所	zh_TW
dc.contributor.department	Department of Information Management and Finance	en_US
dc.identifier.wosnumber	WOS:000373225500024	en_US
顯示於類別：	期刊論文