A Dynamic Genetic Algorithm for Solving a Single Machine Scheduling Problem with Periodic Maintenance | Zendy

Amir Ebrahimy Zade | Zendy; Mohammad Bagher Fakhrzad | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Dynamic Genetic Algorithm for Solving a Single Machine Scheduling Problem with Periodic Maintenance

Author(s) -

Amir Ebrahimy Zade,

Mohammad Bagher Fakhrzad

Publication year - 2013

Publication title -

isrn industrial engineering

Language(s) - English

Resource type - Journals

ISSN - 2314-6435

DOI - 10.1155/2013/936814

Subject(s) - mathematical optimization , job shop scheduling , computer science , genetic algorithm , scheduling (production processes) , heuristic , dynamic priority scheduling , single machine scheduling , class (philosophy) , process (computing) , dynamic problem , algorithm , mathematics , artificial intelligence , schedule , operating system

The scheduling problem with nonresumable jobs and maintenance process is considered in order to minimize the makespan under two alternative strategies. The first strategy is to implement the maintenance process on the machine after a predetermined time period and the second one is to consider the maximum number of jobs that can be done with an especial tool. We propose a new mathematical formulation for the aforementioned problem which is included in the NP-Hard class of problems; in the second part of the paper, we propose a dynamic genetic algorithm so that the large- and medium-scale problems could be solvable in computationally reasonable time. Also we compare the performance of the proposed algorithm with existing methods in the literature. Experimental results showed that the proposed genetic algorithm is able to attain optimum solutions in most cases and also corroborate its better performance from the existing heuristic methods in the literature.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research