| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10523036 | Computers & Industrial Engineering | 2011 | 5 Pages |
Abstract
⺠Special case of the coupled-tasks scheduling problem on mono-processor. ⺠All processing times are equal to 1, and the gap has exact length L. ⺠Introduction of incompatibility constraints, and precedence constraints with treatment tasks. ⺠This problem is NP-complete and we propose an Ï-approximation algorithm where Ï⩽(L+6)6-12(L+2)+(L+3)6n(L+2).
Keywords
Related Topics
Physical Sciences and Engineering
Engineering
Industrial and Manufacturing Engineering
Authors
G. Simonin, R. Giroudeau, J.C. König,