Sciweavers

720 search results - page 32 / 144
» Machine scheduling with resource dependent processing times
Sort
View
COCOA
2008
Springer
15 years 1 months ago
Stochastic Online Scheduling Revisited
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
Andreas S. Schulz
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
15 years 5 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki
IOR
2010
161views more  IOR 2010»
14 years 10 months ago
Mechanism Design for Decentralized Online Machine Scheduling
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from the perspective of algorithmic mechanism desig...
Birgit Heydenreich, Rudolf Müller, Marc Uetz
CSCLP
2006
Springer
15 years 3 months ago
A Constraint Model for State Transitions in Disjunctive Resources
Abstract. Traditional resources in scheduling are simple machines where a capacity is the main restriction. However, in practice there frequently appear resources with more complex...
Roman Barták, Ondrej Cepek
EENERGY
2010
15 years 3 months ago
Towards energy-aware scheduling in data centers using machine learning
As energy-related costs have become a major economical factor for IT infrastructures and data-centers, companies and the research community are being challenged to find better an...
Josep Lluis Berral, Iñigo Goiri, Ramon Nou,...