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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Simulated Annealing Algorithm for the Weighted Unrelated Parallel Machines Problem




    Publication date :

    2009-09-01


    Size :

    528110 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    BicriteriaHeuristic for Unrelated Parallel Machine Scheduling Problem

    Lin, Y.K. / Lin, H.C. | British Library Conference Proceedings | 2014


    Hybrid Simulated Annealing Algorithm for School Timetabling Problem

    Zengzhi, L. / Yunlan, W. / Jing, C. | British Library Online Contents | 2003


    Parallel Simulated Annealing for Shape Detection

    Bongiovanni, G. / Crescenzi, P. / Guerra, C. | British Library Online Contents | 1995


    Parallel Simulated Annealing Using Simplex Method

    Luo, Ya-Zhong / Tang, Guo-Jin | AIAA | 2004