Fingerprint
Dive into the research topics of 'The time dependent machine makespan problem is strongly NP-complete'. Together they form a unique fingerprint.- Sort by
- Weight
- Alphabetically
The time dependent machine makespan problem is strongly NP-complete
Edwin Tai Chiu Cheng, Q. Ding
Research output: Journal article publication › Journal article › Academic research › peer-review
10
Citations
(Scopus)