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

Authors:
Joaquín Pacheco;Francisco Ángel-Bello;Ada Álvarez
Affiliations:
Universidad de Burgos, Burgos, Spain 09001;Instituto Tecnológico de Estudios Superiores de Monterrey, Monterrey, México;Universidad Autónoma de Nuevo León, San Nicolás de los Garza, México
Venue:
Journal of Scheduling
Year:
2013

Citing 9
Cited 0

Single machine flow-time scheduling with scheduled maintenance

Acta Informatica
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 heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study a problem of sequencing jobs in a machine with programmed preventive maintenance and sequence-dependent set-up times. The problem combines two NP-hard problems, so we propose a heuristic method for solving it, which hybridizes multi-start strategies with Tabu Search. We compare our method with the only published metaheuristic algorithm for this problem on a set of 420 instances. The comparison favors the method developed in this work, showing that is able to find high quality solutions in very short computational times.