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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Scheduling Algorithm for the Job Shop Scheduling Problem




    Erscheinungsdatum :

    2007-09-01


    Format / Umfang :

    422614 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    A two-level particle swarm optimisation algorithm for open-shop scheduling problem

    Pongchairerks, Pisut / Kachitvichyanukul, Voratas | British Library Online Contents | 2016


    Two-Layer Harmony Search Algorithm for a Robust Flow Shop Scheduling Problem

    Wu, Bo / Wang, Bing / Han, Xingbao | Springer Verlag | 2017


    A New Solution Seed for Job Shop Scheduling Problem

    Fattahi, P. / Manesh, M.S. / Roshani, A. | British Library Conference Proceedings | 2012


    An Ant Colony Optimization Algorithm for Shop Scheduling Problems

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