Single-pass and approximate dynamic-programming algorithms for order acceptance and capacity planning

DOI10.1007/s10732-008-9096-9zbMath1190.90259OpenAlexW2157368965MaRDI QIDQ964848

Roel Leus, Jade Herbots, Willy S. Herroelen

Publication date: 21 April 2010

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-008-9096-9

zbMATH Keywords

simulationapproximate dynamic programmingmulti-projectorder acceptancecapacity planning

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39)

Related Items (1)

Revenue management for operations with urgent orders

Cites Work

• Looking ahead with the pilot method
• Project network models with discounted cash flows a guided tour through recent developments
• Finite-capacity scheduling-based planning for revenue-based capacity management
• Project scheduling. A research handbook.
• Workload based order acceptance in job shop environments
• Rollout algorithms for stochastic scheduling problems
• A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
• Dynamic Portfolio Selection of NPD Programs Using Marginal Returns
• Dynamic order acceptance and capacity planning on a single bottleneck resource
• Unnamed Item
• Unnamed Item

This page was built for publication: Single-pass and approximate dynamic-programming algorithms for order acceptance and capacity planning