Pages that link to "Item:Q1926904"

The following pages link to A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs (Q1926904):

Displayed 14 items.

• The single-item green lot-sizing problem with fixed carbon emissions (Q320793) ‎ (← links)
• Dual-mode production planning for manufacturing with emission constraints (Q322630) ‎ (← links)
• Lot sizing with minimum order quantity (Q479047) ‎ (← links)
• Lot sizing with storage losses under demand uncertainty (Q1631634) ‎ (← 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 polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows (Q1785294) ‎ (← links)
• Production lot-sizing with dynamic capacity adjustment (Q1991128) ‎ (← links)
• A synergic economic order quantity model with trade credit, shortages, imperfect quality and inspection errors (Q2289991) ‎ (← links)
• Polynomial cases of the economic lot sizing problem with cost discounts (Q2514883) ‎ (← links)
• On Robust Lot Sizing Problems with Storage Deterioration, with Applications to Heat and Power Cogeneration (Q2835659) ‎ (← links)
• Lot Sizing with Piecewise Concave Production Costs (Q2940066) ‎ (← links)
• Polynomial-Time Solvability of Dynamic Lot Size Problems (Q3188765) ‎ (← links)
• Improved algorithms for dynamic lot sizing problems with incremental discount (Q4646677) ‎ (← links)