6 search results - page 1 / 2 » Preemptive Scheduling of Equal-Length Jobs to Maximize Weigh... |
CORR
2002
Springer
13 years 10 months ago
2002
Springer
MICS
2010
13 years 9 months ago
2010
We study the preemptive scheduling problem of a set of n jobs with release times and equal processing times on a single machine. The objective is to minimize the sum of the weighte...
COR
2011
13 years 5 months ago
2011
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...
GECON
2008
Springer
14 years 2 days ago
2008
Springer
Abstract. In distributed computer networks where resources are under decentralized control, selfish users will generally not work towards one common goal, such as maximizing the o...
CAMAD
2006
IEEE
14 years 2 months ago
2006
IEEE
Switched Processing Systems (SPS) capture the essence of a fundamental resource allocation problem in many modern communication, computer and manufacturing systems involving hetero...