A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling
| dc.creator | Chen, Jianer | |
| dc.creator | Miranda, Antonio | |
| dc.date.accessioned | 2019-10-08T20:09:01Z | |
| dc.date.available | 2019-10-08T20:09:01Z | |
| dc.date.issued | 2001 | |
| dc.identifier.issn | 0097-5397 | |
| dc.identifier.issn | 1095-7111 | |
| dc.identifier.uri | https://hdl.handle.net/1969.1/178674 | |
| dc.format.extent | 16 | en |
| dc.publisher | SIAM Journal on Computing | |
| dc.relation.ispartof | 1foldr Import 2019-10-08 Batch 1 | en |
| dc.relation.uri | 10.1137/S0097539798348110 | en |
| dc.title | A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling | en |
