摘要
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 (Formula presented.) 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.
| 原文 | English |
|---|---|
| 頁（從 - 到） | 577-585 |
| 頁數 | 9 |
| 期刊 | Annals of Operations Research |
| 卷 | 238 |
| 發行號 | 1-2 |
| DOIs | |
| 出版狀態 | Published - 3月 2016 |