33 search results - page 2 / 7 » Cost Sharing Methods for Makespan and Completion Time Schedu... |
JSSPP
2005
Springer
15 years 3 months ago
2005
Springer
Our main goal in this paper is to study the scheduling of parallel BSP tasks on clusters of computers. We focus our attention on special characteristics of BSP tasks, which can use...
APPROX
2007
Springer
15 years 3 months ago
2007
Springer
Abstract Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a f...
64
Voted
COR
2010
14 years 9 months ago
2010
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
COR
2011
14 years 4 months ago
2011
In this paper we study the unrelated parallel machines problem where n independent jobs must be assigned to one out of m parallel machines and the processing time of each job di�...
EOR
2008
14 years 9 months ago
2008
We study the one-machine scheduling problem with release dates and we look at several objective functions including total (weighted) tardiness and total (weighted) completion time...