| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4959702 | European Journal of Operational Research | 2017 | 14 Pages |
Abstract
Such a problem is strongly NP-hard. We first study the problem where the sequence of jobs is fixed: we show its complexity and provide a MILP formulation. For the case with two levels of criticality, we provide a dynamic programming algorithm. Finally, we propose a Branch and Bound method for the general problem (i.e., without a fixed job sequence).
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Yasmina Seddik, Zdenek Hanzálek,