Simulated Annealing Algorithm for the Weighted Unrelated Parallel Machines Problem

In this paper, a solution is presented to the unrelated parallel machines problem that minimizes the total weighted completion time. Simulated annealing is applied to the problem, which is modeled as a weighted bipartite matching problem. Experimental results with benchmarks are presented, evaluatin...

Full description

Saved in:
Bibliographic Details
Published inCERMA 2009 : 2009 Electronics, Robotics and Automotive Mechanics Conference : proceedings, 22-25 September 2009, Cuernavaca, Morelos, Mexico pp. 94 - 99
Main Authors Cruz-Chavez, M.A., Juarez-Perez, F., Avila-Melgar, E.Y., Martinez-Oropeza, A.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.09.2009
Subjects
Ant colony optimization
Integer linear programming
Iterative algorithms
Job shop scheduling
Linear programming
Manufacturing industries
Parallel machines
Processor scheduling
Scheduling algorithm
Simulated annealing
Online AccessGet full text
ISBN9780769537993
0769537995
DOI10.1109/CERMA.2009.46

Cover

More Information
Summary:In this paper, a solution is presented to the unrelated parallel machines problem that minimizes the total weighted completion time. Simulated annealing is applied to the problem, which is modeled as a weighted bipartite matching problem. Experimental results with benchmarks are presented, evaluating the efficiency and efficacy of the algorithm. It is then compared with an exact algorithm that solves the pondered model of integer linear programming. The results demonstrate that simulated annealing algorithm has high performance because for all the evaluated instances, it finds the optimum global solution.
ISBN:9780769537993
0769537995
DOI:10.1109/CERMA.2009.46