A simulated annealing heuristic for minimizing makespan in parallel machine scheduling

Authors:
Dipak Laha
Affiliations:
Department of Mechanical Engineering, Jadavpur University, Kolkata, India
Venue:
SEMCCO'12 Proceedings of the Third international conference on Swarm, Evolutionary, and Memetic Computing
Year:
2012

Citing 11
Cited 0

Multiprocessor scheduling: combining LPT and MULTIFIT

Discrete Applied Mathematics
Simulated annealing: theory and applications

Simulated annealing: theory and applications
Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing

Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
Simulated annealing heuristics for the average flow-time and the number of tardy jobs bi-criteria identical parallel machine problem

Proceedings of the 21st international conference on Computers and industrial engineering
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines

Computers and Operations Research
An efficient stochastic hybrid heuristic for flowshop scheduling

Engineering Applications of Artificial Intelligence
Parallel-machine scheduling problems with sequence-dependent setup times using an ACO, SA and VNS hybrid algorithm

Expert Systems with Applications: An International Journal
A simulated annealing algorithm to minimize makespan of parallel batch processing machines with unequal job ready times

Expert Systems with Applications: An International Journal
Parallel machine scheduling problem to minimize the makespan with resource dependent processing times

Applied Soft Computing
A simulated annealing approach to minimize the maximum lateness on uniform parallel machines

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with the problem of scheduling a set of n independent jobs to be processed on m identical parallel machines in order to minimize makespan. This problem is known to be NP-complete. A SA based heuristic is presented to solve this problem. Empirical results with a large number of randomly generated problem instances demonstrate that the proposed method produces solutions that are fairly superior to that of the best-known method in the literature while not affecting its computational effort.