The G-group heuristic for single machine lot scheduling

DOI10.1080/00207548708919847zbMath0618.90043OpenAlexW2006447476MaRDI QIDQ3755218

Fayez F. Boctor

Publication date: 1987

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

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

zbMATH Keywords

heuristicsingle-machine, multi-product, infinite-horizon, lot scheduling problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (8)

The inventory replenishment planning and staggering problem: a bi-objective approach ⋮ Solving the economic lot scheduling problem with multiple facilities in parallel using the time-varying lot sizes approach ⋮ The economic lot scheduling problem under extended basic period and power-of-two policy ⋮ The economic lot scheduling problem without capacity constraints ⋮ The economic lot scheduling problem under power-of-two policy ⋮ The peak load minimization problem in cyclic production ⋮ Heuristics for theN-product,M-stage, economic lot sizing and scheduling problem with dynamic demand ⋮ Hybrid genetic algorithm for the economic lot-scheduling problem

Cites Work

• Unnamed Item
• The Two-Product, Single-Machine, Static Demand, Infinite Horizon Lot Scheduling Problem
• On the Feasibility of Scheduling Lot Sizes for Two Products on One Machine
• Production Runs for Multiple Products: The Two-Product Heuristic
• The Economic Lot Scheduling Problem (ELSP): Review and Extensions
• A Dynamic Programming Approach to a Lot Size Scheduling Problem
• Scheduling a Multi-Product Single Machine System

This page was built for publication: The G-group heuristic for single machine lot scheduling