Randomized multi-level lot-sizing heuristics for general product structures.

DOI10.1016/S0377-2217(02)00403-4MaRDI QIDQ1810504zbMATH OpenFDO

Authors Nico Dellaert, Jully Jeunet

Publication date 9 June 2003

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0377-2217(02)00403-4

zbMATH Keywords

HeuristicsInventory managementLot-sizingMaterial requirements planning

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Recommendations

• Single-point stochastic search algorithms for the multi-level lot-sizing problem
• Heuristic Methods for the Multi-product Dynamic Lot Size Problem
• Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic
• Multi-level multi-item lot size planning with limited resources and general manufacturing structure.
• Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review

Cites work

• A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
• A comparative study of lot sizing procedures for multi-stage assembly systems
• A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures
• An evaluation of heuristic performance in multi-stage lot-sizing systems
• Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems
• Dynamic Lot Size Models for Multi-Stage Assembly Systems
• Dynamic version of the economic lot size model
• Extensions of the Planning Horizon Theorem in the Dynamic Lot Size Model
• scientific article; zbMATH DE number 3737349 (Why is no real title available?)
• scientific article; zbMATH DE number 3739272 (Why is no real title available?)
• Improved Heuristics for Multi-Stage Requirements Planning Systems
• Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
• Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic
• Multi-level multi-item lot size planning with limited resources and general manufacturing structure.
• Optimal Lot-Sizing Algorithms for Complex Product Structures
• Optimal Multi-Level Lot Sizing for Requirements Planning Systems
• Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm

Cited in

(11)

• Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic
• Valid inequalities, preprocessing, and an effective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure
• Combining population-based and exact methods for multi-level capacitated lot-sizing problems
• Competitive methods for multi-level lot sizing and scheduling: tabu search and randomized regrets
• Decentralized supply chain coordination through auction markets: dynamic lot-sizing in distribution networks
• Incorporating a database approach into the large-scale multi-level lot sizing problem
• Single-point stochastic search algorithms for the multi-level lot-sizing problem
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
• A MAX-MIN ant system for unconstrained multi-level lot-sizing problems
• Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight
• Decentralized multi-level uncapacitated lot-sizing by automated negotiation

Describes a project that uses

Uses Software

• Mlclsp

This page was built for publication: Randomized multi-level lot-sizing heuristics for general product structures.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1810504)