Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

ORL
2010

favoriteEmaildiscussreport

59views more ORL 2010»

Minimizing the sum of weighted completion times in a concurrent open shop

13 years 3 months ago

Minimizing the sum of weighted completion times in a concurrent open shop

Download web.mit.edu

Monaldo Mastrolilli, Maurice Queyranne, Andreas S.

Real-time Traffic

ORL 2010 |

claim paper

Related Content

» Combinatorial Algorithms for Data Migration to Minimize Average Completion Time

» A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines

» Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems

» Improved Bounds for Flow Shop Scheduling

» Nonapproximability Results for Scheduling Problems with Minsum Criteria

» The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders

Post Info
More Details (n/a)

Added	29 Jan 2011
Updated	29 Jan 2011
Type	Journal
Year	2010
Where	ORL
Authors	Monaldo Mastrolilli, Maurice Queyranne, Andreas S. Schulz, Ola Svensson, Nelson A. Uhan

Comments (0)