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

Authors:
Francisco Ángel-Bello;Ada Álvarez;Joaquín Pacheco;Iris Martínez
Affiliations:
Department of Industrial and Systems Engineering, Tecnológico de Monterrey, Campus Monterrey, Nuevo León, Mexico;Graduated Program in Systems Engineering, Universidad Autónoma de Nuevo León, San Nicolás, Nuevo León, Mexico;Department of Applied Economics, Universidad de Burgos, Burgos, Spain;Department of Industrial and Systems Engineering, Tecnológico de Monterrey, Campus Monterrey, Nuevo León, Mexico
Venue:
Computers & Mathematics with Applications
Year:
2011

Citing 9
Cited 1

Single machine flow-time scheduling with scheduled maintenance

Acta Informatica
On the distance constrained vehicle routing problem

Operations Research
Integer Programming Formulation of Traveling Salesman Problems

Journal of the ACM (JACM)
Tabu Search

Tabu Search
Single-machine scheduling with periodic maintenance and nonresumable jobs

Computers and Operations Research
Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration

Computers & Mathematics with Applications
Scheduling a maintenance activity to minimize total weighted completion-time

Computers & Mathematics with Applications
Scheduling with dependent setups and maintenance in a textile company

Computers and Industrial Engineering
The effect of machine availability on the worst-case performance of LPT

Discrete Applied Mathematics

A multi-start tabu search method for a single-machine scheduling problem with periodic maintenance and sequence-dependent set-up times

Journal of Scheduling

Quantified Score

Hi-index	0.09

Visualization

Abstract

In 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.