A survey of lower bounding methodologies for production/inventory models

DOI10.1007/BF02248583zbMath0709.90032MaRDI QIDQ922260

Derek Atkins

Publication date: 1990

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

heuristicscontinuous reviewlot-sizinglower boundingdynamic discrete time demand

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Related Items (2)

Knowledge You Can Act on: Optimal Policies for Assembly Systems with Expediting and Advance Demand Information ⋮ Analysis of relaxations for the multi-item capacitated lot-sizing problem

Cites Work

• A lower bound on a class of coordinated inventory/production problems
• Computational complexity of uncapacitated multi-echelon production planning problems
• Approximations of Dynamic, Multilocation Production and Inventory Problems
• Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems
• Optimal Lot-Sizing Algorithms for Complex Product Structures
• Eliminating Inventory in a Series Facility Production System
• The Multilocation Multiperiod Inventory Problem: Bounds and Approximations
• Estimating the Performance of Multi-Level Inventory Systems
• Optimal Inventory Policies for Assembly Systems Under Random Demands
• A 98%-Effective Lot-Sizing Rule for a Multi-Product, Multi-Stage Production / Inventory System
• Coordinated Replenishments in a Multi-Item Inventory System with Compound Poisson Demands
• A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
• A Facilities in Series Inventory Model with Nested Schedules
• Unnamed Item
• Unnamed Item

This page was built for publication: A survey of lower bounding methodologies for production/inventory models