Algorithms for the multiperiod workforce scheduling and routing problem with dependent tasks
From MaRDI portal
Publication:6071082
DOI10.1111/itor.12971MaRDI QIDQ6071082
Unnamed Author, Dilson Lucas Pereira
Publication date: 27 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Cites Work
- Workforce scheduling and routing problems: literature survey and computational study
- A parallel matheuristic for the technician routing and scheduling problem
- Scheduling technicians and tasks in a telecommunications company
- Engineering stochastic local search algorithms. Designing, implementing and analyzing effective heuristics. Second international workshop, SLS 2009, Brussels, Belgium, September 3--4, 2009. Proceedings
- Scheduling of plant maintenance personnel
- The vehicle routing problem: An overview of exact and approximate algorithms
- Branch-and-price approaches for the multiperiod technician routing and scheduling problem
- Effective heuristic procedures for a field technician scheduling problem
- A concise guide to existing and emerging vehicle routing problem variants
- An integrated solution approach for multi-objective, multi-skill workforce scheduling and routing problems
- A multiperiod workforce scheduling and routing problem with dependent tasks
- Personnel scheduling: a literature review
- An improved MIP-based approach for a multi-skill workforce scheduling problem
- The Truck Dispatching Problem
- Complexity of Scheduling under Precedence Constraints
- Improving Personnel Scheduling at Airline Stations
- A Method for Solving Traveling-Salesman Problems
This page was built for publication: Algorithms for the multiperiod workforce scheduling and routing problem with dependent tasks