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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Simulated Annealing Algorithm for the Weighted Unrelated Parallel Machines Problem




    Erscheinungsdatum :

    01.09.2009


    Format / Umfang :

    528110 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    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 Using Simplex Method

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


    Parallel Simulated Annealing for Shape Detection

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