The G-group heuristic to solve the multi-product, sequencing, lot sizing and scheduling problem in flow shops

DOI10.1080/00207540150208871zbMath0976.90034OpenAlexW2135102627MaRDI QIDQ2709462

Fayez F. Boctor, Jamal Ouenniche

Publication date: 13 January 2002

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

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

zbMATH Keywords

schedulingheuristic

Mathematics Subject Classification ID

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

Related Items (3)

The inventory replenishment planning and staggering problem: a bi-objective approach ⋮ A heuristic approach for determining lot sizes and schedules using power-of-two policy ⋮ Heuristics for theN-product,M-stage, economic lot sizing and scheduling problem with dynamic demand

This page was built for publication: The G-group heuristic to solve the multi-product, sequencing, lot sizing and scheduling problem in flow shops