Pages that link to "Item:Q5963102"
From MaRDI portal
The following pages link to Distribution of waiting time for dynamic pickup and delivery problems (Q5963102):
Displaying 11 items.
- Stochastic bounds for order flow times in parts-to-picker warehouses with remotely located order-picking workstations (Q323430) (← links)
- A column generation approach for location-routing problems with pickup and delivery (Q1991113) (← links)
- A colored traveling salesman problem with varying city colors (Q2065425) (← links)
- Comparison of anticipatory algorithms for a dial-a-ride problem (Q2140208) (← links)
- Horizontal combinations of online and offline approximate dynamic programming for stochastic dynamic vehicle routing (Q2303337) (← links)
- Look-ahead strategies for dynamic pickup and delivery problems (Q2379663) (← links)
- A scalable anticipatory policy for the dynamic pickup and delivery problem (Q2676347) (← links)
- Acceptance and dispatching policies for a distribution problem (Q2783799) (← links)
- How does variability in input load relate to the probability of critically delayed delivery in a simple multipart re-entrant flow-line problem? (Q4671291) (← links)
- (Q5878626) (← links)
- Waiting and Buffering Strategies for the Dynamic Pickup and Delivery Problem with Time Windows (Q6160362) (← links)