Citation
Competitive Agent Scheduling with Controllable Processing Times. In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France, pages 514-522, 2007.
Paper
Abstract
We consider several competitive agent scheduling problems with controllable processing times, where two agents A and B compete for a single machine to process their jobs. The objective function for agent B is always the same, namely fmax. Several different objective functions are considered for agent A, including the total compression cost subject to deadline constraints (the imprecise computation model), the total flow time plus compression cost, the maximum tardiness plus compression cost and the maximum lateness plus compression cost. These problems have various applications in computer systems as well as in operations management. We provide NP- hardness proofs for the more general problems and polynomial time algorithms for several special cases of the problems.
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{2007-514-522-P, author = {G. Wan and J. Y.-T. Leung and M. Pinedo},
title = {Competitive Agent Scheduling with Controllable Processing Times},
booktitle = {In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France},
year = {2007},
editor = {P. Baptiste and G. Kendall and A. Munier-Kordon and F. Sourd},
pages = {514--522},
note = {Paper},
abstract = {We consider several competitive agent scheduling problems with controllable processing times, where two agents A and B compete for a single machine to process their jobs. The objective function for agent B is always the same, namely fmax. Several different objective functions are considered for agent A, including the total compression cost subject to deadline constraints (the imprecise computation model), the total flow time plus compression cost, the maximum tardiness plus compression cost and the maximum lateness plus compression cost. These problems have various applications in computer systems as well as in operations management. We provide NP- hardness proofs for the more general problems and polynomial time algorithms for several special cases of the problems.},
owner = {user},
timestamp = {2012.05.22},
webpdf = {2007-514-522-P.pdf} }