An approximate dynamic programming approach for <scp>production‐delivery</scp> scheduling under non‐stationary demand

DOI10.1002/nav.22037zbMath1523.90176MaRDI QIDQ6051574

Hai-Tao Liu, Yuan Wang, Ek Peng Chew, Loo Hay Lee

Publication date: 20 October 2023

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

zbMATH Keywords

machine schedulingnon-stationary demandapproximate dynamic programmingdelivery schedulingfixed vehicle departure time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)

Cites Work

• Coordination of production and interstage batch delivery with outsourced distribution
• Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming
• Novel time-space network flow formulation and approximate dynamic programming approach for the crane scheduling in a coil warehouse
• A unified framework for stochastic optimization
• Minimizing earliness and tardiness costs in stochastic scheduling
• On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time
• Almost sure asymptotic optimality for online routing and machine scheduling problems
• Integrated Production and Outbound Distribution Scheduling: Review and Extensions
• Simulation-Based Approximate Policy Iteration with Generalized Logistic Functions
• Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms
• Approximate Dynamic Programming
• Integrated Production, Inventory and Delivery Problems: Complexity and Algorithms
• Scheduling

This page was built for publication: An approximate dynamic programming approach for <scp>production‐delivery</scp> scheduling under non‐stationary demand