Minimizing the maximum flow time in the online food delivery problem (Q6130315): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds and Heuristics for Capacitated Routing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dial a Ride from <i>k</i> -forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling with multi‐state machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line single-server dial-a-ride problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2728857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411288 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcast scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The online food delivery problem on stars / rank
 
Normal rank
Property / cites work
 
Property / cites work: A (slightly) improved approximation algorithm for metric TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the approximation ratio for capacitated vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PTAS for the Euclidean Capacitated Vehicle Routing Problem in $$R^d$$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated Vehicle Routing on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Makespan Multi-vehicle Dial-a-Ride / rank
 
Normal rank
Property / cites work
 
Property / cites work: News from the online traveling repairman. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of Preemptive Finite Capacity Dial-a-Ride / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCHEDULING TO MINIMIZE MAX FLOW TIME: OFF-LINE AND ON-LINE ALGORITHMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2830868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speed is as powerful as clairvoyance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526977 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal on-line flow time with resource augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Framework for Non-Preemptive Scheduling Problems on Multiple Machines [Extended Abstract] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Non-preemptive Scheduling in a Resource Augmentation Model based on Duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rejecting jobs to Minimize Load and Maximum Flow-time / rank
 
Normal rank

Latest revision as of 19:01, 29 August 2024

scientific article; zbMATH DE number 7826808
Language Label Description Also known as
English
Minimizing the maximum flow time in the online food delivery problem
scientific article; zbMATH DE number 7826808

    Statements

    Minimizing the maximum flow time in the online food delivery problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    2 April 2024
    0 references
    online algorithm
    0 references
    capacitated vehicle routing
    0 references
    flow time optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers