Citation
Scheduling two agents on uniform parallel machines with makespan and cost functions. Journal of Scheduling, 14 (5): 471-481, 2011.
Selected
Abstract
We consider the problem of scheduling two jobs A and B on a set of m uniform parallel machines. Each job is assumed to be independent from the other: job A and job B are made up of nA and nB operations, respectively. Each operation is defined by its processing time and possibly additional data such as a due date, a weight, etc., and must be processed on a single machine. All machines are uniform, i.e. each machine has its own processing speed. Notice that we consider the special case of equal-size operations, i.e. all operations have the same processing time. The scheduling of operations of job A must be achieved to minimize a general cost function FA, whereas it is the makespan that must be minimized when scheduling the operations of job B. These kind of problems are called multiple agent scheduling problems. As we are dealing with two conflicting criteria, we focus on the calculation of strict Pareto optima for FA and CB max criteria. In this paper we consider different min-max and min-sum versions of function FA and provide special properties as well as polynomial time algorithms.
There is no pdf available for this paper. You might like to try to obtain the original source (see the doi, for example)
doi
The doi for this publication is 10.1007/s10951-010-0201-1 You can link directly to the original paper, via the doi, from here
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
@ARTICLE{2011-471-481-SI, author = {D. Elvikis and H. W. Hamacher and V. T’kindt},
title = {Scheduling two agents on uniform parallel machines with makespan and cost functions},
journal = {Journal of Scheduling},
year = {2011},
volume = {14},
pages = {471--481},
number = {5},
note = {Selected},
abstract = {We consider the problem of scheduling two jobs A and B on a set of m uniform parallel machines. Each job is assumed to be independent from the other: job A and job B are made up of nA and nB operations, respectively. Each operation is defined by its processing time and possibly additional data such as a due date, a weight, etc., and must be processed on a single machine. All machines are uniform, i.e. each machine has its own processing speed. Notice that we consider the special case of equal-size operations, i.e. all operations have the same processing time. The scheduling of operations of job A must be achieved to minimize a general cost function FA, whereas it is the makespan that must be minimized when scheduling the operations of job B. These kind of problems are called multiple agent scheduling problems. As we are dealing with two conflicting criteria, we focus on the calculation of strict Pareto optima for FA and CB max criteria. In this paper we consider different min-max and min-sum versions of function FA and provide special properties as well as polynomial time algorithms.},
doi = {10.1007/s10951-010-0201-1},
owner = {user},
timestamp = {2012.05.25} }