Results 1 -
5 of
5
Automated Shift Design and Break Scheduling
"... Abstract Shift design and break scheduling are important employee scheduling problems that arise in many contexts, especially at airports, call centers, and service industries. The aim is to find a minimum number of legal shifts, the number of workers assigned to them, and a suitable number of break ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
Abstract Shift design and break scheduling are important employee scheduling problems that arise in many contexts, especially at airports, call centers, and service industries. The aim is to find a minimum number of legal shifts, the number of workers assigned to them, and a suitable number of breaks so that the deviation from predetermined workforce requirements is minimized. Such problems have been extensively investigated in Operations Research and recently have been also tackled with Artificial Intelligence techniques. In this chapter we outline major characteristics of these problems and provide a literature survey over solution techniques to solve them. We then describe in detail two state-of-the-art approaches based on local search techniques. Finally, we discuss our experiences with the application of one of these techniques in a real life case study. 1
Database and Artificial Intelligence Group (184/2)
, 2006
"... In the area of computer science heuristics are very important when it comes to solving NP hard problems. Though they neither provide an accurate method of finding a solution nor a provable approximation like Approximation algorithms, they nevertheless find reasonable good solutions to NP hard proble ..."
Abstract
- Add to MetaCart
(Show Context)
In the area of computer science heuristics are very important when it comes to solving NP hard problems. Though they neither provide an accurate method of finding a solution nor a provable approximation like Approximation algorithms, they nevertheless find reasonable good solutions to NP hard problems usually while consuming a reasonable amount of computation time and memory. A well known class of Heuristic methods are Local Search techniques. Those techniques focus on starting with a solution, creating a neighbourhood for the solution by applying small changes to the solution, evaluating the solutions of the neighbourhood and choosing a solution of the neighbourhood for the next iteration. The algorithm terminates when the termination condition is fulfilled. Whenever a problem is solved with Tabu Search in a program the structural and algorithmic definitions of Tabu Search have to be implemented. A solution to avoid reimplementing Tabu Search again and again, is to create a framework providing a basic design for Tabu Search. To remove the cumbersome process of
S2-36–1 Constructing Cyclic Staff Schedules by Iterated Local Search
"... Construction of cyclic staff schedules is of high practical relevance in a broad range of workplaces. Typically, such schedules must fulfill different hard constraints regarding the workforce requirements, sequences of shifts, and length of work and days-off blocks. We investigate the application of ..."
Abstract
- Add to MetaCart
(Show Context)
Construction of cyclic staff schedules is of high practical relevance in a broad range of workplaces. Typically, such schedules must fulfill different hard constraints regarding the workforce requirements, sequences of shifts, and length of work and days-off blocks. We investigate the application of iterated local search to solve this problem. The current version of our algorithm has been experimentally evaluated on a set of benchmark instances from the literature. 1
MISTA 2013 Scheduling of electric vehicle charging operations
"... Abstract In this work we address the optimization problem related to the recharge of electric vehicles, in which parking place availability, parking duration and available power constraints have to be satisfied. We formulate this problem as a resource alloca-tion problem (with time windows) and solv ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract In this work we address the optimization problem related to the recharge of electric vehicles, in which parking place availability, parking duration and available power constraints have to be satisfied. We formulate this problem as a resource alloca-tion problem (with time windows) and solve it with exact and heuristic methods. The proposed min-conflicts based heuristic currently achieves best results for this problem. We compare experimentally our methods on randomly generated problems and show the application of the static problem to an online, real world environment. Further, we discuss the performance of the overall system and describe the remaining challenges. 1
Scheduling of electric vehicle charging operations
- MISTA
, 2013
"... In this work we address the optimization problem related to the recharge of electric vehicles, in which parking place availability, parking duration and available power constraints have to be satisfied. We formulate this problem as a resource allocation problem (with time windows) and solve it with ..."
Abstract
- Add to MetaCart
In this work we address the optimization problem related to the recharge of electric vehicles, in which parking place availability, parking duration and available power constraints have to be satisfied. We formulate this problem as a resource allocation problem (with time windows) and solve it with exact and heuristic methods. The results obtained with a min-conflicts heuristic are promising. Further, we apply the static problem to an online, real world environment, and shortly discuss additional challenges and the performance of the overall system.
