A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time

From MaRDI portal
Revision as of 23:58, 29 January 2024 by Import240129110155 (talk | contribs) (Created automatically from import240129110155)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3985143

DOI10.1287/MNSC.37.8.909zbMath0748.90011OpenAlexW2168300772MaRDI QIDQ3985143

Awi Federgruen, Michal Tzur

Publication date: 27 June 1992

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.37.8.909






Related Items (only showing first 100 items - show all)

The dynamic lot-sizing problem with variable unit costsA cash‐constrained dynamic lot‐sizing problem with loss of goodwill and credit‐based loanMultiechelon Lot Sizing: New Complexities and InequalitiesImproved algorithms for dynamic lot sizing problems with incremental discountFeasible Sequential Decisions and a Flexible Lagrangean‐Based Heuristic for Dynamic Multi‐Level Lot SizingUnnamed ItemLot sizing with bounded inventory and lost salesA Greedy Algorithm for Capacitated Lot-Sizing Problemsارائه یک روش برنامه ریزی پویا کارا جهت بهینه سازی مسئله اندازه سفارش با محدودیت ظرفیتCompetition under time‐varying demands and dynamic lot sizing costsA modeling and hybridized decomposition approach for the multi-level capacitated lot-sizing problem with setup carryover, backlogging, and emission controlA dynamic programming algorithm for dynamic lot size models with piecewise linear costsUsing geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensionsAn effective algorithm for the capacitated single item lot size problemDynamic programming approximation algorithms for the capacitated lot-sizing problemSubcontracting and lot-sizing with constant capacitiesInventory lot-sizing with supplier selectionSingle item lot-sizing problems with backlogging on a single machine at a finite production rateNew integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setupsLot sizing in capacitated production planning and control systemsDynamic capacitated lot-sizing problems: a classification and review of solution approachesA Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problemThe lockmaster's problemImproving the efficiency of decentralized supply chains with fixed ordering costsDynamic lot-sizing model for major and minor demandsEconomic lot-sizing gamesLot-sizing with fixed charges on stocks: the convex hullPolynomial-Time Solvability of Dynamic Lot Size ProblemsEffective replenishment policies for the multi-item dynamic lot-sizing problem with storage capacitiesMeta-heuristics for dynamic lot sizing: a review and comparison of solution approachesA heuristic solution procedure for the dynamic lot sizing problem with remanufacturing and product recoveryMinimizing the error bound for the dynamic lot size modelThe stochastic lot-sizing problem with quantity discountsDynamic lot sizing with random demand and non-stationary costsCentralized and decentralized inventory policies for a single-vendor two-buyer system with permissible delay in paymentsSolving a constrained economic lot size problem by ranking efficient production policiesAn efficient procedure for dynamic lot-sizing model with demand time windowsOn the stochastic uncapacitated dynamic single-item lotsizing problem with service level constraintsLoss of customer goodwill in the uncapacitated lot-sizing problemPerspectives of Monge properties in optimizationCapacitated dynamic lot-sizing problem with delivery/production time windowsStochastic lot-sizing problem with inventory-bounds and constant order-capacitiesSolving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) timeProgress with single-item lot-sizingMinimizing setups and waste when printing labels of consumer goodsRelaxations for two-level multi-item lot-sizing problemsA computational analysis of lower bounds for big bucket production planning problemsA Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with BackloggingTwo-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertaintyJust-in-Time Planning and Lot-SizingPlanning for demand failure: a dynamic lot size model for clinical trial supply chainsLocal Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing ProblemsA polyhedral study of the static probabilistic lot-sizing problemApproximation algorithms for supply chain planning and logistics problems with market choiceScheduling multimodal transportation systems.Economic lot sizing: the capacity reservation modelRemanufacturing planning for the reverse Wagner/Whitin modelsLot-sizing with non-stationary cumulative capacitiesAn \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costsOn stochastic lot-sizing problems with random lead timesDynamic lot-sizing problem with demand time windows and container-based transportation costReformulation by discretization: application to economic lot sizingA comparative study of modeling and solution approaches for the coordinated lot-size problem with dynamic demandSolving a class of simulation-based optimization problems using ``optimality in probabilityA cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup timesMulti-level multi-item lot size planning with limited resources and general manufacturing structure.Efficient approximation schemes for economic lot-sizing in continuous timeAn efficient algorithm for the 2-level capacitated lot-sizing problem with identical capacities at both levelsA heuristic approach for big bucket multi-level production planning problemsA dynamic uncapacitated lot-sizing problem with co-productionJoint pricing and inventory management with deterministic demand and costly price adjustmentAn efficient algorithm for the dynamic economic lot size problemAn efficient approach for solving the lot-sizing problem with time-varying storage capacitiesStochastic lot-sizing with backlogging: computational complexity analysisSolving the stochastic dynamic lot-sizing problem through nature-inspired heuristicsPolyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitutionA comparison of methods for lot-sizing in a rolling horizon environmentInventory replenishment model: lot sizing versus just-in-time delivery.Dynamic lot-sizing model with demand time windows and speculative cost structureAn efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problemGreedy algorithm for local heating problemIntegrated market selection and production planning: complexity and solution approachesA single-item lot-sizing problem with a by-product and inventory capacitiesRounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behaviorIntegrating facility location and production planning decisionsExtended formulations for stochastic lot-sizing problemsCapacitated lot-sizing problem with outsourcingUncapacitated two-level lot-sizingPolyhedral and Lagrangian approaches for lot sizing with production time windows and setup timesPolynomial cases of the economic lot sizing problem with cost discountsCoordination of a two-level supply chain with contractsPolyhedra for lot-sizing with Wagner-Whitin costsA primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishmentGrouping in decomposition method for multi-item capacitated lot-sizing problem with immediate lost sales and joint and item-dependent setup costMulti-item lot-sizing with joint set-up costsA holding cost bound for the economic lot-sizing problem with time-invariant cost parametersThe multi-item capacitated lot-sizing problem with safety stocks and demand shortage costsOn the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional GridLot sizing and scheduling -- survey and extensionsSingle item lot sizing problems







This page was built for publication: A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time