Pages that link to "Item:Q3990573"

The following pages link to Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case (Q3990573):

Displaying 50 items.

• On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date (Q1310010) (← links)
• The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming (Q1317050) (← links)
• Sequential stability of the constant cost dynamic lot size model- searching for monotonicity (Q1317527) (← 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)
• Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions (Q1331605) (← links)
• An effective algorithm for the capacitated single item lot size problem (Q1331619) (← links)
• Dynamic lot sizing with random demand and non-stationary costs (Q1362520) (← links)
• Progress with single-item lot-sizing (Q1390225) (← links)
• The multiscenario lot size problem with concave costs. (Q1426700) (← links)
• A novel decomposition approach for on-line lot-sizing. (Q1582194) (← links)
• Improved dynamic programs for some batching problems involving the maximum lateness criterion (Q1593711) (← links)
• The stochastic lot-sizing problem with quantity discounts (Q1652181) (← links)
• An algorithm for general infinite horizon lot sizing with deterministic demand (Q1704039) (← links)
• A polyhedral study of the static probabilistic lot-sizing problem (Q1708524) (← links)
• Efficient approximation schemes for economic lot-sizing in continuous time (Q1751154) (← links)
• An efficient algorithm for the 2-level capacitated lot-sizing problem with identical capacities at both levels (Q1753642) (← links)
• Two-level lot-sizing with inventory bounds (Q1756341) (← links)
• A dynamic uncapacitated lot-sizing problem with co-production (Q1758049) (← links)
• Joint pricing and inventory management with deterministic demand and costly price adjustment (Q1758284) (← links)
• Solving the stochastic dynamic lot-sizing problem through nature-inspired heuristics (Q1762143) (← links)
• Multi-product lot-sizing with a transportation capacity reservation contract (Q1776959) (← links)
• Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior (Q1782155) (← links)
• Extended formulations for stochastic lot-sizing problems (Q1785234) (← links)
• Capacitated lot-sizing problem with outsourcing (Q1785408) (← links)
• Polyhedra for lot-sizing with Wagner-Whitin costs (Q1804648) (← links)
• Lotsizing with backlogging and start-ups: The case of Wagner-Whitin costs (Q1807930) (← links)
• A new characterization for the dynamic lot size problem with bounded inventory (Q1869910) (← links)
• Inventory lot-sizing with supplier selection (Q1886723) (← links)
• Single item lot-sizing problems with backlogging on a single machine at a finite production rate (Q1887789) (← links)
• Lot sizing in capacitated production planning and control systems (Q1891872) (← links)
• Minimizing the error bound for the dynamic lot size model (Q1904609) (← links)
• Perspectives of Monge properties in optimization (Q1923588) (← links)
• A note on ``The economic lot sizing problem with inventory bounds'' (Q1927015) (← links)
• Remanufacturing planning for the reverse Wagner/Whitin models (Q1969861) (← links)
• A single-item lot-sizing problem with a by-product and inventory capacities (Q2023969) (← links)
• Coordination of a two-level supply chain with contracts (Q2044552) (← links)
• Lower bound on size of branch-and-bound trees for solving lot-sizing problem (Q2083992) (← links)
• Subcontracting and lot-sizing with constant capacities (Q2133416) (← links)
• Dynamic lot sizing with stochastic demand timing (Q2140333) (← links)
• Solving a constrained economic lot size problem by ranking efficient production policies (Q2165759) (← links)
• Valid inequalities, preprocessing, and an effective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure (Q2242374) (← links)
• Multi-item uncapacitated lot sizing problem with inventory bounds (Q2257083) (← links)
• Minimum concave cost flow over a grid network (Q2340279) (← links)
• A Lagrangian heuristic for capacitated single item lot sizing problems (Q2351162) (← links)
• The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases (Q2355864) (← links)
• Dynamic capacitated lot-sizing problems: a classification and review of solution approaches (Q2379665) (← links)
• Dynamic lot-sizing model for major and minor demands (Q2384637) (← links)
• Lot-sizing with fixed charges on stocks: the convex hull (Q2386201) (← links)
• Solving the electricity production planning problem by a column generation based heuristic (Q2434329) (← links)