Fast computational procedure for solving multi-item single-machine lot scheduling optimzation problems

DOI10.1023/A:1022682711077zbMath0886.90086OpenAlexW175522741MaRDI QIDQ1357521

Roberto L. V. González, Laura S. Aragone

Publication date: 10 June 1997

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022682711077

zbMATH Keywords

Bellman equationquasi-variational inequalitiesoptimal schedulingmulti-item single machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation schemes for viscosity solutions of Hamilton-Jacobi equations
• Approximate solutions of the Bellman equation of deterministic control theory
• On unbounded solutions of Bellman's equation associated with optimal switching control problems with state constraints
• Discrete maximum principle for finite-difference operators
• Hamilton-Jacobi Equations with State Constraints
• On Deterministic Control Problems: an Approximation Procedure for the Optimal Cost II. The Nonstationary Case
• Optimal Switching for Ordinary Differential Equations
• Some Estimates for Finite Difference Approximations

This page was built for publication: Fast computational procedure for solving multi-item single-machine lot scheduling optimzation problems