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

DOI10.1080/00207540500057589MaRDI QIDQ3369501zbMATH OpenOpenAlexFDO

Authors Fayez F. Boctor, Patrice Poulin

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

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

Recommendations

• Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review
• Efficient heuristics for dynamic lot sizing
• A heuristic method for lot-sizing in multi-stage systems
• scientific article; zbMATH DE number 1859369
• A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures

Cites work

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

Cited in

(11)

• Designing new heuristics for the capacitated lot sizing problem by genetic programming
• Heuristic Methods for the Multi-product Dynamic Lot Size Problem
• Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over
• A heuristic based on mathematical programming for a lot-sizing and scheduling problem in mold-injection production
• Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior
• Dynamic lot sizing for multiple products with a new joint replenishment model
• Heuristics for the economic production quantity problem under restrictions on production and maintenance time
• A simple heuristic for multi-product dynamic lot sizing problems
• Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
• The multi-product, economic lot-sizing problem in flow shops: The powers-of-two heuristic
• Heuristics for the stochastic economic lot sizing problem with remanufacturing under backordering costs

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

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