Scheduling policies for multi-period services
From MaRDI portal
Publication:322771
DOI10.1016/J.EJOR.2015.12.002zbMATH Open1346.90377OpenAlexW2248740866MaRDI QIDQ322771FDOQ322771
Authors: Cristina Núñez-del-Toro, Elena Fernández, Jörg Kalcsics, S. Nickel
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/96175
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
Queues and service in operations research (90B22) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Cites Work
- Periodic assignment and graph colouring
- Forty years of periodic vehicle routing
- Analysis of Direct Shipping Policies in an Inventory-Routing Problem with Discrete Shipping Times
- On the Effectiveness of Direct Shipping Strategy for the One-Warehouse Multi-Retailer R-Systems
- Combinatorial optimization and green logistics
- Modeling and solving the periodic maintenance problem
- Minimizing Service and Operation Costs of Periodic Scheduling
- Mathematical programming modeling of the response time variability problem
- The scheduling of maintenance service
- Vehicle minimization for periodic deliveries
- Windows scheduling of arbitrary-length jobs on multiple machines
- A branch and bound algorithm for the response time variability problem
- An Analysis and Solution of the Sensor Scheduling Problem
- Windows scheduling as a restricted version of bin packing
- Distance-constrained scheduling and its applications to real-time systems
- Windows Scheduling Problems for Broadcast Systems
- A parallel machine replacement model
- A novel maximum dispersion territory design model arising in the implementation of the WEEE-directive
- Using aggregation to reduce response time variability in cyclic fair sequences
Cited In (5)
- 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
- Scheduling to Differentiate Service in a Multiclass Service System
- 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)