A unifying approximate dynamic programming model for the economic lot scheduling problem

DOI10.1287/MOOR.2013.0607MaRDI QIDQ5169705zbMATH OpenOpenAlexFDO

Authors Daniel Adelman, Christiane Barz

Publication date 11 July 2014

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/79ca12abb9cf57ac804a7ec69e87ba8fdc6b45bd

zbMATH Keywords

approximate dynamic programmingeconomic lot scheduling problemsemi-Markov decision processsequence-dependent setups

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)

Recommendations

• scientific article; zbMATH DE number 90002
• Computing Optimal Lot Sizes in the Economic Lot Scheduling Problem
• The economic lot scheduling problem under power-of-two policy
• The economic lot scheduling problem -- survey and LP-based method
• An improved algorithm for solving the economic lot size problem (ELSP): A note

Cited in

(9)

• Relationship between least squares Monte Carlo and approximate linear programming
• A polyhedral approach to online bipartite matching
• The economic lot scheduling problem -- survey and LP-based method
• A profit-maximizing economic lot scheduling problem with price optimization
• Dynamic programming approximation algorithms for the capacitated lot-sizing problem
• A Polyhedral Approach to Online Bipartite Matching
• scientific article; zbMATH DE number 5151908 (Why is no real title available?)
• Network-based approximate linear programming for discrete optimization
• Reductions of non-separable approximate linear programs for network revenue management

This page was built for publication: A unifying approximate dynamic programming model for the economic lot scheduling problem

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