Scheduling policies for multi-period services
From MaRDI portal
(Redirected from Publication:322771)
Recommendations
- A branch-and-price algorithm for the aperiodic multi-period service scheduling problem
- Periodic Scheduling with Service Constraints
- A branch-and-price algorithm for the scheduling of customer visits in the context of multi-period service territory design
- Heuristic algorithms for visiting the customers in a rolling schedule environment
- Multi-period technician scheduling with experience-based service times and stochastic customers
Cites work
- A branch and bound algorithm for the response time variability problem
- A novel maximum dispersion territory design model arising in the implementation of the WEEE-directive
- A parallel machine replacement model
- An Analysis and Solution of the Sensor Scheduling Problem
- Analysis of Direct Shipping Policies in an Inventory-Routing Problem with Discrete Shipping Times
- Combinatorial optimization and green logistics
- Distance-constrained scheduling and its applications to real-time systems
- Forty years of periodic vehicle routing
- Mathematical programming modeling of the response time variability problem
- Minimizing Service and Operation Costs of Periodic Scheduling
- Modeling and solving the periodic maintenance problem
- On the Effectiveness of Direct Shipping Strategy for the One-Warehouse Multi-Retailer R-Systems
- Periodic assignment and graph colouring
- The scheduling of maintenance service
- Using aggregation to reduce response time variability in cyclic fair sequences
- Vehicle minimization for periodic deliveries
- Windows Scheduling Problems for Broadcast Systems
- Windows scheduling as a restricted version of bin packing
- Windows scheduling of arbitrary-length jobs on multiple machines
Cited in
(5)- A branch-and-price algorithm for the scheduling of customer visits in the context of multi-period service territory design
- Scheduling to Differentiate Service in a Multiclass Service System
- Multi-period technician scheduling with experience-based service times and stochastic customers
- Heuristic algorithms for visiting the customers in a rolling schedule environment
- A branch-and-price algorithm for the aperiodic multi-period service scheduling problem
This page was built for publication: Scheduling policies for multi-period services
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322771)