Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
From MaRDI portal
(Redirected from Publication:4286933)
Recommendations
- Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size
- The application of valid inequalities to the multi-stage lot-sizing problem
- Stochastic lot-sizing problem with inventory-bounds and constant order-capacities
- New valid inequalities and formulations for the static joint chance-constrained lot-sizing problem
- Economic lot sizing with constant capacities and concave inventory costs
- Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups
- Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
- Valid inequalities and separation for capacitated economic lot sizing
- Extended formulations for stochastic lot-sizing problems
- The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability
Cited in
(58)- Multi-item lot-sizing with joint set-up costs
- Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs
- Source sink flows with capacity installation in batches
- A cutting plane approach to capacitated lot-sizing with start-up costs
- Progress with single-item lot-sizing
- On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra
- Partial objective inequalities for the multi-item capacitated lot-sizing problem
- Single-item dynamic lot-sizing problems: an updated survey
- Facets for single module and multi-module capacitated lot-sizing problems without backlogging
- NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract
- Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost
- Capacitated lot-sizing problem with outsourcing
- Polyhedra for lot-sizing with Wagner-Whitin costs
- Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
- Minimising bins in transmission systems
- Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set
- Convex hull results for generalizations of the constant capacity single node flow set
- Dynamic coordination games with activation costs
- The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases
- The multi-item capacitated lot-sizing problem with setup times and shortage costs
- Lot-sizing with production and delivery time windows
- Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity
- On formulations of the stochastic uncapacitated lot-sizing problem
- Polynomial cases of the economic lot sizing problem with cost discounts
- A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
- Dantzig-Wolfe decomposition for the facility location and production planning problem
- Discrete multi-module capacitated lot-sizing problems with multiple items
- A maritime inventory routing problem: discrete time formulations and valid inequalities
- Decomposition and mean-field approach to mixed integer optimal compensation problems
- Scheduling two chains of unit jobs on one machine: a polyhedral study
- Polynomial-time solvability of dynamic lot size problems
- Constant approximation algorithm for nonuniform capacitated multi-item lot sizing via strong covering inequalities
- Stronger upper and lower bounds for a hard batching problem to feed assembly lines
- scientific article; zbMATH DE number 3924492 (Why is no real title available?)
- Relaxations for two-level multi-item lot-sizing problems
- A polyhedral study of lot-sizing with supplier selection
- Algorithms and extended formulations for one and two facility network design
- Lot sizing with minimum order quantity
- Strong-branching inequalities for convex mixed integer nonlinear programs
- Capacitated lot sizing problems with inventory bounds
- A repeated route-then-schedule approach to coordinated vehicle platooning: algorithms, valid inequalities and computation
- Multiechelon Lot Sizing: New Complexities and Inequalities
- Single-warehouse multi-retailer inventory systems with full truckload shipments
- A Lot-Sizing Problem on Trees, Related to Network Design
- Modeling industrial lot sizing problems: a review
- Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size
- New valid inequalities and formulations for the static joint chance-constrained lot-sizing problem
- Approximation algorithms for supply chain planning and logistics problems with market choice
- A split-embedded metaheuristic for the heterogeneous inventory routing problem with batch size
- Cutting planes in integer and mixed integer programming
- On lot sizing with capacity acquisition
- Optimizing capacity profiles for effective heating management
- Single item lot-sizing with non-decreasing capacities
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem
- Lot-sizing on a tree
- Mixing MIR inequalities with two divisible coefficients
- Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution
This page was built for publication: Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4286933)
