Sciweavers

1125 search results - page 53 / 225
» On the job rotation problem
Sort
View
AMC
2008
67views more  AMC 2008»
13 years 10 months ago
A nonconforming covolume method for elliptic problems
We consider a control volume(covolume) method for second order elliptic PDEs with the rotated-Q1 nonconforming finite element on rectangular grids. The coefficient may a variable,...
Yun K. Hyon, Ho J. Jang, Do Y. Kwak
CP
2009
Springer
14 years 4 months ago
Closing the Open Shop: Contradicting Conventional Wisdom
This paper describes a new approach for solving disjunctive temporal problems such as the open shop and job shop scheduling domains. Much previous research in systematic search app...
Diarmuid Grimes, Emmanuel Hebrard, Arnaud Malapert
DAGSTUHL
2006
13 years 11 months ago
Decentralization and Mechanism Design for Online Machine Scheduling
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from a new perspective: We assume that the data of ...
Birgit Heydenreich, Rudolf Müller, Marc Uetz
IPPS
2000
IEEE
14 years 2 months ago
Gang Scheduling with Memory Considerations
A major problem with time slicing on parallel machines is memory pressure, as the resulting paging activity damages the synchronism among a job’s processes. An alternative is to...
Anat Batat, Dror G. Feitelson
EUROGP
2006
Springer
135views Optimization» more  EUROGP 2006»
14 years 1 months ago
Dynamic Scheduling with Genetic Programming
This paper investigates the use of genetic programming in automatized synthesis of scheduling heuristics. The applied scheduling technique is priority scheduling, where the next st...
Domagoj Jakobovic, Leo Budin