Utility functions can be used to represent the value users attach to job completion as a function of turnaround time. Most previous scheduling research used simple synthetic representations of utility, with the simplicity being due to the fact that real user preferences are difficult to obtain, and perhaps concern that arbitrarily complex utility functions could in turn make the scheduling problem intractable. In this work, we advocate a flexible representation of utility functions that can indeed be arbitrarily complex. We show that a genetic algorithm heuristic can improve global utility by analyzing these functions, and does so tractably. Since our previous work showed that users indeed have and can articulate complicated utility functio...
The evaluation of iterative schedulers like genetic algorithms depends on different criteria like ta...
In Job Shop Scheduling (JSS) problems, there are usually many conflicting objectives to consider, su...
Thio thesis investigates the use of genetic algorithms (GAs) for solving a range of timetabling and...
To effectively manage High-Performance Computing (HPC) resources, it is essential to maximize return...
Scheduling problems arise whenever there is a choice of order in which a number of tasks should be p...
This paper discusses the issues that arise in the design and implementation of an industrial-strengt...
The general job-shop scheduling problem is known to be extremely hard. We describe a GA approach whi...
Abstract. This paper describes techniques that can be applied to large-scale real-life employee time...
We address a complex scheduling problem arising in the wood panel industry with the objective of min...
Colloque avec actes et comité de lecture. internationale.International audienceThe objective of this...
In every system, where the resources to be allocated to a given set of tasks are limited, one is f...
Abstract Practical constraints associated with real-world problems are a key differentiator with res...
Practical constraints associated with real-world problems are a key differentiator with respect to m...
Designing effective scheduling rules or heuristics for a manufacturing system such as job shops is n...
© 2019, Springer International Publishing AG, part of Springer Nature. Designing effective schedulin...
The evaluation of iterative schedulers like genetic algorithms depends on different criteria like ta...
In Job Shop Scheduling (JSS) problems, there are usually many conflicting objectives to consider, su...
Thio thesis investigates the use of genetic algorithms (GAs) for solving a range of timetabling and...
To effectively manage High-Performance Computing (HPC) resources, it is essential to maximize return...
Scheduling problems arise whenever there is a choice of order in which a number of tasks should be p...
This paper discusses the issues that arise in the design and implementation of an industrial-strengt...
The general job-shop scheduling problem is known to be extremely hard. We describe a GA approach whi...
Abstract. This paper describes techniques that can be applied to large-scale real-life employee time...
We address a complex scheduling problem arising in the wood panel industry with the objective of min...
Colloque avec actes et comité de lecture. internationale.International audienceThe objective of this...
In every system, where the resources to be allocated to a given set of tasks are limited, one is f...
Abstract Practical constraints associated with real-world problems are a key differentiator with res...
Practical constraints associated with real-world problems are a key differentiator with respect to m...
Designing effective scheduling rules or heuristics for a manufacturing system such as job shops is n...
© 2019, Springer International Publishing AG, part of Springer Nature. Designing effective schedulin...
The evaluation of iterative schedulers like genetic algorithms depends on different criteria like ta...
In Job Shop Scheduling (JSS) problems, there are usually many conflicting objectives to consider, su...
Thio thesis investigates the use of genetic algorithms (GAs) for solving a range of timetabling and...