Pages that link to "Item:Q3120576"

The following pages link to Economic lot sizing with constant capacities and concave inventory costs (Q3120576):

Displaying 22 items.

• 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 \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs (Q943783) (← links)
• An algorithm for single-item economic lot-sizing problem with general inventory cost, non-decreasing capacity, and non-increasing setup and production cost (Q943784) (← links)
• A holding cost bound for the economic lot-sizing problem with time-invariant cost parameters (Q1015306) (← links)
• An exact formulation of inventory costs and optimal lot size in face of sudden obsolescence (Q1318666) (← links)
• Single-item dynamic lot-sizing problems: an updated survey (Q1694825) (← links)
• A polynomial time algorithm to the economic lot sizing problem with constant capacity and piecewise linear concave costs (Q1728316) (← links)
• Improved exact algorithms to economic lot-sizing with piecewise linear production costs (Q1752258) (← links)
• Production lot-sizing with dynamic capacity adjustment (Q1991128) (← links)
• Solving a constrained economic lot size problem by ranking efficient production policies (Q2165759) (← links)
• Economic lot sizing problem with inventory dependent demand (Q2228391) (← links)
• Dynamic economic lot size model with perishable inventory and capacity constraints (Q2293902) (← links)
• A Lagrangian heuristic for capacitated single item lot sizing problems (Q2351162) (← links)
• An efficient approach for solving the lot-sizing problem with time-varying storage capacities (Q2482746) (← links)
• Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount (Q2669493) (← links)
• Improved algorithms for a lot‐sizing problem with inventory bounds and backlogging (Q3120555) (← links)
• TECHNICAL NOTE—Solving Linear Cost Dynamic Lot-Sizing Problems in <i>O</i>(<i>n</i> log <i>n</i>) Time (Q3392169) (← links)
• Lot-Sizing with Constant Batches: Formulation and Valid Inequalities (Q4286933) (← links)
• An Algorithm for the Single-item Capacitated Lot-Sizing Problem with Concave Production and Holding Costs (Q4305773) (← links)
• Strong turnpike policies in the single-item capacitated lot-sizing problem with periodical dynamic parameter (Q4372781) (← links)
• Improved algorithms for dynamic lot sizing problems with incremental discount (Q4646677) (← links)
• Economic lot sizing problem with tank scheduling (Q6167403) (← links)