Multi-level multi-item lot size planning with limited resources and general manufacturing structure.

DOI10.1007/BF01720518zbMath0776.90016MaRDI QIDQ684381

Matthias Derstroff, Horst Tempelmeier

Publication date: 15 September 1993

Published in: OR Spektrum (Search for Journal in Brave)

zbMATH Keywords

Lagrangean relaxationheuristicdynamic multi-level multi-item lotsizing

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (11)

Lot sizing in capacitated production planning and control systems ⋮ Dynamic capacitated lot-sizing problems: a classification and review of solution approaches ⋮ Reformulations of the shortest route model for dynamic multi-item multi-level capacitated lotsizing ⋮ A capacity-oriented hierarchical approach to single-item and small-batch production planning using project-scheduling methods ⋮ A MAX-MIN ant system for unconstrained multi-level lot-sizing problems ⋮ Hierarchically integrated lot size optimization ⋮ Randomized multi-level lot-sizing heuristics for general product structures. ⋮ Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing ⋮ Incorporating kin selection in simulated annealing algorithm and its performance evaluation ⋮ Competitive methods for multi-level lot sizing and scheduling: tabu search and randomized regrets ⋮ Analysis of production control systems kanban and CONWIP

Uses Software

• Mlclsp

Cites Work

• Unnamed Item
• Unnamed Item
• The discrete lot-sizing and scheduling problem
• Multilevel capacitated lotsizing complexity and LP-based heuristics
• Analysis of relaxations for the multi-item capacitated lot-sizing problem
• A simple heuristic for the multi-item single level capacitated lotsizing problem
• Primal-dual approach to the single level capacitated lot-sizing problem
• Deterministic lotsizing models for production planning
• A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures
• Analysis Of Lagrangian Decomposition For The Multi-Item Capacitated Lot-Sizing Problem
• Comparative analysis of lot-sizing models for multi-stage systems: a simulation study
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
• Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
• A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
• A Survey of Lagrangean Techniques for Discrete Optimization
• Validation of subgradient optimization

This page was built for publication: Multi-level multi-item lot size planning with limited resources and general manufacturing structure.