Pages that link to "Item:Q4094637"

The following pages link to A Deterministic Multi-Period Production Planning Model with Piecewise Concave Production and Holding-Backorder Costs (Q4094637):

Displaying 25 items.

• Dual-mode production planning for manufacturing with emission constraints (Q322630) (← links)
• A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints (Q583078) (← links)
• Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs (Q1026766) (← links)
• A dynamic production scheduling model with lost-sales or backlogging (Q1092803) (← links)
• A capacity constrained singlefacility dynamic lot-size model (Q1245141) (← 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)
• Single-item dynamic lot-sizing problems: an updated survey (Q1694825) (← links)
• Improved exact algorithms to economic lot-sizing with piecewise linear production costs (Q1752258) (← links)
• A dynamic quantity discount lot size model with resales (Q1821680) (← links)
• A new characterization for the dynamic lot size problem with bounded inventory (Q1869910) (← links)
• Minimizing the error bound for the dynamic lot size model (Q1904609) (← links)
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms (Q2277131) (← links)
• The single-item lot-sizing problem with two production modes, inventory bounds, and periodic carbon emissions capacity (Q2294332) (← links)
• Decision horizons for the capacitated lot size model with inventory bounds and stockouts (Q2368105) (← links)
• Dynamic lot-sizing model for major and minor demands (Q2384637) (← links)
• A two-echelon inventory optimization model with demand time window considerations (Q2574100) (← links)
• Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount (Q2669493) (← links)
• Single-item lot-sizing with quantity discount and bounded inventory (Q2670451) (← links)
• Lot Sizing with Piecewise Concave Production Costs (Q2940066) (← links)
• Capacitated production planning with outsourcing in an OKP company (Q3541177) (← links)
• Improved algorithms for dynamic lot sizing problems with incremental discount (Q4646677) (← links)
• Modeling industrial lot sizing problems: a review (Q5385468) (← links)
• Lot sizing with bounded inventory and lost sales (Q5451189) (← links)