Convex Quadratic and Semidefinite Programming Relaxations in Scheduling.

We consider the problem of scheduling unrelated parallel machines subject to release dates so as to minimize the total weighted completion time of jobs. The main contribution of this paper is a probably good convex quadratic programming relaxation of strongly polynomial size of this problem.

MoreLess

Year of publication:	1999
Authors:	Skutella, M.
Institutions:	Center for Operations Research and Econometrics (CORE), École des Sciences Économiques de Louvain
Subject:	LINEAR PROGRAMMING

More details

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

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