Finding optimal tour schedules on transportation paths under extended time window constraints
From MaRDI portal
Publication:341462
DOI10.1007/s10951-016-0481-1zbMath1353.90056MaRDI QIDQ341462
Publication date: 16 November 2016
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-016-0481-1
branch-and-bound; complexity analysis; extended release date restrictions; line-TRP with extended time windows; optimal tours on given transportation paths
90B06: Transportation, logistics and supply chain management
90B35: Deterministic scheduling theory in operations research
90C39: Dynamic programming
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Optimally solving a versatile traveling salesman problem on tree networks with soft due dates and multiple congestion scenarios, Scenario analysis-based decision and coordination in supply chain management with production and transportation scheduling, Combining traveling salesman and traveling repairman problems: a multi-objective approach based on multiple scenarios
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Solving the traveling repairman problem on a line with general processing times and deadlines
- Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions
- Optimally routing and scheduling tow trains for JIT-supply of mixed-model assembly lines
- Part logistics in the automotive industry: decision problems, literature review and research agenda
- Real-time control of freight forwarder transportation networks by integrating multimodal transport chains
- Ship routing and scheduling in the new millennium
- Diversion Issues in Real-Time Vehicle Dispatching
- Computer-Aided Complexity Classification of Dial-a-Ride Problems
- Routing and Scheduling on a Shoreline with Release Times
- The complexity of the travelling repairman problem
- Special cases of traveling salesman and repairman problems with time windows
- On the Complexity of Scheduling with Batch Setup Times
- Vehicle routing problems with regular objective functions on a path
- A note on the traveling repairman problem
- Scheduling
