Lot sizing in capacitated production planning and control systems

DOI10.1007/BF01719725zbMath0822.90076MaRDI QIDQ1891872

Stefan Helber

Publication date: 1 June 1995

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

zbMATH Keywords

production capacitymulti-level lot sizingproduction planning and controllot sizing and sequencing decisions

Mathematics Subject Classification ID

Production models (90B30)

Related Items

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 ⋮ Capacitated lot-sizing with extensions: a review ⋮ Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight ⋮ Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs ⋮ Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic ⋮ Lot sizing and scheduling -- survey and extensions ⋮ Aggregate scheduling and network solving of multi-stage and multi-item manufacturing systems ⋮ Heuristic genetic algorithms for general capacitated lot-sizing problems

Uses Software

• Mlclsp

Cites Work

• Unnamed Item
• The discrete lot-sizing and scheduling problem
• Multi-level multi-item lot size planning with limited resources and general manufacturing structure.
• Multilevel capacitated lotsizing complexity and LP-based heuristics
• New approaches for heuristic search: A bilateral linkage with artificial intelligence
• Deterministic lotsizing models for production planning
• Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic
• A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures
• 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
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• 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
• Tabu Search—Part I
• Tabu Search—Part II