Timeline for How to prove the NP-hardness of this scheduling problem? [closed]
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 1, 2013 at 7:13 | history | closed |
Andrés E. Caicedo David White Jack Huizenga Suvrit Andrey Rekalo |
Not suitable for this site | |
| Dec 1, 2013 at 3:01 | review | Close votes | |||
| Dec 1, 2013 at 7:13 | |||||
| Nov 25, 2013 at 15:51 | comment | added | Arnaud | You could take a look at the Section 6.3 of the handbook of Scheduling, where they refer to two very related NP-hardness proofs. | |
| Nov 25, 2013 at 6:32 | history | edited | Fnatic | CC BY-SA 3.0 |
deleted 2 characters in body
|
| Nov 22, 2013 at 10:05 | review | Close votes | |||
| Nov 22, 2013 at 14:28 | |||||
| Nov 22, 2013 at 8:27 | history | asked | Fnatic | CC BY-SA 3.0 |