Pages that link to "Item:Q3953531"

The following pages link to An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints (Q3953531):

Displaying 36 items.

• Capacitated lot sizing problems with inventory bounds (Q492789) (← links)
• Analysis of the maximum level policy in a production-distribution system (Q547123) (← links)
• A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints (Q583078) (← links)
• Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time (Q613509) (← links)
• Set partitioning and column generation heuristics for capacitated dynamic lotsizing (Q922926) (← links)
• A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment (Q1011268) (← links)
• A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure (Q1042524) (← links)
• A dynamic production scheduling model with lost-sales or backlogging (Q1092803) (← links)
• Planning horizons for multi-item hierarchical production scheduling problems: A heuristic search procedure (Q1107425) (← links)
• Production planning with time-dependent capacity bounds (Q1159564) (← links)
• An efficient algorithm for the capacitated single item dynamic lot size problem (Q1262197) (← links)
• A new dynamic programming algorithm for the single item capacitated dynamic lot size model (Q1318270) (← links)
• A dynamic programming algorithm for dynamic lot size models with piecewise linear costs (Q1327429) (← links)
• An effective algorithm for the capacitated single item lot size problem (Q1331619) (← links)
• Two-stage absolute semi-deviation mean-risk stochastic programming: an application to the supply chain replenishment problem (Q1734824) (← links)
• Improved exact algorithms to economic lot-sizing with piecewise linear production costs (Q1752258) (← links)
• Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost (Q1758285) (← links)
• Facets and algorithms for capacitated lot sizing (Q1823857) (← links)
• Heuristic methods and applications: A categorized survey (Q1823879) (← links)
• A production planning model for an unreliable production facility: case of finite horizon and single demand (Q1848632) (← links)
• A new characterization for the dynamic lot size problem with bounded inventory (Q1869910) (← links)
• Single item lot-sizing problems with backlogging on a single machine at a finite production rate (Q1887789) (← links)
• Decision horizons for the capacitated lot size model with inventory bounds and stockouts (Q2368105) (← links)
• Capacitated replenishment and disposal planning for multiple products with resalable returns (Q2393488) (← links)
• A single-item economic lot-sizing problem with a non-uniform resource: Approximation (Q2482766) (← links)
• Cross-facility management of production and transportation planning problem (Q2499157) (← links)
• Single item lot sizing problems (Q2566041) (← links)
• Capacitated production planning with outsourcing in an OKP company (Q3541177) (← links)
• (Q3670906) (← links)
• Multifacility in-series production-planning model with capacity constraints (Q3757668) (← links)
• Improved algorithms for dynamic lot sizing problems with incremental discount (Q4646677) (← links)
• Overview of Production Planning (Q4747895) (← links)
• Decentralized supply chain coordination through auction markets: dynamic lot-sizing in distribution networks (Q5428730) (← links)
• Lot sizing with bounded inventory and lost sales (Q5451189) (← links)
• Combined replenishment and warehousing with contract commitments and flexibilities (Q6053128) (← links)
• Inventory Management: An Overview, Canadian Publications, Practical Applications and Suggestions for Future Research (Q6160339) (← links)