Sciweavers

720 search results - page 89 / 144
» Machine scheduling with resource dependent processing times
Sort
View
139
Voted
EUROMICRO
2000
IEEE
15 years 8 months ago
Task Assignment and Scheduling under Memory Constraints
Many DSP and image processing embedded systems have hard memory constraints which makes it difficult to find a good task assignment and scheduling which fulfill these constrain...
Radoslaw Szymanek, Krzysztof Kuchcinski
CORR
2008
Springer
116views Education» more  CORR 2008»
15 years 4 months ago
Optimal Scheduling of File Transfers with Divisible Sizes on Multiple Disjoint Paths
In this paper I investigate several offline and online data transfer scheduling problems and propose efficient algorithms and techniques for addressing them. In the offline case, ...
Mugurel Ionut Andreica
GECCO
2004
Springer
166views Optimization» more  GECCO 2004»
15 years 9 months ago
An Effective Chromosome Representation for Evolving Flexible Job Shop Schedules
As the Flexible Job Shop Scheduling Problem (or FJSP) is strongly NP-hard, using an evolutionary approach to find near-optimal solutions requires effective chromosome representatio...
Joc Cing Tay, Djoko Wibowo
CONCUR
1994
Springer
15 years 8 months ago
Weak Sequential Composition in Process Algebras
Abstract. In this paper we study a special operator for sequential composition, which is de ned relative to a dependency relation over the actions of a given system. The idea is th...
Arend Rensink, Heike Wehrheim
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
15 years 8 months ago
Preemptive Online Scheduling with Reordering
We consider online preemptive scheduling of jobs, arriving one by one, on m identical parallel machines. A buffer of a fixed size K > 0, which assists in partial reordering of...
György Dósa, Leah Epstein