Sciweavers

1758 search results - page 33 / 352
» Schedule processes, not VCPUs
Sort
View
GECCO
2000
Springer
141views Optimization» more  GECCO 2000»
15 years 10 months ago
A steady-state evolutionary algorithm for the job shop problem
This paper describes an evolutionary search scheduling algorithm (ESSA) for the job shop scheduling problem (JSSP). If no specific knowledge of the problem is included in the EA t...
Patrick van Bael, Dirk Devogelaere, Marcel Rijckae...
DISOPT
2008
118views more  DISOPT 2008»
15 years 6 months ago
Approximation algorithm for minimizing total latency in machine scheduling with deliveries
We study the problem of minimizing total latency in machine scheduling with deliveries, which is defined as follows. There is a set of n jobs to be processed by a single machine a...
Asaf Levin, Michal Penn
SIGCSE
2002
ACM
207views Education» more  SIGCSE 2002»
15 years 6 months ago
Exploration of process interaction in operating systems: a pipe-fork simulator
Abstract This paper examines the use of a simulator to explore process interaction in Unix. The simulator allows instructors to trace through a variety of programs and to show how ...
Steven Robbins
ASPDAC
2005
ACM
98views Hardware» more  ASPDAC 2005»
15 years 8 months ago
Process variation robust clock tree routing
As the minimum feature sizes of VLSI circuits get smaller while the clock frequency increases, the effects of process variations become significant. We propose a UST/DME based ap...
Wai-Ching Douglas Lam, Cheng-Kok Koh
WSC
2001
15 years 8 months ago
Real-time adaptive control of multi-product multi-server bulk service processes
Batching jobs in a manufacturing system is a very common policy in most industries. Main reasons for batching are avoidance of setups and/or facilitation of material handling. Bat...
Durk-Jouke van der Zee