<--- Back to Details
First PageDocument 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 fundamenta

Add to Reading List

Source URL: theory.epfl.ch

Download Document from Source Website

File Size: 400,28 KB

Share Document on Facebook

Similar Documents