Sciweavers

66 search results - page 8 / 14
» Scenarios for Multistage Stochastic Programs
Sort
View
GECCO
2010
Springer
249views Optimization» more  GECCO 2010»
13 years 9 months ago
Towards improved dispatching rules for complex shop floor scenarios: a genetic programming approach
Developing dispatching rules for manufacturing systems is a tedious process, which is time- and cost-consuming. Since there is no good general rule for different scenarios and ob...
Torsten Hildebrandt, Jens Heger, Bernd Scholz-Reit...
WSC
2008
13 years 10 months ago
Approximate dynamic programming: Lessons from the field
Approximate dynamic programming is emerging as a powerful tool for certain classes of multistage stochastic, dynamic problems that arise in operations research. It has been applie...
Warren B. Powell
IJCAI
2003
13 years 9 months ago
Scenario-based Stochastic Constraint Programming
To model combinatorial decision problems involving uncertainty and probability, we extend the stochastic constraint programming framework proposed in [Walsh, 2002] along a number ...
Suresh Manandhar, Armagan Tarim, Toby Walsh
ICEIS
2009
IEEE
14 years 2 months ago
A Service Composition Framework for Decision Making under Uncertainty
Proposed and developed is a service composition framework for decision-making under uncertainty, which is applicable to stochastic optimization of supply chains. Also developed is ...
Malak Al-Nory, Alexander Brodsky, Hadon Nash
IOR
2010
86views more  IOR 2010»
13 years 6 months ago
Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Random Recourse
This paper introduces disjunctive decomposition for two-stage mixed 0-1 stochastic integer programs (SIPs) with random recourse. Disjunctive decomposition allows for cutting plane...
Lewis Ntaimo