Parallel Machine Scheduling by Column Generation.

Parallel machine scheduling problems concern the scheduling of "n" jobs on "m" machines to minimize some function of the job completion time. If preemption is not allowed, then most problems are not only NP-hard, but also very hard from a practical point of view. In this paper, we show that stong and fast linear programming lower bounds can be computed for an important class of machine scheduling problems with additive objective functions.

MoreLess

Year of publication:	1996
Authors:	Van Den Akker, J.M. ; Hoogeveen, J.A. ; Van De Velde, S.L.
Institutions:	Center for Operations Research and Econometrics (CORE), École des Sciences Économiques de Louvain
Subject:	LINEAR PROGRAMMING \| TECHNOLOGY \| MATHEMATICS \| MACHINERY

Check Google Scholar |

More access options

In German libraries (KVK)

I need help

More details

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

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