A Unifying Approximate Dynamic Programming Model for the Economic Lot Scheduling Problem
From MaRDI portal
Publication:5169705
DOI10.1287/moor.2013.0607zbMath1291.90087OpenAlexW2145848812MaRDI QIDQ5169705
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
semi-Markov decision processapproximate dynamic programmingsequence-dependent setupseconomic lot scheduling problem
Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)
Related Items (6)
Dynamic programming approximation algorithms for the capacitated lot-sizing problem ⋮ A Polyhedral Approach to Online Bipartite Matching ⋮ Reductions of non-separable approximate linear programs for network revenue management ⋮ Relationship between least squares Monte Carlo and approximate linear programming ⋮ Network-Based Approximate Linear Programming for Discrete Optimization ⋮ A polyhedral approach to online bipartite matching
This page was built for publication: A Unifying Approximate Dynamic Programming Model for the Economic Lot Scheduling Problem
