Optimization costs of the single-machine scheduling problem with maintenance activities by using genetic algorithm

Esmaeili, M.

Abstract: This paper deals with a single-machine scheduling problem with maintenance activities. Our purpose is to provide a near optimal solution using metaheuristics approach. In this problem, there are n jobs and m machines (m?n), each job must be assigned to one and only one machine, where the processing time of job (j) is (p_j). Furthermore there are M_G groups where each group has a fix periodic interval T and for each group, the maximum number of jobs processed in the machines available time interval (T) is K, (M_G=m/K). For finding the near optimal solution, we consider optimizing total cost scheduling problem. This problem has two types of costs, group cost and gap cost. In this study, first, proposed problem is formulated in a mathematical model. Next, a heuristic genetic algorithm is used to obtain the proposed problem and on example is presented to verify the efficiency of the algorithm.

How to cite this paper

        APA: Esmaeili, M. (2012). Optimization costs of the single-machine scheduling problem with maintenance activities by using genetic algorithm. Management Science Letters, 2(2), 673-680.
    

        Chicago/Turabian: Esmaeili, M. 2012. "Optimization costs of the single-machine scheduling problem with maintenance activities by using genetic algorithm." Management Science Letters 2, no. 2 (2012): 673-680.
    

        AMA: Esmaeili, M. Optimization costs of the single-machine scheduling problem with maintenance activities by using genetic algorithm. Management Science Letters. 2012;2(2):673-680.
    

References

Chen, W. J. (2006). Minimizing total flow time in the single-machine scheduling problem with periodic maintenance. Journal of the Operational Research Society. 57: 410–415.

Chen, W. J. (2009). Minimizing number of tardy jobs on a single machine subject to periodic maintenance, Omega, 37, 591–599.

Chang, P. C., Chen, S. H., & Fan, C. Y. (2009). A hybrid electromagnetism-like algorithm for single machine scheduling problem. Expert Systems with Applications 36, 1259–1267.

Hsu, C. J., Low., C. & Su, C. T. (2010). A single-machine scheduling problem with maintenance activities to minimize makespan. Applied Mathematics and Computation, 215, 3929-3935.

Low. C., Hsu, C. J., & Su, C. T. (2010). A modified particle swarm optimization algorithm for a single-machine scheduling problem with periodic maintenance. Expert Systems with Applications 37, 6429-6434.

Pinedo. M. (2002). Scheduling, Theory, Algorithms, and Systems, Prentice-Hall, New Jersey.

Sbihi, M., & Varnier, C. (2008). Single-machine scheduling with periodic and flexible periodic maintenance to minimize maximum tardiness. Computers and industrial Engineering, 55, 830–840.

Shasavari Pour, N., Esmaeili., M., & Esmaeili, R. (2011). Optimization of fuzzy multi-company workers assignment problem with penalty using genetic algorithm. Journal on Computer Science and Engineering, 3, 3148-3160.

Shasavari Pour, N., Modarres, M., Tavakkoli-Moghaddam, R., & Najafi, E. (2010). Optimizing a multi-objective time-cost-quality trade-off problem by a new hybrid genetic algorithm. Word Applied Journal 10(3), 335-363.