Sciweavers

1125 search results - page 62 / 225
» On the job rotation problem
Sort
View
IOR
2010
161views more  IOR 2010»
13 years 8 months ago
Mechanism Design for Decentralized Online Machine Scheduling
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from the perspective of algorithmic mechanism desig...
Birgit Heydenreich, Rudolf Müller, Marc Uetz
AUSAI
2007
Springer
14 years 4 months ago
The Detrimentality of Crossover
The traditional concept of a genetic algorithm (GA) is that of selection, crossover and mutation. However, a limited amount of data from the literature has suggested that the nich...
Andrew Czarn, Cara MacNish, Kaipillil Vijayan, Ber...
IPPS
2003
IEEE
14 years 3 months ago
The Maximal Utilization of Processor Co-Allocation in Multicluster Systems
In systems consisting of multiple clusters of processors which employ space sharing for scheduling jobs, such as our Distributed ASCI1 Supercomputer (DAS), coallocation, i.e., the...
Anca I. D. Bucur, Dick H. J. Epema
ANSS
1997
IEEE
14 years 2 months ago
Performance Issues of Task Routing and Task Scheduling with Resequencing in Homogeneous Distributed Systems
An important part of a distributed system design is the workload sharing among the processors. This includes partitioningthe arriving jobs into tasks that can be executed in paral...
Anthony Karageorgos, Helen D. Karatza
GECCO
2010
Springer
249views Optimization» more  GECCO 2010»
13 years 12 months ago
Towards improved dispatching rules for complex shop floor scenarios: a genetic programming approach
Developing dispatching rules for manufacturing systems is a tedious process, which is time- and cost-consuming. Since there is no good general rule for different scenarios and ob...
Torsten Hildebrandt, Jens Heger, Bernd Scholz-Reit...