Sciweavers

720 search results - page 40 / 144
» Machine scheduling with resource dependent processing times
Sort
View
CAMAD
2006
IEEE
15 years 3 months ago
Improving quality of service for switched processing systems
Switched Processing Systems (SPS) capture the essence of a fundamental resource allocation problem in many modern communication, computer and manufacturing systems involving hetero...
Ying-Chao Hung, George Michailidis
ESCIENCE
2006
IEEE
15 years 5 months ago
Using Checkpointing to Enhance Turnaround Time on Institutional Desktop Grids
In this paper, we present a checkpoint-based scheme to improve the turnaround time of bag-of-tasks applications executed on institutional desktop grids. We propose to share checkp...
Patrício Domingues, Artur Andrzejak, Lu&iac...
HEURISTICS
2002
152views more  HEURISTICS 2002»
14 years 11 months ago
A Constraint-Based Method for Project Scheduling with Time Windows
This paper presents a heuristic algorithm for solving RCPSP/max, the resource constrained project scheduling problem with generalized precedence relations. The algorithm relies, a...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
TSD
2000
Springer
15 years 3 months ago
Automatic Functor Assignment in the Prague Dependency Treebank
The aim of this paper is to describe and evaluate a system that automates a part of the transition from analytical to tectogrammatical tree structures within the Prague Dependency...
Zdenek Zabokrtský
ESA
2003
Springer
94views Algorithms» more  ESA 2003»
15 years 5 months ago
Semi-clairvoyant Scheduling
In [2] it was shown that the obvious semi-clairvoyant generalization of the Shortest Processing Time is O(1)-competitive with respect to average stretch on a single machine. In [2...
Luca Becchetti, Stefano Leonardi, Alberto Marchett...