Pages that link to "Item:Q1331619"

The following pages link to An effective algorithm for the capacitated single item lot size problem (Q1331619):

Displaying 32 items.

• Algorithms for the two-stage production-capacitated lot-sizing problem (Q312482) (← links)
• A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints (Q583078) (← links)
• Capacitated lot size problems with fuzzy capacity (Q597534) (← links)
• Stochastic lot-sizing problem with inventory-bounds and constant order-capacities (Q613461) (← 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)
• An optimal algorithm for the multi-item capacitated production planning problem (Q809873) (← links)
• Single item lot-sizing with non-decreasing capacities (Q847825) (← links)
• Analysis of bounds for a capacitated single-item lot-sizing problem (Q858280) (← links)
• An efficient algorithm for the dynamic economic lot size problem (Q1206386) (← 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)
• Single-item dynamic lot-sizing problems: an updated survey (Q1694825) (← links)
• A new characterization for the dynamic lot size problem with bounded inventory (Q1869910) (← links)
• A quick and effective method for capacitated lot sizing with startup and reservation costs (Q1892673) (← links)
• Production lot-sizing with dynamic capacity adjustment (Q1991128) (← links)
• Dynamic optimization for coordinated replenishment system considering seasonal demand and price quantity discount (Q2109608) (← links)
• Lot-sizing with non-stationary cumulative capacities (Q2457275) (← links)
• A single-item economic lot-sizing problem with a non-uniform resource: Approximation (Q2482766) (← links)
• An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem (Q2496059) (← links)
• Single item lot sizing problems (Q2566041) (← links)
• An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs (Q2783984) (← links)
• Analysis of a dynamic lot-sizing problem with production capacity constraint (Q2816376) (← links)
• A Forward Algorithm for the Capacitated Lot Size Model with Stockouts (Q3351120) (← links)
• Approximation Formulations for the Single-Product Capacitated Lot Size Problem (Q3741359) (← 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)
• Constrained Optimal Production Lot Sizes for Several Products (Q3985455) (← links)
• An Algorithm for the Single-item Capacitated Lot-Sizing Problem with Concave Production and Holding Costs (Q4305773) (← links)
• Algorithms for Capacitated, Multi-Item Lot-Sizing without Set-Ups (Q4838215) (← links)
• A primal-dual algorithm for the dynamic lotsizing problem with joint set-up costs (Q4862299) (← links)
• Efficient Solution of the Single-item, Capacitated Lot-sizing Problem with Start-up and Reservation Costs (Q4864350) (← links)
• Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size (Q5388050) (← links)
• Lot sizing with bounded inventory and lost sales (Q5451189) (← links)