Byung Soo KimYucel OzturkogluOzturkoglu, YucelKim, Byung Soo2025-10-0620130268-37681433-301510.1007/s00170-012-4553-x2-s2.0-84888644597http://dx.doi.org/10.1007/s00170-012-4553-xhttps://gcris.yasar.edu.tr/handle/123456789/6702https://doi.org/10.1007/s00170-012-4553-xIn this paper we study a single machine scheduling problem with deteriorating processing time of jobs and multiple preventive maintenances which reset deteriorated processing time to the original processing time. In this situation we consider three kinds of problems whose performance measures are makespan total completion time and total weighted completion time. First we formulate integer programming formulations and using the formulations one can find optimal solutions for small problems. Since these problems are known to be NP-hard and the size of real problem is very large we propose a number of heuristics and design genetic algorithms for the problems. Finally we conduct some computational experiments to evaluate the performance of the proposed algorithms.Englishinfo:eu-repo/semantics/closedAccessScheduling, Preventive maintenance, Deterioration, Genetic algorithms, Discrete optimizationJOBS, MAKESPANSchedulingDiscrete OptimizationGenetic AlgorithmsDeteriorationPreventive MaintenanceArticle