Statistical search methods for lotsizing problems

DOI10.1007/BF02023005zbMath0778.90017MaRDI QIDQ2367017

Roelof Kuik, Marc Salomon, Luk N. Van Wassenhove

Publication date: 16 August 1993

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

simulated annealingtabu searchproduction planningNP-hardlotsizingstatistical search methods

Mathematics Subject Classification ID

Mixed integer programming (90C11) Production models (90B30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (10)

Dynamic capacitated lot-sizing problems: a classification and review of solution approaches ⋮ Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches ⋮ Hybrid methods for lot sizing on parallel machines ⋮ Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs ⋮ Decentralized multi-level uncapacitated lot-sizing by automated negotiation ⋮ Multi-level, single-machine lot sizing and scheduling (with initial inventory) ⋮ Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing ⋮ Lot sizing and scheduling -- survey and extensions ⋮ Single item lot sizing problems ⋮ Competitive methods for multi-level lot sizing and scheduling: tabu search and randomized regrets

Uses Software

• LINDO

Cites Work

• Unnamed Item
• Multilevel capacitated lotsizing complexity and LP-based heuristics
• New approaches for heuristic search: A bilateral linkage with artificial intelligence
• Tabu search techniques. A tutorial and an application to neural networks
• Computational complexity of uncapacitated multi-echelon production planning problems
• Deterministic lotsizing models for production planning
• Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic
• 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
• Deterministic Production Planning: Algorithms and Complexity
• Improved Heuristics for Multi-Stage Requirements Planning Systems
• Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
• The Set-Partitioning Problem: Set Covering with Equality Constraints

This page was built for publication: Statistical search methods for lotsizing problems