This paper presents an algorithm that applies a new mechanism in order to generate scheduling which allows for evaluation of the quality of solutions that are obtained in the Job Shop Scheduling Problem (JSSP). In this research, the quality of the solution is evaluated by using the makespan as an objective function. It is demonstrated experimentally that the proposed algorithm has better efficiency and efficacy when compared to the classic form of scheduling generation used to evaluate the quality of the solution in the JSSP. The efficiency and efficacy obtained by the proposed algorithm make it possible to generate and evaluate a greater number of better quality solutions in less time, so a greater exploration of the solution space for the JSSP can be conducted.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Scheduling Algorithm for the Job Shop Scheduling Problem




    Publication date :

    2007-09-01


    Size :

    422614 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Hybrid multiagent genetic algorithm for job shop scheduling problem

    Li, Xiaotao / Peng, Chong | British Library Online Contents | 2017



    A Genetic Algorithm for Job-shop Scheduling Problem with Alternative Machine

    Bai, Y. / Shang, W.-l. / Wang, C.-e. | British Library Online Contents | 2004


    Artificial Immune Algorithm for Flow-Shop Scheduling

    Ziqiang, W. / Boqin, F. | British Library Online Contents | 2004