A Fast Computational Procedure to Solve the Multi-Item Single Machine Lot Scheduling Optimization Problem: The Average Cost Case
DOI10.1287/MOOR.25.3.455.12210zbMath0977.90011OpenAlexW2141843189MaRDI QIDQ2757647
Laura S. Aragone, Roberto L. V. González
Publication date: 26 November 2001
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00073714/file/RR-2984.pdf
Bellman equationviscosity solutionquasi-variational inequalitiesnumerical solutionscheduling problemsaverage cost
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35)
This page was built for publication: A Fast Computational Procedure to Solve the Multi-Item Single Machine Lot Scheduling Optimization Problem: The Average Cost Case