A New Approximation Algorithm for the Nonpreemptive Scheduling of Independent Jobs on Identical Parallel Processors

Authors:
Giuseppe Paletta;Paolamaria Pietramala
Affiliations:
-;-
Venue:
SIAM Journal on Discrete Mathematics
Year:
2007

Citing 0
Cited 3

A Short Note on an Advance in Estimating the Worst-Case Performance Ratio of the MPS Algorithm

SIAM Journal on Discrete Mathematics
A composite algorithm for multiprocessor scheduling

Journal of Heuristics
A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the scheduling problem of $n$ independent jobs on $m$ identical parallel processors in order to minimize makespan, the completion time of the last job. We propose a new approximation algorithm that iteratively combines partial solutions to the problem. The worst-case performance ratio of the algorithm is $\frac{z+1}{z}-\frac{1}{mz}$, where $z$ is the number of initial partial solutions that are obtained by partitioning the set of jobs into $z$ families of subsets which satisfy suitable properties. The computational behavior of our worst-case performance ratio provided encouraging results on three families of instances taken from the literature.