A branch-and-price algorithm for the aperiodic multi-period service scheduling problem
From MaRDI portal
Publication:1694820
DOI10.1016/j.ejor.2017.06.008zbMath1380.90114OpenAlexW2625172848MaRDI QIDQ1694820
Elena Fernández, Jörg Kalcsics, Cristina Núñez-del-Toro
Publication date: 6 February 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/114681
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Related Items (1)
Cites Work
- Unnamed Item
- Scheduling policies for multi-period services
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- Using aggregation to reduce response time variability in cyclic fair sequences
- Branching in branch-and-price: A generic scheme
- A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
- Periodic assignment and graph colouring
- The scheduling of maintenance service
- Vehicle minimization for periodic deliveries
- Windows scheduling of arbitrary-length jobs on multiple machines
- Modeling and solving the periodic maintenance problem
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm
- Airline Crew Scheduling: A New Formulation and Decomposition Algorithm
- Distance-constrained scheduling and its applications to real-time systems
- Windows Scheduling Problems for Broadcast Systems
- Minimizing Service and Operation Costs of Periodic Scheduling
This page was built for publication: A branch-and-price algorithm for the aperiodic multi-period service scheduling problem
