A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search

Authors:
N. Piersma;W. Van Dijk
Affiliations:
Econometric Institute, Erasmus University Rotterdam P.O. Box 1738 NL-3000 DR Rotterdam, The Netherlands;Econometric Institute, Erasmus University Rotterdam P.O. Box 1738 NL-3000 DR Rotterdam, The Netherlands
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1996

Citing 6
Cited 7

Approximation algorithms for scheduling unrelated parallel machines

Mathematical Programming: Series A and B
Heuristics for scheduling unrelated parallel machines

Computers and Operations Research
Exact and Approximate Algorithms for Scheduling Nonidentical Processors

Journal of the ACM (JACM)
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors

Journal of the ACM (JACM)
Algorithms for Scheduling Tasks on Unrelated Processors

Journal of the ACM (JACM)
Unrelated parallel machine scheduling using local search

Mathematical and Computer Modelling: An International Journal

Scheduling Tasks on Unrelated Machines: Large Neighborhood Improvement Procedures

Journal of Heuristics
Scheduling of drilling operations in printed circuit board factory

Computers and Industrial Engineering
Scheduling unrelated parallel machines with sequence-dependent setups

Computers and Operations Research
Size-reduction heuristics for the unrelated parallel machines scheduling problem

Computers and Operations Research
Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems

Computers and Operations Research
A hybrid memetic algorithm for maximizing the weighted number of just-in-time jobs on unrelated parallel machines

Journal of Intelligent Manufacturing
Hybrid GRASP Heuristics to Solve an Unrelated Parallel Machine Scheduling Problem with Earliness and Tardiness Penalties

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.98

Visualization

Abstract

The parallel machine scheduling problem with unrelated machines is studied where the objective is to minimize the maximum makespan. In this paper, new local search algorithms are proposed where the neighborhood search of a solution uses the ''efficiency'' of the machines for each job. It is shown that this method yields better solutions and shorter running times than the more general local search heuristics.