An improved algorithm for solving the economic lot size problem (ELSP)

DOI10.1080/00207549508930191zbMath0915.90144OpenAlexW2066770110WikidataQ126247388 ScholiaQ126247388MaRDI QIDQ4398956

Samuel G. Davis

Publication date: 16 June 1999

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

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

zbMATH Keywords

heuristicbounded enumerationcapacitated multi-item lot scheduling

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Finding effective schedules for the economic lot scheduling problem: A simple mixed integer programming approach

Cites Work

• Scheduling Economic Lot Size Production Runs
• The Economic Lot-Scheduling Problem: Achieving Feasibility Using Time-Varying Lot Sizes
• Computing Optimal Lot Sizes in the Economic Lot Scheduling Problem
• The Economic Lot Scheduling Problem (ELSP): Review and Extensions
• On the General Feasibility Test of Scheduling Lot Sizes for Several Products on One Machine
• A Dynamic Programming Approach to a Lot Size Scheduling Problem
• Scheduling a Multi-Product Single Machine System

This page was built for publication: An improved algorithm for solving the economic lot size problem (ELSP)