Lower bounds for the economic lot scheduling problem using aggregation

DOI10.1016/0377-2217(84)90234-0zbMath0557.90015OpenAlexW1982688742MaRDI QIDQ761933

Sven Axsäter

Publication date: 1984

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(84)90234-0

zbMATH Keywords

aggregationcyclical production patternseconomic lot schedulingefficient lower bounds

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Dynamic programming (90C39) Economic growth models (91B62)

Related Items (4)

A note on linear programming and the single machine lot size scheduling problem ⋮ State aggregation in dynamic programming - an application to scheduling of independent jobs on parallel processors ⋮ A hybrid heuristic and linear programming approach to multi-product machine scheduling ⋮ An extension of the extended basic period approach for economic lot scheduling problems

Cites Work

• The Economic Lot Scheduling Problem (ELSP): Review and Extensions
• A Dynamic Programming Approach to a Lot Size Scheduling Problem

This page was built for publication: Lower bounds for the economic lot scheduling problem using aggregation