A Tabu-Search Hyperheuristic for Timetabling and Rostering
Journal of Heuristics
An indirect genetic algorithm for a nurse-scheduling problem
Computers and Operations Research
The State of the Art of Nurse Rostering
Journal of Scheduling
A 0-1 goal programming model for nurse scheduling
Computers and Operations Research
Generating labor requirements and rosters for mail handlers using simulation and optimization
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
An integrated aircraft routing, crew scheduling and flight retiming model
Computers and Operations Research
Scheduling malleable tasks with interdependent processing rates: Comments and observations
Discrete Applied Mathematics
Computers and Operations Research
An iterative approach to robust and integrated aircraft routing and crew scheduling
Computers and Operations Research
Hi-index | 0.01 |
This paper studies the problem of constructing the workforce schedules of an aircraft maintenance company. The problem involves both a staffing and a scheduling decision. We propose an enumerative algorithm with bounding in which each node of the enumeration tree represents a mixed integer linear problem (MILP). We reformulate the MILP such that it becomes tractable for commercial MILP solvers. Extensive computational tests on 40 instances that are derived from a real-life setting indicate that the algorithm is capable of finding close-to-optimal solutions.