Keyword: programming: dynamic

Found 2342 papers in total
Approximate dynamic programming for an inventory problem: Empirical comparison
Approximate dynamic programming for an inventory problem: Empirical comparison
2011,
This study investigates the application of learning‐based and...
Time aggregated Markov decision processes via standard dynamic programming
Time aggregated Markov decision processes via standard dynamic programming
2011,
This note addresses the time aggregation approach to ergodic finite state Markov...
Airport runway scheduling
Airport runway scheduling
2011,
Airport runway optimization is an ongoing challenge for air traffic controllers. Since...
Modeling the manager's match‐or‐wait dilemma in a make‐to‐forecast production situation
Modeling the manager's match‐or‐wait dilemma in a make‐to‐forecast production situation
2009,
The make‐to‐forecast manufacturing environment is characterized by the...
An O(T 3) algorithm for the capacitated lot sizing problem with minimum order quantities
An O(T 3) algorithm for the capacitated lot sizing problem with minimum order quantities
2011,
This paper explores a single‐item capacitated lot sizing problem with minimum...
Linear programming based decomposition methods for inventory distribution systems
Linear programming based decomposition methods for inventory distribution systems
2011,
We consider an inventory distribution system consisting of one warehouse and multiple...
Solving Talent Scheduling with Dynamic Programming
Solving Talent Scheduling with Dynamic Programming
2011,
We give a dynamic programming solution to the problem of scheduling scenes to minimize...
Dynamic tax depreciation strategies
Dynamic tax depreciation strategies
2011,
The tax depreciation decision potentially has significant impact on the profitability...
Routing and Staffing in Large‐Scale Service Systems: The Case of Homogeneous Impatient Customers and Heterogeneous Servers
Routing and Staffing in Large‐Scale Service Systems: The Case of Homogeneous Impatient Customers and Heterogeneous Servers
2011,
An important problem in the theory of dynamic programming is that of characterizing...
Average Cost Single‐Stage Inventory Models: An Analysis Using a Vanishing Discount Approach
Average Cost Single‐Stage Inventory Models: An Analysis Using a Vanishing Discount Approach
2011,
An important problem in the theory of dynamic programming is that of characterizing...
The Adaptive Knapsack Problem with Stochastic Rewards
The Adaptive Knapsack Problem with Stochastic Rewards
2011,
Given a set of items with associated deterministic weights and random rewards, the...
Planning product design refreshes with service contract and competition considerations
Planning product design refreshes with service contract and competition considerations
2010,
Product design refresh programs are critical to maintaining or increasing market share...
A job‐shop problem with one additional resource type
A job‐shop problem with one additional resource type
2011,
We consider a job‐shop scheduling problem with n jobs and the constraint that...
Exploring options for farm‐level strategic and tactical decision‐making in fruit production systems of South Patagonia, Argentina
Exploring options for farm‐level strategic and tactical decision‐making in fruit production systems of South Patagonia, Argentina
2008,
In South Patagonia, Argentina, sweet cherry is the main fruit‐tree crop grown...
Optimal management of molds in stored corn
Optimal management of molds in stored corn
2008,
Long term storage of corn is becoming more common due to the recent increase in the...
Use of a dynamic programming model to estimate the value of clinical mastitis treatment and prevention options utilized by dairy producers
Use of a dynamic programming model to estimate the value of clinical mastitis treatment and prevention options utilized by dairy producers
2008,
This study discusses and demonstrates the construction and application of a specially...
Exact Algorithms for L(2,1)‐Labeling of Graphs
Exact Algorithms for L(2,1)‐Labeling of Graphs
2011,
The notion of distance constrained graph labelings, motivated by the Frequency...
A Dynamic Programming Heuristic for the Vehicle Routing Problem with Time Windows and European Community Social Legislation
A Dynamic Programming Heuristic for the Vehicle Routing Problem with Time Windows and European Community Social Legislation
2010,
In practice, apart from the problem of vehicle routing, schedulers also face the...
Algorithms for Scheduling Runway Operations Under Constrained Position Shifting
Algorithms for Scheduling Runway Operations Under Constrained Position Shifting
2010,
The efficient operation of airports, and runways in particular, is critical to the...
Restricted dynamic programming based neighborhoods for the hop‐constrained minimum spanning tree problem
Restricted dynamic programming based neighborhoods for the hop‐constrained minimum spanning tree problem
2011,
In this paper we develop, study and test new neighborhood structures for the...
An algorithm for sequential tail value at risk for path-independent payoffs in a binomial tree
An algorithm for sequential tail value at risk for path-independent payoffs in a binomial tree
2010,
We present an algorithm that determines Sequential Tail Value at Risk (STVaR) for...
Performance of the Equivalent Reservoir Modelling Technique for Multi‐Reservoir Hydropower Systems
Performance of the Equivalent Reservoir Modelling Technique for Multi‐Reservoir Hydropower Systems
2010,
This paper investigates the validity of a simplified equivalent reservoir...
Allocation of hospital capacity to multiple types of patients
Allocation of hospital capacity to multiple types of patients
2010,
Allocation of a limited capacity of resources among several customer types is a...
Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming
Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming
2010,
This paper addresses the non-preemptive single machine scheduling problem to minimize...
Papers per page: