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
Publication:3985143
DOI10.1287/mnsc.37.8.909zbMath0748.90011OpenAlexW2168300772MaRDI QIDQ3985143
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
Abstract computational complexity for mathematical programming problems (90C60) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
The dynamic lot-sizing problem with variable unit costs, A cash‐constrained dynamic lot‐sizing problem with loss of goodwill and credit‐based loan, Multiechelon Lot Sizing: New Complexities and Inequalities, Improved algorithms for dynamic lot sizing problems with incremental discount, Feasible Sequential Decisions and a Flexible Lagrangean‐Based Heuristic for Dynamic Multi‐Level Lot Sizing, Unnamed Item, Lot sizing with bounded inventory and lost sales, A Greedy Algorithm for Capacitated Lot-Sizing Problems, ارائه یک روش برنامه ریزی پویا کارا جهت بهینه سازی مسئله اندازه سفارش با محدودیت ظرفیت, Competition under time‐varying demands and dynamic lot sizing costs, A dynamic programming algorithm for dynamic lot size models with piecewise linear costs, Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions, An effective algorithm for the capacitated single item lot size problem, Dynamic programming approximation algorithms for the capacitated lot-sizing problem, Subcontracting and lot-sizing with constant capacities, Inventory lot-sizing with supplier selection, Single item lot-sizing problems with backlogging on a single machine at a finite production rate, New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups, Lot sizing in capacitated production planning and control systems, Dynamic capacitated lot-sizing problems: a classification and review of solution approaches, A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem, The lockmaster's problem, Improving the efficiency of decentralized supply chains with fixed ordering costs, Dynamic lot-sizing model for major and minor demands, Economic lot-sizing games, Lot-sizing with fixed charges on stocks: the convex hull, Polynomial-Time Solvability of Dynamic Lot Size Problems, Effective replenishment policies for the multi-item dynamic lot-sizing problem with storage capacities, Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches, A heuristic solution procedure for the dynamic lot sizing problem with remanufacturing and product recovery, Minimizing the error bound for the dynamic lot size model, The stochastic lot-sizing problem with quantity discounts, Dynamic lot sizing with random demand and non-stationary costs, Centralized and decentralized inventory policies for a single-vendor two-buyer system with permissible delay in payments, Solving a constrained economic lot size problem by ranking efficient production policies, An efficient procedure for dynamic lot-sizing model with demand time windows, On the stochastic uncapacitated dynamic single-item lotsizing problem with service level constraints, Loss of customer goodwill in the uncapacitated lot-sizing problem, Perspectives of Monge properties in optimization, Capacitated dynamic lot-sizing problem with delivery/production time windows, Stochastic lot-sizing problem with inventory-bounds and constant order-capacities, Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time, Progress with single-item lot-sizing, Minimizing setups and waste when printing labels of consumer goods, Relaxations for two-level multi-item lot-sizing problems, A computational analysis of lower bounds for big bucket production planning problems, A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging, Two-stage minimax regret robust uncapacitated lot-sizing problems with demand uncertainty, Just-in-Time Planning and Lot-Sizing, Planning for demand failure: a dynamic lot size model for clinical trial supply chains, Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems, A polyhedral study of the static probabilistic lot-sizing problem, Approximation algorithms for supply chain planning and logistics problems with market choice, Scheduling multimodal transportation systems., Economic lot sizing: the capacity reservation model, Remanufacturing planning for the reverse Wagner/Whitin models, Lot-sizing with non-stationary cumulative capacities, An \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs, On stochastic lot-sizing problems with random lead times, Dynamic lot-sizing problem with demand time windows and container-based transportation cost, Reformulation by discretization: application to economic lot sizing, A comparative study of modeling and solution approaches for the coordinated lot-size problem with dynamic demand, Solving a class of simulation-based optimization problems using ``optimality in probability, A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times, Multi-level multi-item lot size planning with limited resources and general manufacturing structure., Efficient approximation schemes for economic lot-sizing in continuous time, An efficient algorithm for the 2-level capacitated lot-sizing problem with identical capacities at both levels, A heuristic approach for big bucket multi-level production planning problems, A dynamic uncapacitated lot-sizing problem with co-production, Joint pricing and inventory management with deterministic demand and costly price adjustment, An efficient algorithm for the dynamic economic lot size problem, An efficient approach for solving the lot-sizing problem with time-varying storage capacities, Stochastic lot-sizing with backlogging: computational complexity analysis, Solving the stochastic dynamic lot-sizing problem through nature-inspired heuristics, Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution, A comparison of methods for lot-sizing in a rolling horizon environment, Inventory replenishment model: lot sizing versus just-in-time delivery., Dynamic lot-sizing model with demand time windows and speculative cost structure, An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem, Greedy algorithm for local heating problem, Integrated market selection and production planning: complexity and solution approaches, A single-item lot-sizing problem with a by-product and inventory capacities, Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior, Integrating facility location and production planning decisions, Extended formulations for stochastic lot-sizing problems, Capacitated lot-sizing problem with outsourcing, Uncapacitated two-level lot-sizing, Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times, Polynomial cases of the economic lot sizing problem with cost discounts, Coordination of a two-level supply chain with contracts, Polyhedra for lot-sizing with Wagner-Whitin costs, A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment, Grouping in decomposition method for multi-item capacitated lot-sizing problem with immediate lost sales and joint and item-dependent setup cost, Multi-item lot-sizing with joint set-up costs, A holding cost bound for the economic lot-sizing problem with time-invariant cost parameters, The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs, On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid, Lot sizing and scheduling -- survey and extensions, Single item lot sizing problems, Lower bound on size of branch-and-bound trees for solving lot-sizing problem, A polynomial time algorithm for a deterministic joint pricing and inventory model, A two-echelon inventory optimization model with demand time window considerations, Dynamic lot-sizing with price changes and price-dependent holding costs, Minimum concave cost flow over a grid network, Improved dynamic programs for some batching problems involving the maximum lateness criterion, Sensitivity analysis of the economic lot-sizing problem, On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date, A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem, A new dynamic programming algorithm for the single item capacitated dynamic lot size model, A new characterization for the dynamic lot size problem with bounded inventory
