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

doi:10.1016/0305-0548(94)90053-1

Computers & Operations Research

Volume 21, Issue 2, February 1994, Pages 205-210

https://doi.org/10.1016/0305-0548(94)90053-1 Get rights and content

Abstract

This paper describes a new heuristic algorithm for the problem of scheduling n independent jobs on m identical parallel machines in order to minimize the makespan. The algorithm produces near-optimal solutions in short computation times. It outperforms alternative heuristics on a series of test problems.

References (20)

R.L. Graham et al.
Optimization and approximation in deterministic sequencing and scheduling: a survey
Annals discr. Math.
(1979)
T.C.E. Cheng et al.
A state-of-the-art review of parallel-machine scheduling research
Eur. J. Opl Res.
(1990)
D.K. Friesen et al.
Evaluation of a MULTIFIT-based scheduling algorithm
J. Algorith.
(1986)
J.Y.-T. Leung
Bin-packing with restricted piece sizes
Inform. Process. Letters
(1989)
E.L. Lawler et al.
Sequencing and scheduling: algorithms and complexity
M.R. Garey et al.
Strong NP-completeness results: motivation, examples and implications
J. assoc. comput. Mach.
(1978)
J. Blazewicz
Selected topics in scheduling theory
Annals discr. Math.
(1987)
M. Dell'Amico et al.
Optimal scheduling of tasks on identical parallel processors
P. Bratley et al.
Scheduling with earliest start and due date constraints on multiple machines
Naval Res. Logist. Q.
(1975)
R.L. Graham
Bounds on multiprocessing timing anomalies
SIAM J. appl. Math.
(1969)

There are more references available in the full text version of this article.

Cited by (0)

^†: P. M. França is Professor at the State University of Campinas, Brazil.

^§: G. Laporte is Professor at the École des Hautes Études Commerciales de Montréal, and member of the CRT.

^∥: F. M. Müller is a researcher at the Federal University of Santa Maria, Brazil. He is now enrolled as a Ph.D. student at the State University of Campinas, Brazil, and is currently visiting the CRT.

View full text

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

Abstract

Annals discr. Math.

Eur. J. Opl Res.

J. Algorith.

Inform. Process. Letters

Sequencing and scheduling: algorithms and complexity

Strong NP-completeness results: motivation, examples and implications

J. assoc. comput. Mach.

Selected topics in scheduling theory

Annals discr. Math.

Optimal scheduling of tasks on identical parallel processors

Scheduling with earliest start and due date constraints on multiple machines

Naval Res. Logist. Q.

Bounds on multiprocessing timing anomalies

SIAM J. appl. Math.