A PTAS for Minimizing the Total Weighted Completion Time On Identical Parallel Machines.

We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times.

Year of publication:	1999
Authors:	Skutella, M. ; Woeginger, G.J.
Institutions:	Center for Operations Research and Econometrics (CORE), École des Sciences Économiques de Louvain
Subject:	MATHEMATICS \| SCHEDULING THEORY

More access options

Series:	Papers.
Type of publication:	Book / Working Paper
Notes:	19 pages
Classification:	C60 - Mathematical Methods and Programming. General ; C61 - Optimization Techniques; Programming Models; Dynamic Analysis
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005634138