Citation
Heuristic Methods for Single Machine Scheduling with Periodic Maintenance. In proceedings of the 7th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2015), 25 - 28 Aug 2015, Prague, Czech Republic, pages 473-483, 2015.
Paper
Abstract
In this paper we address the problem of scheduling jobs taking into account the existence of cyclical unavailability periods where no operation can be performed, a problem which is usually denoted in the literature as scheduling with periodic maintenance. More speci?cally, our research is focused onto the single machine scheduling problem with periodic maintenance and makespan minimisation as objective. This NP-hard problem has been studied previously in the literature and, although several approximate procedures have been proposed, no computational evaluation among them has been carried out. We conduct an exhaustive computational evaluation of the stateof-the-art heuristics, and propose a new heuristic for the problem that outperforms the existing ones both in terms of the quality of the solutions obtained and in the CPU time requirements.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2015-473-483-P, author = {P. Perez-Gonzalez and M. Dios and V. Fernandez-Viagas and J. M. Framinan},
title = {Heuristic Methods for Single Machine Scheduling with Periodic Maintenance},
booktitle = {In proceedings of the 7th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2015), 25 - 28 Aug 2015, Prague, Czech Republic},
year = {2015},
editor = {Z. Hanzalek and G. Kendall and B. McCollum and P. Sucha},
pages = {473--483},
note = {Paper},
abstract = {In this paper we address the problem of scheduling jobs taking into account the existence of cyclical unavailability periods where no operation can be performed, a problem which is usually denoted in the literature as scheduling with periodic maintenance. More speci?cally, our research is focused onto the single machine scheduling problem with periodic maintenance and makespan minimisation as objective. This NP-hard problem has been studied previously in the literature and, although several approximate procedures have been proposed, no computational evaluation among them has been carried out. We conduct an exhaustive computational evaluation of the stateof-the-art heuristics, and propose a new heuristic for the problem that outperforms the existing ones both in terms of the quality of the solutions obtained and in the CPU time requirements.},
owner = {Graham},
timestamp = {2017.01.16},
webpdf = {2015-473-483-P.pdf} }