Heuristics for theN-product,M-stage, economic lot sizing and scheduling problem with dynamic demand

DOI10.1080/00207540500057589zbMath1082.90147OpenAlexW2055073286MaRDI QIDQ3369501

Patrice Poulin, Fayez F. Boctor

Publication date: 2 February 2006

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540500057589

zbMATH Keywords

heuristicslot sizing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)

Related Items (4)

Dynamic capacitated lot-sizing problems: a classification and review of solution approaches ⋮ Designing new heuristics for the capacitated lot sizing problem by genetic programming ⋮ Dynamic lot sizing for multiple products with a new joint replenishment model ⋮ Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over

Cites Work

• A simple heuristic for the multi-item single level capacitated lotsizing problem
• Facets and algorithms for capacitated lot sizing
• The G-group heuristic to solve the multi-product, sequencing, lot sizing and scheduling problem in flow shops
• Dynamic Version of the Economic Lot Size Model
• Scheduling Economic Lot Size Production Runs
• The G-group heuristic for single machine lot scheduling
• The Two-Product, Single-Machine, Static Demand, Infinite Horizon Lot Scheduling Problem
• Production Runs for Multiple Products: The Two-Product Heuristic
• The Economic Lot Scheduling Problem (ELSP): Review and Extensions
• Common Cycle Lot-Size Scheduling for Multi-Product, Multi-Stage Production
• A Heuristic Scheduling Policy for Multi-Item, Multi-Machine Production Systems with Time-Varying, Stochastic Demands
• Deterministic Production Planning with Concave Costs and Capacity Constraints
• A Dynamic Programming Approach to a Lot Size Scheduling Problem
• The two-group heuristic to solve the multi-product, economic lot sizing and scheduling problem in flow shops.
• The multi-product, economic lot-sizing problem in flow shops: The powers-of-two heuristic

This page was built for publication: Heuristics for theN-product,M-stage, economic lot sizing and scheduling problem with dynamic demand