First Page | Document Content | |
---|---|---|
Date: 2012-09-06 12:29:04 | 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 fundamentaAdd to Reading ListSource URL: theory.epfl.chDownload Document from Source WebsiteFile Size: 400,28 KBShare Document on Facebook |