Rounding Off to Powers of Two in Continuous Relaxations of Capacitated Lot Sizing Problems
From MaRDI portal
Publication:4735007
DOI10.1287/mnsc.35.12.1433zbMath0684.90029OpenAlexW2055213643MaRDI QIDQ4735007
Publication date: 1989
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.35.12.1433
heuristicsproduction planninglot sizingcapacity constraintsComputational experienceDivide and Conquerindustrial data setsmulti-stage production/inventory problems
Numerical mathematical programming methods (65K05) Production models (90B30) Inventory, storage, reservoirs (90B05)
Related Items (18)
Safety stock optimisation in two-echelon assembly systems: normal approximation models ⋮ A profit-maximizing economic lot scheduling problem with price optimization ⋮ Coordination mechanisms of supply chain systems ⋮ Accounting for idle capacity cost in the scheduling of economic lot sizes ⋮ The economic lot scheduling problem: a pure genetic search approach ⋮ Improved randomized approximation algorithms for lot-sizing problems ⋮ The economic lot scheduling problem under extended basic period and power-of-two policy ⋮ Application of ELSP solution techniques to the deterministic robotic scheduling problem ⋮ The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times ⋮ Cyclic lot scheduling with sequence-dependent set-ups: a heuristic for disassembly processes ⋮ The economic lot scheduling problem under power-of-two policy ⋮ Reduced production rates in the economic lot scheduling problem ⋮ Warehouse sizing to minimize inventory and storage costs ⋮ Integrated pricing and lot-sizing decisions in a serial supply chain ⋮ Hybrid genetic algorithm for the economic lot-scheduling problem ⋮ Finding effective schedules for the economic lot scheduling problem: A simple mixed integer programming approach ⋮ The use of genetic algorithms to solve the economic lot size scheduling problem ⋮ A global optimum search algorithm for the joint replenishment problem under power-of-two policy.
This page was built for publication: Rounding Off to Powers of Two in Continuous Relaxations of Capacitated Lot Sizing Problems
