<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2012-11-28 07:19:03Complexity classes NP-complete problems Mathematical optimization Bin packing problem Operations research Polynomial-time approximation scheme Strongly NP-complete Job shop scheduling Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics |
Add to Reading List |
Approximation Algorithms (ADM III) | Hardness of Approximating Flow and Job Shop Scheduling Problems MONALDO MASTROLILLI, IDSIA, Lugano, Switzerland OLA SVENSSON, EPFL, Switzerland 20 We consider several variants of the job shop problem that is a fundamentaDocID: 1uCRt - View Document |
| Radboud Universiteit Nijmegen Master Thesis Mathematics Scheduling with job dependent machine speedDocID: 1rrDA - View Document |
| Microsoft Word - IBSAlgorithms.docDocID: 1rkGY - View Document |
| 239 Documenta Math. Ronald Graham: Laying the Foundations of Online OptimizationDocID: 1r1tq - View Document |
| Minimizing maximum (weighted) flow-time on related and unrelated machines S. Anand1 Karl Bringmann2 Tobias Friedrich3 Naveen Garg1 Amit Kumar1 1DocID: 1qWKb - View Document |