標題: Flow shop non-idle scheduling and resource-constrained scheduling
作者: Tsai, Yen-Shing
Lin, Bertrand M. T.
資訊管理與財務金融系 註:原資管所+財金所
Department of Information Management and Finance
關鍵字: Flow shop;Resource constraints;Financial planning;Dynamic programming;Performance analysis
公開日期: Mar-2016
摘要: 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.
URI: http://dx.doi.org/10.1007/s10479-015-2070-7
http://hdl.handle.net/11536/133490
ISSN: 0254-5330
DOI: 10.1007/s10479-015-2070-7
期刊: ANNALS OF OPERATIONS RESEARCH
Volume: 238
Issue: 1-2
起始頁: 577
結束頁: 585
Appears in Collections:Articles