Computers and Operations Research
Record breaking optimization results using the ruin and recreate principle
Journal of Computational Physics
Effective Heuristic Procedures for a Field Technician Scheduling Problem
Journal of Heuristics
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
A survey of very large-scale neighborhood search techniques
Discrete Applied Mathematics
A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem
Computers and Operations Research
A general heuristic for vehicle routing problems
Computers and Operations Research
Exponential neighborhood search for a parallel machine scheduling problem
Computers and Operations Research
A new approach for scheduling independent tasks with multiple modes
Journal of Heuristics
Very large-scale neighborhood search techniques in timetabling problems
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
Lower bounds for the multi-skill project scheduling problem with hierarchical levels of skills
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
An improved MIP-based approach for a multi-skill workforce scheduling problem
Journal of Scheduling
Hi-index | 0.00 |
This paper proposes a construction heuristic and an adaptive large neighborhood search heuristic for the technician and task scheduling problem arising in a large telecommunications company. This problem was solved within the framework of the 2007 challenge set up by the French Operational Research Society (ROADEF). The paper describes the authors' entry in the competition which tied for second place.