2011
DOI: 10.1016/j.camwa.2010.12.028
|View full text |Cite
|
Sign up to set email alerts
|

A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times

Abstract: a b s t r a c tIn 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 qualit… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
3
0
2

Year Published

2012
2012
2022
2022

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 30 publications
(5 citation statements)
references
References 34 publications
0
3
0
2
Order By: Relevance
“…Thus, it is interesting to include the activity of preventive maintenance in a production schedule in an integrated form (Ángel-Bello et al 2011). According to Allaoui et al (2008), in the literature, there are two particularly prominent approaches with regard to the problem of integrating production and preventive maintenance.…”
Section: Integrated Production and Maintenance Schedulingmentioning
confidence: 99%
“…Thus, it is interesting to include the activity of preventive maintenance in a production schedule in an integrated form (Ángel-Bello et al 2011). According to Allaoui et al (2008), in the literature, there are two particularly prominent approaches with regard to the problem of integrating production and preventive maintenance.…”
Section: Integrated Production and Maintenance Schedulingmentioning
confidence: 99%
“…Es una técnica combinatorial que permite encontrar soluciones subóptimas de buena calidad a problemas de optimización lineales o no lineales. GRASP es una metodología que construye una solución inicial mediante una función de adaptación codiciosa o greedy aleatoriamente (Ángel-Bello et al, 2011). Posteriormente, una búsqueda local se ejecuta utilizando una solución construida como punto inicial de partida.…”
Section: Metaheurísticas Graspunclassified
“…On the other hand, focusing on scheduling papers with periodic maintenance, the problem has been studied for a single machine (see e.g. the recent papers by Angel-Bello et al, 2011;Yu et al, 2014;Yazdani et al, 2018;Perez-Gonzalez and Framinan, 2018), and for parallel machines (see e.g. Kaabi and Harrath, 2019).…”
Section: Introductionmentioning
confidence: 99%