A note on linear programming and the single machine lot size scheduling problem

DOI10.1080/00207548608919778zbMath0595.90042OpenAlexW2053363221MaRDI QIDQ3727726

Thom J. Hodgson, Henry L. W. Nuttle

Publication date: 1986

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

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

zbMATH Keywords

single machinelot size schedulingoptimal lengthssequence of production runs

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Cites Work

• Lower bounds for the economic lot scheduling problem using aggregation
• The Two-Product, Single-Machine, Static Demand, Infinite Horizon Lot Scheduling Problem
• Lot Sizing and Sequencing for N Products on One Facility
• Production Runs for Multiple Products: The Two-Product Heuristic
• The Economic Lot Scheduling Problem (ELSP): Review and Extensions
• On the General Feasibility Test of Scheduling Lot Sizes for Several Products on One Machine

This page was built for publication: A note on linear programming and the single machine lot size scheduling problem