NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract
From MaRDI portal
Publication:1752828
Recommendations
- Economic lot sizing: the capacity reservation model
- The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases
- Lot-sizing with non-stationary cumulative capacities
- Multi-product lot-sizing with a transportation capacity reservation contract
- A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows
Cites work
- A mathematical model for a capacity reservation contract
- A procurement model using capacity reservation
- A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure
- Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size
- An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs
- An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure
- Capacity acquisition, subcontracting, and lot sizing
- Capacity reservation contracts for high-tech industry
- Capacity reservation under supply uncertainty
- Computational Complexity of the Capacitated Lot Size Problem
- Deterministic Production Planning: Algorithms and Complexity
- Dual sourcing using capacity reservation and spot market: optimal procurement policy and heuristic parameter determination
- Dynamic Lot Sizing with Batch Ordering and Truckload Discounts
- Dynamic version of the economic lot size model
- Economic lot sizing: the capacity reservation model
- Effective zero-inventory-ordering policies for the single-warehouse multiretailer problem with piecewise linear cost structures
- Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
- scientific article; zbMATH DE number 5076448 (Why is no real title available?)
- Lot sizing with piecewise concave production costs
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
- Multi-product lot-sizing with a transportation capacity reservation contract
- Optimal Inventory Policy with Multiple Set-Up Costs
- Polynomial cases of the economic lot sizing problem with cost discounts
- Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost
- Production Planning by Mixed Integer Programming
- Single item lot sizing problems
- Sourcing decisions with capacity reservation contracts
- The economic lot-sizing problem with an emission capacity constraint
- The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases
- Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs
Cited in
(10)- Dynamic lot-sizing models with pricing for new products
- Multi-product lot-sizing with a transportation capacity reservation contract
- Production lot-sizing with dynamic capacity adjustment
- Modeling and solving the constrained multi-items lot-sizing problem with time-varying setup cost
- The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases
- Economic lot sizing: the capacity reservation model
- Single-item lot-based supplying and batch production under a bilateral capacity reservation: a partnership structure
- Multi-period distribution networks with purchase commitment contracts
- Capacity reservation for humanitarian relief: a logic-based benders decomposition method with subgradient cut
- A modified variable neighborhood search algorithm for dynamic lot-sizing with supplier selection under varying delivery time quotation
This page was built for publication: NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1752828)
