Sciweavers

139 search results - page 16 / 28
» Scheduling equal-length jobs on identical parallel machines
Sort
View
ICMAS
1998
14 years 11 months ago
Multi-Machine Scheduling - A Multi-Agent Learning Approach
Multi-machine scheduling, that is, the assigment of jobs to machines such that certain performance demands like cost and time effectiveness are fulfilled, is a ubiquitous and comp...
Wilfried Brauer, Gerhard Weiß
MP
2007
145views more  MP 2007»
14 years 9 months ago
Machine scheduling with resource dependent processing times
We consider machine scheduling on unrelated parallel machines with the objective to minimize the schedule makespan. We assume that, in addition to its machine dependence, the proce...
Alexander Grigoriev, Maxim Sviridenko, Marc Uetz
JSSPP
2004
Springer
15 years 3 months ago
Scheduling on the Top 50 Machines
The well-known TOP500 list ranks the 500 most powerful high-performance computers. However, the list lacks details about the job management and scheduling on these machines. As thi...
Carsten Ernemann, Martin Krogmann, Joachim Lepping...
IPL
2008
103views more  IPL 2008»
14 years 10 months ago
New efficiency results for makespan cost sharing
In the context of scheduling, we study social cost efficiency for a cost-sharing problem in which the service provider's cost is determined by the makespan of the served agen...
Yvonne Bleischwitz, Florian Schoppmann
IFIPTCS
2010
14 years 7 months ago
Approximating the Non-contiguous Multiple Organization Packing Problem
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...
Marin Bougeret, Pierre-François Dutot, Klau...