Minimizing the maximum flow time in the online food delivery problem

DOI10.1007/s00453-023-01177-1MaRDI QIDQ6130315

Xiangyu Guo, Yu-Hao Zhang, Shi Li, Kelin Luo

Publication date: 2 April 2024

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

online algorithmcapacitated vehicle routingflow time optimization

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• News from the online traveling repairman.
• The online food delivery problem on stars
• Optimal on-line flow time with resource augmentation
• SCHEDULING TO MINIMIZE MAX FLOW TIME: OFF-LINE AND ON-LINE ALGORITHMS
• PTAS for the Euclidean Capacitated Vehicle Routing Problem in $$R^d$$
• Broadcast scheduling
• Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
• Hardness of Preemptive Finite Capacity Dial-a-Ride
• Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling
• Minimum Makespan Multi-vehicle Dial-a-Ride
• Bounds and Heuristics for Capacitated Routing Problems
• Capacitated Vehicle Routing on Trees
• Speed is as powerful as clairvoyance
• Online Non-preemptive Scheduling in a Resource Augmentation Model based on Duality
• Online scheduling with multi‐state machines
• A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time
• A Dynamic Programming Framework for Non-Preemptive Scheduling Problems on Multiple Machines [Extended Abstract]
• Rejecting jobs to Minimize Load and Maximum Flow-time
• Approximation and Online Algorithms
• Improving the approximation ratio for capacitated vehicle routing
• On-line single-server dial-a-ride problems
• A (slightly) improved approximation algorithm for metric TSP

This page was built for publication: Minimizing the maximum flow time in the online food delivery problem