Pages that link to "Item:Q2496059"

The following pages link to An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem (Q2496059):

Displaying 15 items.

• Algorithms for the two-stage production-capacitated lot-sizing problem (Q312482) (← links)
• Dual-mode production planning for manufacturing with emission constraints (Q322630) (← links)
• An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities (Q418062) (← links)
• Capacitated lot sizing problems with inventory bounds (Q492789) (← links)
• Dynamic knapsack sets and capacitated lot-sizing (Q1411629) (← links)
• Single-item dynamic lot-sizing problems: an updated survey (Q1694825) (← links)
• An efficient algorithm for the 2-level capacitated lot-sizing problem with identical capacities at both levels (Q1753642) (← links)
• A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale (Q1762169) (← links)
• Forecast horizon for dynamic lot sizing model under product substitution and perishable inventories (Q2002849) (← links)
• An application of dynamic programming to assign pressing tanks at wineries (Q2189941) (← links)
• Economic lot sizing problem with inventory dependent demand (Q2228391) (← links)
• Dynamic lot sizing with product returns and remanufacturing (Q3432672) (← links)
• An FPTAS for SM‐CELS problem with monotone cost functions (Q3579135) (← links)
• An <i>O</i>(<i>T</i>²) Algorithm for the <i>NI</i>/<i>G</i>/<i>NI</i>/<i>ND</i> Capacitated Lot Size Problem (Q3821896) (← links)
• Predictive Search for Capacitated Multi-Item Lot Sizing Problems (Q5084658) (← links)