2018-10-182018-10-18898122110.1016/j.camwa.2010.12.028http://hdl.handle.net/11285/630551In this paper we study a problem of sequencing jobs in a machine with programmed preventive maintenance and sequence-dependent setup times. To the authors' knowledge, this problem has not been treated as such in the operations research literature. Computational experiments show that it is very hard to solve the problem by exact methods. Therefore, the contribution of this paper is to design and implement a solution approach based on metaheuristic procedures. The proposed method finds high quality solutions in very short computational times. © 2010 Elsevier Ltd. All rights reserved.info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-nd/4.0Computational experimentComputational timeExact methodsHeuristic approachHigh-quality solutionsMetaheuristicMetaheuristicsPeriodic maintenanceScheduling problemSequence-dependent setupSequence-dependent setup timeSingle machine schedulingSolution approachHeuristic algorithmsHeuristic methodsMachineryProblem solvingSchedulingPreventive maintenance7 INGENIERÍA Y TECNOLOGÍAArtículo614797808