Abstract
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.
Highlights
Introduction and Literature ReviewIn most scheduling problems, it is assumed that the machine is continuously and uninterruptedly available
In this paper the scheduling problem is mathematically formulated subject to the amount of time the machine is available between the two consecutive periods, at the end of which the maintenance process is implemented and the maximum number of jobs which could be processed by the machine over the operating time
A single machine scheduling problem is considered with two alternative strategies: (1) implementing the maintenance process after a predetermined time period and (2) the maximum number of jobs that can be done during this period in order to change the tool
Summary
It is assumed that the machine is continuously and uninterruptedly available. Low et al [16, 17] surveyed the problem of single machine scheduling considering two alternative strategies, namely, machine unavailability after a fixed time period and after processing a specific number of jobs to change the tool. They considered minimization of the makespan as their objective. For solving the single machine scheduling problem, fixed time between two consecutive maintenance operations, and maximum number of jobs that can be done during this period due to the change of the tool, a dynamic genetic algorithm is proposed. Conclusions and some guidelines for future study are presented in the last part of this paper
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
