Heuristic algorithms for dynamic capacitated lotsizing for production flow networks with setup times
DOI10.1007/BF03398692zbMATH Open1210.90009OpenAlexW2773245263MaRDI QIDQ2477097FDOQ2477097
Authors: Jayan Moorkanat, Prakash G. Awate, Narayan Rangaraj 
Publication date: 13 March 2008
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf03398692
heuristicscapacity constraintssystemssetup timesmultistagelotsizingproduction-inventoryconvergent-divergent
Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)
Cites Work
- Validation of subgradient optimization
- A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
- A simple heuristic for the multi-item single level capacitated lotsizing problem
- Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
- Multilevel capacitated lotsizing complexity and LP-based heuristics
- Optimal Lot-Sizing Algorithms for Complex Product Structures
- Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems
- Heuristics for Multilevel Lot-Sizing with a Bottleneck
- 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
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2477097)
