Pages that link to "Item:Q3471809"
From MaRDI portal
The following pages link to On the Effectiveness of Direct Shipping Strategy for the One-Warehouse Multi-Retailer R-Systems (Q3471809):
Displaying 38 items.
- An iterated local search algorithm for the single-vehicle cyclic inventory routing problem (Q296579) (← links)
- Scheduling policies for multi-period services (Q322771) (← links)
- A two-phase algorithm for the cyclic inventory routing problem (Q323352) (← links)
- An optimal shipment strategy for imperfect items in a stock-out situation (Q409948) (← links)
- An asymptotic 98.5\%-effective lower bound on fixed partition policies for the inventory-routing problem (Q705496) (← links)
- Integrated production and allocation policies with one direct shipping option (Q877049) (← links)
- Coordinating production and shipment decisions in a two-stage supply chain with time-sensitive demand (Q984217) (← links)
- A practical solution approach for the cyclic inventory routing problem (Q1011170) (← links)
- Performance evaluation of distribution strategies for the inventory routing problem (Q1039784) (← links)
- Vehicle scheduling with combinable delivery and pickup operations (Q1043247) (← links)
- A genetic algorithm for service level based vehicle scheduling (Q1268204) (← links)
- Direct shipping and the dynamic single-depot/multi-retailer inventory system (Q1278988) (← links)
- The general multi-retailer EOQ problem with vehicle routing costs (Q1342645) (← links)
- The inventory-routing problem with transshipment (Q1761192) (← links)
- Vehicle minimization for periodic deliveries (Q1771353) (← links)
- Improved rounding procedures for the discrete version of the capacitated EOQ problem (Q1779529) (← links)
- An integrated inventory-transportation system with modified periodic policy for multiple products (Q1809801) (← links)
- Mixed integer linear programming model for multi-commodity multi-depot inventory routing problem (Q1947215) (← links)
- Analysis of effective sets of routes for the split-delivery periodic inventory routing problem (Q2076819) (← links)
- Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network (Q2197321) (← links)
- Industrial aspects and literature survey: Combined inventory management and routing (Q2270436) (← links)
- New mathematical model for the bi-objective inventory routing problem with a step cost function: a multi-objective particle swarm optimization solution approach (Q2293978) (← links)
- Zone skipping vs direct shipment of small orders: Integrating order processing and optimization (Q2368107) (← links)
- Replenishment routing problems between a single supplier and multiple retailers with direct delivery (Q2427186) (← links)
- Scheduling logistic activities to improve hospital supply systems (Q2433374) (← links)
- An optimization algorithm for the inventory routing problem with continuous moves (Q2468483) (← links)
- A two-echelon inventory system with transportation capacity constraint (Q2484347) (← links)
- Multi-item dynamic production-distribution planning in process industries with divergent finishing stages (Q2496061) (← links)
- An integrated inventory-routing system for multi-item joint replenishment with limited vehicle capacity (Q2569152) (← links)
- Modeling inventory routing problems in supply chains of high consumption products (Q2572875) (← links)
- Dynamic discretization discovery for solving the continuous time inventory routing problem with out-and-back routes (Q2669743) (← links)
- Analysing the effectiveness of vendor-managed inventory in a single-warehouse, multiple-retailer system (Q2798528) (← links)
- Analysis of the single-vehicle cyclic inventory routing problem (Q2935106) (← links)
- Inventory Routing (Q3564349) (← links)
- Algorithm for constructing a delivery-sequencing/inventory-allocation plan for supply chain control in the operational planning level (Q5444484) (← links)
- Modeling and improving the logistic distribution network of a hospital (Q6070410) (← links)
- Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition (Q6099459) (← links)
- How to charge while driving: scheduling point-to-point deliveries of an electric vehicle under overhead wiring (Q6102844) (← links)
