160 search results - page 8 / 32 » A General Buffer Scheme for the Windows Scheduling Problem |
154
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
This paper presents a hybrid technique that combines List Scheduling (LS) with Genetic Algorithms (GA) for constructing non-preemptive schedules for soft real-time parallel applic...
164
click to vote
EVOW
2006
Springer
15 years 9 months ago
2006
Springer
In this paper we investigate and compare multi-objective and weighted single objective approaches to a real world workforce scheduling problem. For this difficult problem we consid...
191
click to vote
ESA
1999
Springer
15 years 10 months ago
1999
Springer
We give a polynomial approximation scheme for the problem of scheduling on uniformly related parallel machines for a large class of objective functions that depend only on the mac...
195
click to vote
KR
1992
Springer
15 years 10 months ago
1992
Springer
This paper studies a version of the job shop scheduling problem in which some operations have to be scheduled within non-relaxable time windows i.e. earliest latest possible start...
162
click to vote
ICDCS
2002
IEEE
15 years 10 months ago
2002
IEEE
Process migration has been used to perform specialized tasks, such as load sharing and checkpoint/restarting long running applications. Implementation typically consists of modifi...