A composite algorithm for multiprocessor scheduling

Authors:
Giuseppe Paletta;Francesca Vocaturo
Affiliations:
Dipartimento di Economia e Statistica, Università della Calabria, Arcavacata di Rende (CS), Italy 87036;Dipartimento di Economia e Statistica, Università della Calabria, Arcavacata di Rende (CS), Italy 87036
Venue:
Journal of Heuristics
Year:
2011

Citing 8
Cited 1

A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective

Computers and Operations Research
Applying tabu search with influential diversification to multiprocessor scheduling

Computers and Operations Research - Special issue: heuristic, genetic and tabu search
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Heuristic Solution of Open Bin Packing Problems

Journal of Heuristics
Design and Evaluation of Tabu Search Algorithms forMultiprocessor Scheduling

Journal of Heuristics
A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem

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

SIAM Journal on Discrete Mathematics
Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem

INFORMS Journal on Computing

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

A composite algorithm is developed for the classical problem of scheduling independent jobs on identical parallel machines with the objective of minimizing the makespan. The algorithm at first obtains a family of initial partial solutions and combines these partial solutions until a feasible solution is generated. Then local search procedures are used for improving the solution. The effectiveness of this approach is evaluated through extensive computational comparisons with recent improvement heuristics for different classes of benchmark instances.