The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach

DOI10.1016/j.cor.2007.12.011zbMath1162.90450OpenAlexW2031371187MaRDI QIDQ958447

Jens Clausen, Esben Kolind, Anders Dohn

Publication date: 4 December 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2007.12.011

zbMATH Keywords

integer programmingdecompositioncolumn generationsynchronizationcrew schedulingset coveringbranching rulesbranch-and-pricevehicle routing with time windowsmanpower allocationsimultaneous execution

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Traffic problems in operations research (90B20)

Related Items (32)

Task assignment with start time-dependent processing times for personnel at check-in counters ⋮ Workforce scheduling and routing problems: literature survey and computational study ⋮ An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and synchronized visits ⋮ Rich vehicle routing problems: from a taxonomy to a definition ⋮ An efficient optimisation procedure for the workforce scheduling and routing problem: Lagrangian relaxation and iterated local search ⋮ Large neighborhood search with constraint programming for a vehicle routing problem with synchronization constraints ⋮ Home health care routing and scheduling: a review ⋮ A biased random key genetic algorithm for the field Technician scheduling problem ⋮ Optimization of the technician routing and scheduling problem for a telecommunication industry ⋮ An integrated routing and scheduling problem for home healthcare delivery with limited person-to-person contact ⋮ Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization ⋮ Selective routing problem with synchronization ⋮ The home care crew scheduling problem: preference-based visit clustering and temporal dependencies ⋮ Interrelated trips in the rural dial-a-ride problem with autonomous vehicles ⋮ An integrated solution approach for multi-objective, multi-skill workforce scheduling and routing problems ⋮ A multiperiod workforce scheduling and routing problem with dependent tasks ⋮ Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand ⋮ Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location ⋮ The Synchronized Dynamic Vehicle Dispatching Problem ⋮ Decomposition techniques with mixed integer programming and heuristics for home healthcare planning ⋮ An adaptive large neighborhood search heuristic for multi-commodity two-echelon vehicle routing problem with satellite synchronization ⋮ Branch-and-price approach for the multi-skill project scheduling problem ⋮ Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies ⋮ Real-time scheduling optimization considering the unexpected events in home health care ⋮ Branch-and-price approaches for the multiperiod technician routing and scheduling problem ⋮ Minimizing dispersion in multiple drone routing ⋮ Solving routing problems with pairwise synchronization constraints ⋮ The multiple traveling salesman problem with backup coverage ⋮ Linear formulations for the vehicle routing problem with synchronization constraints ⋮ The vehicle routing problem with time windows and temporal dependencies ⋮ The synchronized multi-assignment orienteering problem ⋮ Workforce routing and scheduling for electricity network maintenance with downtime minimization

Uses Software

• COIN-OR

Cites Work

• Unnamed Item
• Fleet assignment and routing with schedule synchronization constraints
• Vehicle routing problem with time windows and a limited number of vehicles.
• A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
• Branching rules revisited
• The split delivery vehicle scheduling problem with time windows and grid network distances
• A new branching strategy for time constrained routing problems with application to backhauling
• A branch-and-cut algorithm for the capacitated profitable tour problem
• Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
• An exact algorithm for team orienteering problems
• Vehicle routing problem with elementary shortest path based column generation
• Lagrangian duality applied to the vehicle routing problem with time windows
• 2-Path Cuts for the Vehicle Routing Problem with Time Windows
• The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Decomposition Principle for Linear Programs
• Savings by Split Delivery Routing
• An algorithm for the resource constrained shortest path problem
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• Manpower allocation with time windows and job-teaming constraints
• Manpower allocation with time windows
• Parallel Machine Scheduling Through Column Generation: Minimax Objective Functions
• Vehicle Routing Problem with Time Windows
• Branch-and-Price Heuristics: A Case Study on the Vehicle Routing Problem with Time Windows

This page was built for publication: The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach