Rounding Off to Powers of Two in Continuous Relaxations of Capacitated Lot Sizing Problems

DOI10.1287/MNSC.35.12.1433zbMATH Open0684.90029OpenAlexW2055213643MaRDI QIDQ4735007FDOQ4735007

Authors: Robin Roundy 

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

Recommendations

• Rounding procedures for the discrete version of the capacitated economic order quantity problem
• Multistage Lot Sizing Problems via Randomized Rounding
• Improved rounding procedures for the discrete version of the capacitated EOQ problem
• An effective algorithm for the capacitated single item lot size problem
• Optimal Power-of-Two Replenishment Strategies in Capacitated General Production/Distribution Networks

zbMATH Keywords

heuristicscapacity constraintsproduction planninglot sizingComputational experienceDivide and Conquerindustrial data setsmulti-stage production/inventory problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05) Production models (90B30)

Cited In (22)

• Finding effective schedules for the economic lot scheduling problem: A simple mixed integer programming approach
• Reduced production rates in the economic lot scheduling problem
• Hybrid genetic algorithm for the economic lot-scheduling problem
• Multistage Lot Sizing Problems via Randomized Rounding
• The economic lot scheduling problem under extended basic period and power-of-two policy
• Safety stock optimisation in two-echelon assembly systems: normal approximation models
• Warehouse sizing to minimize inventory and storage costs
• Integrated pricing and lot-sizing decisions in a serial supply chain
• Improved randomized approximation algorithms for lot-sizing problems
• Coordination mechanisms of supply chain systems
• Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior
• The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
• A profit-maximizing economic lot scheduling problem with price optimization
• The economic lot scheduling problem under power-of-two policy
• The use of genetic algorithms to solve the economic lot size scheduling problem
• Cyclic lot scheduling with sequence-dependent set-ups: a heuristic for disassembly processes
• Rounding procedures for the discrete version of the capacitated economic order quantity problem
• The economic lot scheduling problem: a pure genetic search approach
• Improved rounding procedures for the discrete version of the capacitated EOQ problem
• A global optimum search algorithm for the joint replenishment problem under power-of-two policy.
• Accounting for idle capacity cost in the scheduling of economic lot sizes
• Application of ELSP solution techniques to the deterministic robotic scheduling problem

This page was built for publication: Rounding Off to Powers of Two in Continuous Relaxations of Capacitated Lot Sizing Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4735007)