Heuristic algorithms for dynamic capacitated lotsizing for production flow networks with setup times

DOI10.1007/BF03398692zbMath1210.90009OpenAlexW2773245263MaRDI QIDQ2477097

Jayan Moorkanat, Narayan Rangaraj, Prakash G. Awate

Publication date: 13 March 2008

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03398692

zbMATH Keywords

systemsheuristicscapacity constraintssetup timesmultistagelotsizingproduction-inventoryconvergent-divergent

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)

Cites Work

• Multilevel capacitated lotsizing complexity and LP-based heuristics
• A simple heuristic for the multi-item single level capacitated lotsizing problem
• A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures
• Lot Sizing in General Assembly Systems with Setup Costs, Setup Times, and Multiple Constrained Resources
• Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems
• Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
• Heuristics for Multilevel Lot-Sizing with a Bottleneck
• Optimal Lot-Sizing Algorithms for Complex Product Structures
• A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
• Validation of subgradient optimization
• Lot Sizing in Serial Assembly Systems with Multiple Constrained Resources

This page was built for publication: Heuristic algorithms for dynamic capacitated lotsizing for production flow networks with setup times