An approximate algorithm for a high-multiplicity parallel machine scheduling problem

Authors:
Carlo Filippi
Affiliations:
Department of Quantitative Methods, University of Brescia, Italy
Venue:
Operations Research Letters
Year:
2010

Citing 8
Cited 0

Parallel machine scheduling with splitting jobs

Discrete Applied Mathematics
Convex quadratic and semidefinite programming relaxations in scheduling

Journal of the ACM (JACM)
A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths

Mathematics of Operations Research
Parallel Machine Scheduling, Linear Programming, and Parameter List Scheduling Heuristics

Operations Research
Convex Optimization

Convex Optimization
Exact and approximate algorithms for high-multiplicity parallel machine scheduling

Journal of Scheduling
Probabilistic analysis of the minimum weighted flowtime scheduling problem

Operations Research Letters
Bounds and asymptotic results for the uniform parallel processor weighted flow time problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a high-multiplicity parallel machine scheduling problem where the objective is to minimize the weighted sum of completion times. We suggest an approximate algorithm and we prove that it is asymptotically exact. The algorithm exploits a convex quadratic relaxation of the problem to fix a partial schedule, consisting of most jobs, and then assigns the residual jobs following a simple and general rule. The quality of the obtained solution is evidenced by some numerical tests.