Unrelated parallel machine scheduling using local search

Authors:
C. A. Glass;C. N. Potts;P. Shade
Affiliations:
Faculty of Mathematical Studies, University of Southhampton Southhampton, S09 5NH, U.K.;Faculty of Mathematical Studies, University of Southhampton Southhampton, S09 5NH, U.K.;Faculty of Mathematical Studies, University of Southhampton Southhampton, S09 5NH, U.K.
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1994

Citing 16
Cited 10

Convergence of an annealing algorithm

Mathematical Programming: Series A and B
Future paths for integer programming and links to artificial intelligence

Computers and Operations Research - Special issue: Applications of integer programming
Simulated annealing: theory and applications

Simulated annealing: theory and applications
Approximation algorithms for scheduling unrelated parallel machines

Mathematical Programming: Series A and B
The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem

Computers and Operations Research
Genetic algorithms: foundations and applications

Annals of Operations Research
Heuristics for scheduling unrelated parallel machines

Computers and Operations Research
Job shop scheduling by simulated annealing

Operations Research
Applying tabu search to the job-shop scheduling problem

Annals of Operations Research - Special issue on Tabu search
New search spaces for sequencing problems with application to job shop scheduling

Management Science
Genetic local search in combinatorial optimization

CO89 Selected papers of the conference on Combinatorial Optimization
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)
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Worst-case analysis of a scheduling algorithm

Operations Research Letters

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
Integrating dominance properties with genetic algorithms for parallel machine scheduling problems with setup times

Applied Soft Computing
Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems

Computers and Operations Research
Coupling Genetic Local Search and Recovering Beam Search algorithms for minimizing the total completion time in the single machine scheduling problem subject to release dates

Computers and Operations Research
A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search

Mathematical and Computer Modelling: An International Journal
Makespan minimization for scheduling unrelated parallel machines with setup times

Journal of Intelligent Manufacturing
An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem

Computers and Operations Research
A two-stage Ant Colony optimization algorithm to minimize the makespan on unrelated parallel machines--part II: enhancements and experimentations

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

Simulated annealing and taboo search are well-established local search methods for obtaining approximate solutions to a variety of combinatorial optimization problems. More recently, genetic algorithms have also been applied. However, there are few studies which compare the relative performance of these different methods on the same problem. In this paper, these techniques are applied to the problem of scheduling jobs on unrelated parallel machines to minimize the maximum completion time. Results of extensive computational tests indicate that the quality of solutions generated by a genetic algorithm is poor. However, a hybrid method in which descent is incorporated into the genetic algorithm is comparable in performance with simulated annealing and taboo search.