Flow shop non-idle scheduling and resource-constrained scheduling

檔案

本條目沒有附加檔案。

日期

2016-03

期刊名稱

ANNALS OF OPERATIONS RESEARCH

摘要

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.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料