First Page | Document Content | |
---|---|---|
Date: 2013-11-25 11:05:06Scheduling Operations research Applied mathematics Mathematics Makespan Algorithm Online algorithm Economy Job shop scheduling Flow shop scheduling | Scheduling with Unexpected Machine Breakdowns Susanne Albers Gunter Schmidty AbstractAdd to Reading ListSource URL: www14.in.tum.deDownload Document from Source WebsiteFile Size: 224,96 KBShare Document on Facebook |
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 |