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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Improved Simulated Annealing Algorithm Used for Job Shop Scheduling Problems


    Additional title:

    Adv.Intel.,Soft Computing


    Contributors:
    Xie, Anne (editor) / Huang, Xiong (editor) / Song, Shao-zhong (author) / Ren, Jia-jun (author) / Fan, Jia-xu (author)


    Publication date :

    2012-01-01


    Size :

    9 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




    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


    Scheduling cut blocks with simulated annealing

    Nelson, J. / Liu, G. | British Library Conference Proceedings | 1994