Single courier single restaurant meal delivery (without routing)

DOI10.1016/J.ORL.2019.09.007zbMATH Open1476.90113OpenAlexW2974354159MaRDI QIDQ2294375FDOQ2294375

Authors: Matteo Cosmi, Gianpaolo Oriolo, P. Ventura, Veronica Piccialli 

Publication date: 10 February 2020

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2019.09.007

Recommendations

• Dynamic courier routing for a food delivery service
• Optimizing time slot allocation in single operator home delivery problems
• An optimization approach for communal home meal delivery service: A case study
• Aggregating courier deliveries
• Complexity of routing problems with release dates and deadlines

zbMATH Keywords

parametrized complexitysingle machine sequencingfood delivery

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Transportation, logistics and supply chain management (90B06)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack
• Dynamic courier routing for a food delivery service

Cited In (8)

• An optimization approach for communal home meal delivery service: A case study
• Dynamic courier routing for a food delivery service
• Optimizing time slot allocation in single operator home delivery problems
• An approximation of the customer waiting time for online restaurants owning delivery system
• Consolidating home meal delivery with limited operational disruption
• Throughput scheduling with equal additive laxity
• Throughput scheduling with equal additive laxity
• Dynamic service area sizing in urban delivery

This page was built for publication: Single courier single restaurant meal delivery (without routing)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294375)