Vehicle minimization for periodic deliveries
From MaRDI portal
Publication:1771353
DOI10.1016/J.EJOR.2003.09.036zbMath1062.90012OpenAlexW2096732213MaRDI QIDQ1771353
Ann Melissa Campbell, Jill R. Hardin
Publication date: 21 April 2005
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2003.09.036
Deterministic scheduling theory in operations research (90B35) Traffic problems in operations research (90B20) Discrete location and assignment (90B80) Complexity and performance of numerical algorithms (65Y20)
Related Items (12)
Balancing perfectly periodic service schedules: An application from recycling and waste management ⋮ Scheduling policies for multi-period services ⋮ Exact and heuristic algorithms for thrift cyclic scheduling ⋮ A branch-and-price algorithm for the aperiodic multi-period service scheduling problem ⋮ Simple strategies versus optimal schedules in multi-agent patrolling ⋮ Using aggregation to reduce response time variability in cyclic fair sequences ⋮ Windows scheduling of arbitrary-length jobs on multiple machines ⋮ Strictly periodic scheduling in IMA-based architectures ⋮ Inventory Routing ⋮ Route and fleet design for cyclic inventory routing ⋮ Forty years of periodic vehicle routing ⋮ A stochastic inventory routing problem for infectious medical waste collection
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Management of periodic demands in distribution systems
- A method for solving ship routing problems with inventory constraints
- Minimizing the number of vehicles in periodic scheduling: The non-Euclidean case
- Minimizing the number of robots to meet a given cyclic schedule
- The period routing problem
- On the Effectiveness of Direct Shipping Strategy for the One-Warehouse Multi-Retailer R-Systems
- Technical Note—Optimal Scheduling of Periodic Activities
- 98%-Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems
- Minimizing the Number of Vehicles to Meet a Fixed Periodic Schedule: An Application of Periodic Posets
- On the complexity of fixed-priority scheduling of periodic, real-time tasks
- A Heuristic for the Periodic Vehicle Routing Problem
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Performance Measures and Schedules in Periodic Job Shops
This page was built for publication: Vehicle minimization for periodic deliveries