Pages that link to "Item:Q5321740"
From MaRDI portal
The following pages link to Dynamic Lot Sizing with Batch Ordering and Truckload Discounts (Q5321740):
Displaying 30 items.
- The production routing problem: a review of formulations and solution algorithms (Q337418) (← links)
- Two-stage inventory models with a bi-modal transportation cost (Q733515) (← links)
- Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs (Q1026766) (← links)
- Dynamic lot-sizing with price changes and price-dependent holding costs (Q1303747) (← links)
- The deterministic multi-item dynamic lot size problem with joint business volume discount (Q1593544) (← links)
- The stochastic lot-sizing problem with quantity discounts (Q1652181) (← links)
- NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract (Q1752828) (← links)
- Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost (Q1758285) (← links)
- A dynamic quantity discount lot size model with resales (Q1821680) (← links)
- Production lot-sizing with dynamic capacity adjustment (Q1991128) (← links)
- Transportation mode selection in inventory models: a literature review (Q2001452) (← links)
- Multi-modal supply chain distribution problem (Q2085483) (← links)
- A dynamic lot sizing model with production-or-outsourcing decision under minimum production quantities (Q2244219) (← links)
- Optimal solutions for the economic lot-sizing problem with multiple suppliers and cost structures (Q2251740) (← links)
- On EOQ cost models with arbitrary purchase and transportation costs (Q2351281) (← links)
- The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases (Q2355864) (← links)
- Outbound shipment mode considerations for integrated inventory and delivery lot-sizing decisions (Q2467458) (← links)
- Container vessel scheduling with bi-directional flows (Q2643792) (← links)
- Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount (Q2669493) (← links)
- Solving lot-sizing problem with quantity discount and transportation cost (Q2858043) (← links)
- Applying particle swarm optimisation to dynamic lot sizing with batch ordering (Q3055436) (← links)
- Dynamic lot sizing with all‐units discount and resales (Q3120554) (← links)
- The dynamic lot size model with quantity discount (Q3351108) (← links)
- A Dynamic Lot-Size Model with Make-or-Buy Decisions (Q3818781) (← links)
- The dynamic lot size model with quantity discount: Counterexamples and correction (Q4255022) (← links)
- Improved algorithms for dynamic lot sizing problems with incremental discount (Q4646677) (← links)
- Production and Transportation Integration for Commit-to-Delivery Mode with General Shipping Costs (Q5148187) (← links)
- Single‐warehouse multi‐retailer inventory systems with full truckload shipments (Q5187943) (← links)
- Modeling industrial lot sizing problems: a review (Q5385468) (← links)
- Mathematical modelling of purchasing optimization for an MRP system with containerization constraints (Q6613956) (← links)
