Statistical search methods for lotsizing problems
From MaRDI portal
Publication:2367017
DOI10.1007/BF02023005zbMATH Open0778.90017MaRDI QIDQ2367017FDOQ2367017
Authors: Marc Salomon, Roelof Kuik, Luk N. Van Wassenhove
Publication date: 16 August 1993
Published in: Annals of Operations Research (Search for Journal in Brave)
Recommendations
Computational methods for problems pertaining to operations research and mathematical programming (90-08) Mixed integer programming (90C11) Production models (90B30)
Cites Work
- Title not available (Why is that?)
- Computational complexity of uncapacitated multi-echelon production planning problems
- Deterministic Production Planning: Algorithms and Complexity
- The Set-Partitioning Problem: Set Covering with Equality Constraints
- Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
- Deterministic lotsizing models for production planning
- 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
- Tabu search techniques. A tutorial and an application to neural networks
- Heuristics for Multilevel Lot-Sizing with a Bottleneck
- Improved Heuristics for Multi-Stage Requirements Planning Systems
- Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic
- New approaches for heuristic search: A bilateral linkage with artificial intelligence
Cited In (13)
- HOPS -- Hamming-Oriented Partition Search for production planning in the spinning industry
- Title not available (Why is that?)
- Single-point stochastic search algorithms for the multi-level lot-sizing problem
- Decentralized multi-level uncapacitated lot-sizing by automated negotiation
- Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing
- Lot sizing and scheduling -- survey and extensions
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- Hybrid methods for lot sizing on parallel machines
- Multi-level, single-machine lot sizing and scheduling (with initial inventory)
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
- Single item lot sizing problems
- Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs
- Competitive methods for multi-level lot sizing and scheduling: tabu search and randomized regrets
Uses Software
This page was built for publication: Statistical search methods for lotsizing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2367017)