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...
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...
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...
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...
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...