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

DOI10.1007/BF03398692MaRDI QIDQ2477097zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

heuristicscapacity constraintssystemssetup timesmultistagelotsizingproduction-inventoryconvergent-divergent

Mathematics Subject Classification ID

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

Cites work

• A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
• A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures
• A simple heuristic for the multi-item single level capacitated lotsizing problem
• Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems
• Heuristics for Multilevel Lot-Sizing with a Bottleneck
• Lot Sizing in Serial Assembly Systems with Multiple Constrained Resources
• Lot sizing in general assembly systems with setup costs, setup times, and multiple constrained resources
• 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
• Validation of subgradient optimization

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)