In dealing with shop scheduling, by optimizing solver to improve the simulated annealing algorithm, it can be solved quickly and effectively. The stability of the mean completion time and the output of optimal completion time were compared with other simulated annealing algorithm.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Improved Simulated Annealing Algorithm Used for Job Shop Scheduling Problems


    Weitere Titelangaben:

    Adv.Intel.,Soft Computing


    Beteiligte:
    Xie, Anne (Herausgeber:in) / Huang, Xiong (Herausgeber:in) / Song, Shao-zhong (Autor:in) / Ren, Jia-jun (Autor:in) / Fan, Jia-xu (Autor:in)


    Erscheinungsdatum :

    01.01.2012


    Format / Umfang :

    9 pages





    Medientyp :

    Aufsatz/Kapitel (Buch)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Simulated Annealing Algorithm for Berth Allocation Problems

    Line, Shih-Wei / Ting, Ching-Jung | Springer Verlag | 2013


    Optimization Vehicle Scheduling Based on Simulated Annealing Genetic Algorithm

    Xia, Ying ;Yi, Cheng | Trans Tech Publications | 2014


    Berth scheduling by simulated annealing

    Kim, Kap Hwan | Online Contents | 2003


    Berth scheduling by simulated annealing

    Kim, Kap Hwan / Moon, Kyung Chan | Elsevier | 2002


    An Ant Colony Optimization Algorithm for Shop Scheduling Problems

    Blum, C. / Sampels, M. | British Library Online Contents | 2004