A dynamic programming approach for the airport capacity allocation problem

2003 ◽  
Vol 14 (3) ◽  
pp. 235-249 ◽  
Author(s):  
P. Dell'Olmo
Keyword(s):  
Dynamic Programming ◽  
Capacity Allocation ◽  
Allocation Problem ◽  
Programming Approach ◽  
Dynamic Programming Approach ◽  
Airport Capacity

ONLINE CAPACITY PLANNING FOR REHABILITATION TREATMENTS: AN APPROXIMATE DYNAMIC PROGRAMMING APPROACH

2018 ◽  
Vol 34 (3) ◽  
pp. 381-405
Author(s):  
Ingeborg A. Bikker ◽  
Martijn R.K. Mes ◽  
Antoine Sauré ◽  
Richard J. Boucherie
Keyword(s):  
Dynamic Programming ◽  
Capacity Planning ◽  
Approximate Dynamic Programming ◽  
Capacity Allocation ◽  
Access Time ◽  
Programming Approach ◽  
Planning Problem ◽  
Dynamic Programming Approach ◽  
Negative Effect ◽  
Long Access

AbstractWe study an online capacity planning problem in which arriving patients require a series of appointments at several departments, within a certain access time target.This research is motivated by a study of rehabilitation planning practices at the Sint Maartenskliniek hospital (the Netherlands). In practice, the prescribed treatments and activities are typically booked starting in the first available week, leaving no space for urgent patients who require a series of appointments at a short notice. This leads to the rescheduling of appointments or long access times for urgent patients, which has a negative effect on the quality of care and on patient satisfaction.We propose an approach for allocating capacity to patients at the moment of their arrival, in such a way that the total number of requests booked within their corresponding access time targets is maximized. The model considers online decision making regarding multi-priority, multi-appointment, and multi-resource capacity allocation. We formulate this problem as a Markov decision process (MDP) that takes into account the current patient schedule, and future arrivals. We develop an approximate dynamic programming (ADP) algorithm to obtain approximate optimal capacity allocation policies. We provide insights into the characteristics of the optimal policies and evaluate the performance of the resulting policies using simulation.

Modeling M Warehouse N Manpower-Team Allocation Problem Using Dynamic Programming Approach

2019 ◽  
Vol 10 (4) ◽  
pp. 100-112
Author(s):  
Mohit Goswami
Keyword(s):  
Dynamic Programming ◽  
Performance Measure ◽  
Allocation Problem ◽  
Programming Approach ◽  
Problem Structure ◽  
Detailed Model ◽  
Dynamic Programming Approach ◽  
Workforce Allocation ◽  
Study Results ◽  
Dynamic Programming Problem

In this research, a dynamic programming-based approach is deployed to model and solve the manpower allocation problem for warehouses. The authors specifically evolve the detailed model for M warehouses and N teams (available for allocation to these warehouses). Profitability is considered as a performance measure for the allocation problem. The warehouses and manpower-team are modelled as stages and states respectively within the dynamic programming problem structure. Owing to the rather abstract nature of such allocation problems possessing Markovian properties and having similarities with stage-gate type of a problem, dynamic programming approach is deployed. The study results in recommending key decisions in workforce allocation for organizations such as retailers operating multiple warehouses.

scholarly journals A Discrete-Binary Transformation of the Reliability Redundancy Allocation Problem

2015 ◽  
Vol 2015 ◽  
pp. 1-6
Author(s):  
Marco Caserta ◽  
Stefan Voß
Keyword(s):  
Dynamic Programming ◽  
Optimization Problem ◽  
Allocation Problem ◽  
Programming Approach ◽  
Redundancy Allocation Problem ◽  
Redundancy Allocation ◽  
Dynamic Programming Approach ◽  
Integer Problem ◽  
Redundancy Optimization

Given a reliability redundancy optimization problem in itsdiscreteversion, it is possible to transform such integer problem into a correspondingbinaryproblem in log-time. A simple discrete-binary transformation is presented in this paper. The proposed transformation is illustrated using an example taken from the reliability literature. An immediate implication is that a standard exact dynamic programming approach may easily solve instances to optimality that were usually only solved heuristically.

The effects of feed and energy costs on broiler farm decisions: A dynamic programming approach

2021 ◽  
Author(s):  
Samantha L. Padilla ◽  
Lenis Saweda O. Liverpool‐Tasie ◽  
Robert J. Myers
Keyword(s):  
Dynamic Programming ◽  
Programming Approach ◽  
Energy Costs ◽  
Dynamic Programming Approach ◽  
Broiler Farm

A Dynamic Programming Approach to Optimal Lane Merging of Connected and Autonomous Vehicles

2020 ◽  
Author(s):  
Shang-Chien Lin ◽  
Hsiang Hsu ◽  
Yi-Ting Lin ◽  
Chung-Wei Lin ◽  
Iris Hui-Ru Jiang ◽  
...  
Keyword(s):  
Dynamic Programming ◽  
Autonomous Vehicles ◽  
Programming Approach ◽  
Dynamic Programming Approach
Sign in / Sign up

Export Citation Format

Share Document