Citation
Preemptive scheduling with precedences and alternative resources. Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland, pages 518-530, 2009.
Paper
Abstract
This paper presents a search algorithm solving an elastic scheduling problem with alternative resources, where a feasible schedule with minimal costs on resources is demanded. The proposed technique is based on detecting "problematic" precedence constraints defined between activities processed on different resources. Assignment of alternative resources is realized as an extension of the search algorithm using overload checking. Preliminary experimental results show, that the proposed technique works well for problems with a smaller number of precedence constraints.
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{2009-518-530-P, author = {V. Dusa and R. Barták},
title = {Preemptive scheduling with precedences and alternative resources},
booktitle = {Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland},
year = {2009},
editor = {J. Blazewicz and M. Drozdowski and G. Kendall and B. McCollum},
pages = {518--530},
note = {Paper},
abstract = {This paper presents a search algorithm solving an elastic scheduling problem with alternative resources, where a feasible schedule with minimal costs on resources is demanded. The proposed technique is based on detecting "problematic" precedence constraints defined between activities processed on different resources. Assignment of alternative resources is realized as an extension of the search algorithm using overload checking. Preliminary experimental results show, that the proposed technique works well for problems with a smaller number of precedence constraints.},
owner = {gxk},
timestamp = {2010.10.11},
webpdf = {2009-518-530-P.pdf} }