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

DOI10.1023/A:1022682711077MaRDI QIDQ1357521zbMATH OpenOpenAlexFDO

Authors L. S. Aragone, R. L. V. González

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

optimal schedulingquasi-variational inequalitiesBellman equationmulti-item single machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• A fast computational procedure to solve the multi-item single machine lot scheduling optimization problem: The average cost case
• scientific article; zbMATH DE number 3947982
• A Dynamic Programming Solution to the Dynamic, Multi-Item, Single-Machine Scheduling Problem
• The discrete lot-sizing and scheduling problem
• The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming

Cites work

• scientific article; zbMATH DE number 433058 (Why is no real title available?)
• scientific article; zbMATH DE number 53999 (Why is no real title available?)
• scientific article; zbMATH DE number 3505708 (Why is no real title available?)
• scientific article; zbMATH DE number 3581179 (Why is no real title available?)
• scientific article; zbMATH DE number 3365084 (Why is no real title available?)
• Approximate solutions of the Bellman equation of deterministic control theory
• Approximation schemes for viscosity solutions of Hamilton-Jacobi equations
• 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
• On unbounded solutions of Bellman's equation associated with optimal switching control problems with state constraints
• Optimal Switching for Ordinary Differential Equations
• Some Estimates for Finite Difference Approximations

Cited in

(4)

• scientific article; zbMATH DE number 433058 (Why is no real title available?)
• Multi-Item Single-Machine Scheduling with Material Supply Constraints
• A SINGLE-MACHINE MULTI-PRODUCT LOT SCHEDULING PROBLEM WITH CONSIDERATION OF PRODUCT-DEPENDENT TRANSPORTATION
• A fast computational procedure to solve the multi-item single machine lot scheduling optimization problem: The average cost case

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1357521)