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.90029MaRDI 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
heuristics; production planning; lot sizing; capacity constraints; Computational experience; Divide and Conquer; industrial data sets; multi-stage production/inventory problems
65K05: Numerical mathematical programming methods
90B30: Production models
90B05: Inventory, storage, reservoirs
Related Items
Application of ELSP solution techniques to the deterministic robotic scheduling problem, Warehouse sizing to minimize inventory and storage costs, Finding effective schedules for the economic lot scheduling problem: A simple mixed integer programming approach, Cyclic lot scheduling with sequence-dependent set-ups: a heuristic for disassembly processes, Reduced production rates in the economic lot scheduling problem, Hybrid genetic algorithm for the economic lot-scheduling problem, Accounting for idle capacity cost in the scheduling of economic lot sizes, The economic lot scheduling problem under power-of-two policy, The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times, Coordination mechanisms of supply chain systems, The economic lot scheduling problem: a pure genetic search 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., A profit-maximizing economic lot scheduling problem with price optimization
