You searched for +publisher:"University of Texas – Austin" +contributor:("Hasenbein, John J.")
.
Showing records 1 – 30 of
47 total matches.
◁ [1] [2] ▶

University of Texas – Austin
1.
Zhu, Meimeizi.
Control of a three-class fluid model with routing.
Degree: MSin Engineering, Operations Research and Industrial Engineering, 2013, University of Texas – Austin
URL: http://hdl.handle.net/2152/24082
► Differentiating borderline personality disorder from bipolar disorder using the Rorschach Inkblot Test This report studies the routing and scheduling control strategy of a three-class fluid…
(more)
▼ Differentiating borderline personality disorder from bipolar disorder using the Rorschach Inkblot Test This report studies the routing and scheduling control strategy of a three-class fluid model. A numerical approximation under the [mathematical symbol] scheduling policy is used. Analytical rules are provided to narrow down the optimal strategy under the policy. Numerical results and sensitivity analyses are presented to show how different control strategies perform given different parameters.
Advisors/Committee Members: Hasenbein, John J. (advisor).
Subjects/Keywords: Fluid model
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Zhu, M. (2013). Control of a three-class fluid model with routing. (Masters Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/24082
Chicago Manual of Style (16th Edition):
Zhu, Meimeizi. “Control of a three-class fluid model with routing.” 2013. Masters Thesis, University of Texas – Austin. Accessed March 02, 2021.
http://hdl.handle.net/2152/24082.
MLA Handbook (7th Edition):
Zhu, Meimeizi. “Control of a three-class fluid model with routing.” 2013. Web. 02 Mar 2021.
Vancouver:
Zhu M. Control of a three-class fluid model with routing. [Internet] [Masters thesis]. University of Texas – Austin; 2013. [cited 2021 Mar 02].
Available from: http://hdl.handle.net/2152/24082.
Council of Science Editors:
Zhu M. Control of a three-class fluid model with routing. [Masters Thesis]. University of Texas – Austin; 2013. Available from: http://hdl.handle.net/2152/24082

University of Texas – Austin
2.
Wang, Shaochen.
Discrete event simulation analysis on multiple class single server queueing system with abandonments and promotions.
Degree: MSin Engineering, Operations Research and Industrial Engineering, 2019, University of Texas – Austin
URL: http://hdl.handle.net/2152/72833
► In the United States, the Model for End-Stage Liver Disease (MELD) scoring system is implemented to rank patients that are on the liver transplantation waiting…
(more)
▼ In the United States, the Model for End-Stage Liver Disease (MELD) scoring system is implemented to rank patients that are on the liver transplantation waiting list. However, this system is too complex to be directly analyzed. Thus, a multiple class single server queueing model with abandonments and promotions is developed as a simplified version of the original system. The queueing model is analyzed using discrete event simulation. In general, the simulation results indicate that the [rho alpha] rule and the c / [alpha] rule seem to hold for minimizing the system abandonment rate and the total holding cost respectively. While the r [alpha] rule does not seem to hold for maximizing the system reward.
Advisors/Committee Members: Hasenbein, John J. (advisor).
Subjects/Keywords: Queueing model; Discrete event simulation; Model for End-Stage Liver Disease; MELD; Liver transplant waiting list; Queueing system; Multiple class queueing system
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Wang, S. (2019). Discrete event simulation analysis on multiple class single server queueing system with abandonments and promotions. (Masters Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/72833
Chicago Manual of Style (16th Edition):
Wang, Shaochen. “Discrete event simulation analysis on multiple class single server queueing system with abandonments and promotions.” 2019. Masters Thesis, University of Texas – Austin. Accessed March 02, 2021.
http://hdl.handle.net/2152/72833.
MLA Handbook (7th Edition):
Wang, Shaochen. “Discrete event simulation analysis on multiple class single server queueing system with abandonments and promotions.” 2019. Web. 02 Mar 2021.
Vancouver:
Wang S. Discrete event simulation analysis on multiple class single server queueing system with abandonments and promotions. [Internet] [Masters thesis]. University of Texas – Austin; 2019. [cited 2021 Mar 02].
Available from: http://hdl.handle.net/2152/72833.
Council of Science Editors:
Wang S. Discrete event simulation analysis on multiple class single server queueing system with abandonments and promotions. [Masters Thesis]. University of Texas – Austin; 2019. Available from: http://hdl.handle.net/2152/72833

University of Texas – Austin
3.
-2213-7353.
Comparison of prediction methods for batter-pitcher matchups.
Degree: MSin Engineering, Operations research and industrial engineering, 2016, University of Texas – Austin
URL: http://hdl.handle.net/2152/45747
► Baseball is full of confrontations and these confrontations between a batter and the pitcher is what makes the game. If a formula would be able…
(more)
▼ Baseball is full of confrontations and these confrontations between a batter and the pitcher is what makes the game. If a formula would be able to predict the probability of the outcome correctly, when they meet, wouldn’t it instill confidence in the minds of the head coach (or you if you are playing the fantasy) to select someone who would be on the winning end? We would like to know for sure, which of our batters are good, and what out of the small amount of possible outcomes, will be the result when he faces this other good pitcher from the team you face next. It seems the past performance of the batter against this pitcher can be a good indicator, and that is what presumably the methods currently used utilize. But the utility of the Batter vs. Pitcher data in predicting the future outcome is a debate going on for quite a time now. The reason for this debate stems from the fact that the sample size of this data is so small that it becomes hard to comprehend when to prefer information you get from a sample size of thousands of atbats against all pitchers vs. maybe a few dozen against specific individuals. The report will discuss one of the famous methods, called Log5 [1] that has been utilized so far when it comes to measuring the outcomes of these confrontations. It also discusses the other methods like logistic regression based on the past data and the new and upcoming Morey-Z. [3]
Advisors/Committee Members: Bickel, J. Eric (advisor), Hasenbein, John J. (advisor).
Subjects/Keywords: Baseball; Batter; Pitcher; Matchups; Log5; Logistic regression; Morey-Z; Batter-pitcher matchups; Hitter; PvP; Baseball confrontation
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
-2213-7353. (2016). Comparison of prediction methods for batter-pitcher matchups. (Masters Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/45747
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Chicago Manual of Style (16th Edition):
-2213-7353. “Comparison of prediction methods for batter-pitcher matchups.” 2016. Masters Thesis, University of Texas – Austin. Accessed March 02, 2021.
http://hdl.handle.net/2152/45747.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
MLA Handbook (7th Edition):
-2213-7353. “Comparison of prediction methods for batter-pitcher matchups.” 2016. Web. 02 Mar 2021.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Vancouver:
-2213-7353. Comparison of prediction methods for batter-pitcher matchups. [Internet] [Masters thesis]. University of Texas – Austin; 2016. [cited 2021 Mar 02].
Available from: http://hdl.handle.net/2152/45747.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Council of Science Editors:
-2213-7353. Comparison of prediction methods for batter-pitcher matchups. [Masters Thesis]. University of Texas – Austin; 2016. Available from: http://hdl.handle.net/2152/45747
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

University of Texas – Austin
4.
Liao, Melody.
A numerical study of single-machine multiple-recipe predictive maintenance.
Degree: MSin Engineering, Operations Research and Industrial Engineering, 2011, University of Texas – Austin
URL: http://hdl.handle.net/2152/ETD-UT-2011-05-3320
► Effective machine maintenance policy is a critical element of a smooth running manufacturing system. This paper evaluates a multiple-recipe predictive maintenance problem modeled using a…
(more)
▼ Effective machine maintenance policy is a critical element of a smooth running manufacturing system. This paper evaluates a multiple-recipe predictive maintenance problem modeled using a M/G/1 queueing system. A numerical study is performed on an optimal predictive maintenance policy. A simulated job-based maintenance policy is used as a baseline for the optimal policy. We investigate the effects of varying degradation rates, holding costs, preventive maintenance times, and preventive maintenance costs. We also examine a two-recipe problem.
Advisors/Committee Members: Hasenbein, John J. (advisor), Kutanoglu, Erhan (committee member).
Subjects/Keywords: Machine maintenance; Maintenance policy; Predictive maintenance
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Liao, M. (2011). A numerical study of single-machine multiple-recipe predictive maintenance. (Masters Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2011-05-3320
Chicago Manual of Style (16th Edition):
Liao, Melody. “A numerical study of single-machine multiple-recipe predictive maintenance.” 2011. Masters Thesis, University of Texas – Austin. Accessed March 02, 2021.
http://hdl.handle.net/2152/ETD-UT-2011-05-3320.
MLA Handbook (7th Edition):
Liao, Melody. “A numerical study of single-machine multiple-recipe predictive maintenance.” 2011. Web. 02 Mar 2021.
Vancouver:
Liao M. A numerical study of single-machine multiple-recipe predictive maintenance. [Internet] [Masters thesis]. University of Texas – Austin; 2011. [cited 2021 Mar 02].
Available from: http://hdl.handle.net/2152/ETD-UT-2011-05-3320.
Council of Science Editors:
Liao M. A numerical study of single-machine multiple-recipe predictive maintenance. [Masters Thesis]. University of Texas – Austin; 2011. Available from: http://hdl.handle.net/2152/ETD-UT-2011-05-3320

University of Texas – Austin
5.
Gurfein, Kate Elizabeth.
Evaluation of basis functions for generating approximate linear programming (ALP) average cost solutions and policies for multiclass queueing networks.
Degree: MSin Engineering, Operations Research & Industrial Engineering, 2012, University of Texas – Austin
URL: http://hdl.handle.net/2152/ETD-UT-2012-05-5441
► The average cost of operating a queueing network depends on several factors such as the complexity of the network and the service policy used. Approximate…
(more)
▼ The average cost of operating a queueing network depends on several factors such as the complexity of the network and the service policy used. Approximate linear programming (ALP) is a method that can be used to compute an accurate lower bound on the optimal average cost as well as generate policies to be used in operating the network. These average cost solutions and policies are dependent on the type of basis function used in the ALP. In this paper, the ALP average cost solutions and policies are analyzed for twelve networks with four different types of basis functions (quadratic, linear, pure exponential, and mixed exponential). An approximate bound on the optimality gap between the ALP average cost solution and the optimal average cost solution is computed for each system, and the size of this bound is determined relative to the ALP average cost solution. Using the same set of networks, the performance of ALP generated policies are compared to the performance of the heuristic policies first-buffer-first-served (FBFS), last-buffer-first-served (LBFS), highest-queue-first-served (HQFS), and random-queue-first-served (RQFS). In general, ALP generated average cost solutions are considerably smaller than the simulated average cost under the corresponding policy, and therefore the approximate bounds on the optimality gaps are quite large. This bound increases with the complexity of the queueing network. Some ALP generated policies are not stabilizing policies for their corresponding networks, especially those produced using pure exponential and mixed exponential basis functions. For almost all systems, at least one of the heuristic policies results in mean average cost less than or nearly equal to the smallest mean average cost of all ALP generated policies in simulation runs. This means that generally there exists a heuristic policy which can perform as well as or better than any ALP generated policy. In conclusion, a useful bound on the optimality gap between the ALP average cost solution and the optimal average cost solution cannot be computed with this method. Further, heuristic policies, which are more computationally tractable than ALP generated policies, can generally match or exceed the performance of ALP generated policies, and thus computing such policies is often unnecessary for realizing cost benefits in queueing networks.
Advisors/Committee Members: Hasenbein, John J. (advisor), Morton, David P. (committee member).
Subjects/Keywords: Approximate linear programming; ALP; Multiclass queueing networks; Dynamic programming; Optimal policy; Optimality gap
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Gurfein, K. E. (2012). Evaluation of basis functions for generating approximate linear programming (ALP) average cost solutions and policies for multiclass queueing networks. (Masters Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2012-05-5441
Chicago Manual of Style (16th Edition):
Gurfein, Kate Elizabeth. “Evaluation of basis functions for generating approximate linear programming (ALP) average cost solutions and policies for multiclass queueing networks.” 2012. Masters Thesis, University of Texas – Austin. Accessed March 02, 2021.
http://hdl.handle.net/2152/ETD-UT-2012-05-5441.
MLA Handbook (7th Edition):
Gurfein, Kate Elizabeth. “Evaluation of basis functions for generating approximate linear programming (ALP) average cost solutions and policies for multiclass queueing networks.” 2012. Web. 02 Mar 2021.
Vancouver:
Gurfein KE. Evaluation of basis functions for generating approximate linear programming (ALP) average cost solutions and policies for multiclass queueing networks. [Internet] [Masters thesis]. University of Texas – Austin; 2012. [cited 2021 Mar 02].
Available from: http://hdl.handle.net/2152/ETD-UT-2012-05-5441.
Council of Science Editors:
Gurfein KE. Evaluation of basis functions for generating approximate linear programming (ALP) average cost solutions and policies for multiclass queueing networks. [Masters Thesis]. University of Texas – Austin; 2012. Available from: http://hdl.handle.net/2152/ETD-UT-2012-05-5441

University of Texas – Austin
6.
-5319-9514.
Traffic signal control using queueing theory.
Degree: MSin Statistics, Statistics, 2018, University of Texas – Austin
URL: http://hdl.handle.net/2152/67640
► Traffic signal control has drawn considerable attention in the literatures thanks to its ability to improve the mobility of urban networks. Queueing models are capable…
(more)
▼ Traffic signal control has drawn considerable attention in the literatures thanks to its ability to improve the mobility of urban networks. Queueing models are capable of capturing performance or effectiveness of a queueing system. In this report, SOCPs (second order cone program) are proposed based on different queueing models as pre-timed signal control techniques to minimize total travel delay. Stochastic programs are developed in order to handle the uncertainties in the arrival rates. In addition, the superiority of the proposed model over Webster’s model has been validated in a microscopic traffic simulation software named CORSIM.
Advisors/Committee Members: Hasenbein, John J. (advisor), Machemehl, Randy B. (advisor).
Subjects/Keywords: Traffic signal control; Queueing theory; Queueing models; Urban network mobility; Queueing systems; Second order cone program; Pre-timed signal control techniques; Arrival rate uncertainty; Webster’s model
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
-5319-9514. (2018). Traffic signal control using queueing theory. (Masters Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/67640
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Chicago Manual of Style (16th Edition):
-5319-9514. “Traffic signal control using queueing theory.” 2018. Masters Thesis, University of Texas – Austin. Accessed March 02, 2021.
http://hdl.handle.net/2152/67640.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
MLA Handbook (7th Edition):
-5319-9514. “Traffic signal control using queueing theory.” 2018. Web. 02 Mar 2021.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Vancouver:
-5319-9514. Traffic signal control using queueing theory. [Internet] [Masters thesis]. University of Texas – Austin; 2018. [cited 2021 Mar 02].
Available from: http://hdl.handle.net/2152/67640.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Council of Science Editors:
-5319-9514. Traffic signal control using queueing theory. [Masters Thesis]. University of Texas – Austin; 2018. Available from: http://hdl.handle.net/2152/67640
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
7.
Lu, Fang, active 21st century.
Modeling and optimization for spatial detection to minimize abandonment rate.
Degree: PhD, Operations Research & Industrial Engineering, 2014, University of Texas – Austin
URL: http://hdl.handle.net/2152/25998
► Some oil and gas companies are drilling and developing fields in the Arctic Ocean, which has an environment with sea ice called ice floes. These…
(more)
▼ Some oil and gas companies are drilling and developing fields in the Arctic Ocean, which has an environment with sea ice called ice floes. These companies must protect their platforms from ice floe collisions. One proposal is to use a system that consists of autonomous underwater vehicles (AUVs) and docking stations. The AUVs measure the under-water topography of the ice floes, while the docking stations launch the AUVs and recharge their batteries. Given resource constraints, we optimize quantities and locations for the docking stations and the AUVs, as well as the AUV scheduling policies, in order to provide the maximum protection level for the platform. We first use an queueing approach to model the problem as a queueing system with abandonments, with the objective to minimize the abandonment probability. Both M/M/k+M and M/G/k+G queueing approximations are applied and we also develop a detailed simulation model based on the queueing approximation. In a complementary approach, we model the system using a multi-stage stochastic facility location problem in order to optimize the docking station locations, the AUV allocations, and the scheduling policies of the AUVs. A two-stage stochastic facility location problem and several efficient online scheduling heuristics are developed to provide lower bounds and upper bounds for the multi-stage model, and also to solve large-scale instances of the optimization model. Even though the model is motivated by an oil industry project, most of the modeling and optimization methods apply more broadly to any radial detection problems with queueing dynamics.
Advisors/Committee Members: Morton, David P. (advisor), Hasenbein, John J. (advisor).
Subjects/Keywords: Spatial detection; Queues with abandonments; Simulation; Stochastic programming; Multi-stage stochastic facility location problem; Scheduling heuristics
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Lu, Fang, a. 2. c. (2014). Modeling and optimization for spatial detection to minimize abandonment rate. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/25998
Chicago Manual of Style (16th Edition):
Lu, Fang, active 21st century. “Modeling and optimization for spatial detection to minimize abandonment rate.” 2014. Doctoral Dissertation, University of Texas – Austin. Accessed March 02, 2021.
http://hdl.handle.net/2152/25998.
MLA Handbook (7th Edition):
Lu, Fang, active 21st century. “Modeling and optimization for spatial detection to minimize abandonment rate.” 2014. Web. 02 Mar 2021.
Vancouver:
Lu, Fang a2c. Modeling and optimization for spatial detection to minimize abandonment rate. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2014. [cited 2021 Mar 02].
Available from: http://hdl.handle.net/2152/25998.
Council of Science Editors:
Lu, Fang a2c. Modeling and optimization for spatial detection to minimize abandonment rate. [Doctoral Dissertation]. University of Texas – Austin; 2014. Available from: http://hdl.handle.net/2152/25998
8.
-5370-2810.
Enhancing performance of reinforcement learning models in the presence of noisy rewards.
Degree: MSin Engineering, Operations Research & Industrial Engineering, 2019, University of Texas – Austin
URL: http://dx.doi.org/10.26153/tsw/2860
► Reinforcement learning models learn the optimal policy by interacting with the environment and observing the states and rewards. If the rewards that the model observes…
(more)
▼ Reinforcement learning models learn the optimal policy by interacting with the environment and observing the states and rewards. If the rewards that the model observes are noisy then learning an optimal policy becomes a difficult task. We present an approach that can enhance the performance of reinforcement learning models in the presence of noisy rewards. Along with the standard reinforcement learning model, we propose to use a noise filter which estimates the true reward that the model should receive. The noise filter is designed using a non-linear approximator. Through various experiments we demonstrate that this approach improves the performance of the model in the presence of noisy rewards
Advisors/Committee Members: Hasenbein, John J. (advisor).
Subjects/Keywords: Reinforcement learning; Q-learning; Noisy rewards
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
-5370-2810. (2019). Enhancing performance of reinforcement learning models in the presence of noisy rewards. (Masters Thesis). University of Texas – Austin. Retrieved from http://dx.doi.org/10.26153/tsw/2860
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Chicago Manual of Style (16th Edition):
-5370-2810. “Enhancing performance of reinforcement learning models in the presence of noisy rewards.” 2019. Masters Thesis, University of Texas – Austin. Accessed March 02, 2021.
http://dx.doi.org/10.26153/tsw/2860.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
MLA Handbook (7th Edition):
-5370-2810. “Enhancing performance of reinforcement learning models in the presence of noisy rewards.” 2019. Web. 02 Mar 2021.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Vancouver:
-5370-2810. Enhancing performance of reinforcement learning models in the presence of noisy rewards. [Internet] [Masters thesis]. University of Texas – Austin; 2019. [cited 2021 Mar 02].
Available from: http://dx.doi.org/10.26153/tsw/2860.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Council of Science Editors:
-5370-2810. Enhancing performance of reinforcement learning models in the presence of noisy rewards. [Masters Thesis]. University of Texas – Austin; 2019. Available from: http://dx.doi.org/10.26153/tsw/2860
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

University of Texas – Austin
9.
-2601-7604.
Decomposition and variance reduction techniques for stochastic mixed integer programs.
Degree: PhD, Operations research and industrial engineering, 2019, University of Texas – Austin
URL: http://dx.doi.org/10.26153/tsw/1058
► Obtaining upper and lower bounds on the optimal value of a stochastic integer program can require solution of multiple-scenario problems, which are computationally expensive or…
(more)
▼ Obtaining upper and lower bounds on the optimal value of a stochastic integer program can require solution of multiple-scenario problems, which are computationally expensive or intractable using off-the-shelf integer-programming software. Additionally, optimal solutions to a two-stage problem whose second stage spans long time horizons may be optimistic, due to the model's inappropriate ability to plan for future periods which are not known in practice. To that end, we present a framework for optimizing system design in the face of a restricted class of policies governing system operation, which aim to model realistic operation. This leads to a natural decomposition of the problem yielding upper and lower bounds which we can compute quickly. We illustrate these ideas using a model that seeks to design and operate a microgrid to support a forward operating base. Here, designing the microgrid includes specifying the number and type of diesel generators, PV systems, and batteries while operating the grid involves dispatching these assets to satisfy load at minimum cost. We extend our approach to solve the same problem under load and photovoltaic uncertainty, and propose a method to generate appropriately correlated scenarios by simulating building occupancy via a bottom-up approach, then using the occupancy levels to inform environmental control unit loads on the base. Finally, in a separate line of work, we optimize the design of the strata for a stratified sampling estimator to reduce variance. We extend this method to the multivariate setting by optimizing the strata for a nonuniform Latin hypercube estimator. We then present empirical results that show that our method reduces the variance of the estimator, compared to one using equal-probability strata.
Advisors/Committee Members: Hasenbein, John J. (advisor), Morton, David P. (advisor), Bard, Jonathan F (committee member), Hanasusanto, Grani A (committee member), Newman, Alexandra M (committee member).
Subjects/Keywords: Mixed integer programming; Stochastic programming; Microgrid design optimization; Variance reduction; Latin hypercube sampling; Monte Carlo simulation
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
-2601-7604. (2019). Decomposition and variance reduction techniques for stochastic mixed integer programs. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://dx.doi.org/10.26153/tsw/1058
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Chicago Manual of Style (16th Edition):
-2601-7604. “Decomposition and variance reduction techniques for stochastic mixed integer programs.” 2019. Doctoral Dissertation, University of Texas – Austin. Accessed March 02, 2021.
http://dx.doi.org/10.26153/tsw/1058.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
MLA Handbook (7th Edition):
-2601-7604. “Decomposition and variance reduction techniques for stochastic mixed integer programs.” 2019. Web. 02 Mar 2021.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Vancouver:
-2601-7604. Decomposition and variance reduction techniques for stochastic mixed integer programs. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2019. [cited 2021 Mar 02].
Available from: http://dx.doi.org/10.26153/tsw/1058.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Council of Science Editors:
-2601-7604. Decomposition and variance reduction techniques for stochastic mixed integer programs. [Doctoral Dissertation]. University of Texas – Austin; 2019. Available from: http://dx.doi.org/10.26153/tsw/1058
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

University of Texas – Austin
10.
-3880-9783.
Models and methods for operational planning in freight railroads.
Degree: PhD, Operations Research and Industrial Engineering, 2015, University of Texas – Austin
URL: http://hdl.handle.net/2152/31604
► Railroads are facing increasing demand for freight transportation. Effective planning and scheduling are crucial to improve the utilization of expensive resources (such as crew and…
(more)
▼ Railroads are facing increasing demand for freight transportation. Effective planning and scheduling are crucial to improve the utilization of expensive resources (such as crew and track), reduce operational costs, and provide on-time service. This dissertation focuses on problem modeling and solution method development for real planning problems faced by railroads. It consists of three chapters that study two important planning problems in the daily operations of U.S. freight railroads: crew assignment and train movement planning. Chapter 2 proposes an optimization model to decide crew-to-train assignments and deadheads for double-ended crew districts. We develop an effective solution approach, combining optimization and a standalone heuristic, that generates optimal solutions in minutes. The excellent performance of this solution approach makes it well-suited for implementation within a real-time decision support tool for crew dispatchers. Chapter 3 discusses crew repositioning given the uncertainty in trains’ arrival and departure times. We propose models that minimize the expected crew holding, train delay, and deadheading cost, and develop both exact and heuristic solution methods to provide insights for crew planning under train schedule uncertainty. The last chapter studies the movement planning problem for trains traveling in a territory with multiple through tracks (mainlines) and various junctions. We explore a number of heuristic algorithms to obtain good solutions within a reasonable amount of time. The contributions of this dissertation include modeling enhancements, algorithmic development, implementation and computational testing, and validation using real data.
Advisors/Committee Members: Bard, Jonathan F. (advisor), Balakrishnan, Anantaram (advisor), Dimitrov, Ned (committee member), Hasenbein, John J (committee member), Morton, David P (committee member).
Subjects/Keywords: Optimization; Railroad operational planning
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
-3880-9783. (2015). Models and methods for operational planning in freight railroads. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/31604
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Chicago Manual of Style (16th Edition):
-3880-9783. “Models and methods for operational planning in freight railroads.” 2015. Doctoral Dissertation, University of Texas – Austin. Accessed March 02, 2021.
http://hdl.handle.net/2152/31604.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
MLA Handbook (7th Edition):
-3880-9783. “Models and methods for operational planning in freight railroads.” 2015. Web. 02 Mar 2021.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Vancouver:
-3880-9783. Models and methods for operational planning in freight railroads. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2015. [cited 2021 Mar 02].
Available from: http://hdl.handle.net/2152/31604.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Council of Science Editors:
-3880-9783. Models and methods for operational planning in freight railroads. [Doctoral Dissertation]. University of Texas – Austin; 2015. Available from: http://hdl.handle.net/2152/31604
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

University of Texas – Austin
11.
-3292-7049.
Joint maintenance and production operations decision making in flexible manufacturing systems.
Degree: PhD, Operations research and industrial engineering, 2016, University of Texas – Austin
URL: http://hdl.handle.net/2152/46237
► In highly flexible and highly integrated manufacturing systems such as semiconductor manufacturing, equipment has the capability of conducting different manufacturing operations and/or producing at various…
(more)
▼ In highly flexible and highly integrated manufacturing systems such as semiconductor manufacturing, equipment has the capability of conducting different manufacturing operations and/or producing at various speeds. In such systems, degradation of a machine depends highly on the operations performed on it. Selection of operations executed on an equipment changes the degradation dynamics and hence directly affects preventive maintenance (PM) decisions. On the other hand, PM actions interrupt production and change the system reliability and equipment availability, which in turn directly affects decisions as to which operations should be performed on which piece of equipment. These strong dynamic interactions between equipment condition, operations executed on the equipment and product quality necessitate a methodology that integrates the decisions of maintenance scheduling and production operations. Currently, maintenance and production operations decision-making are two decoupled processes. To address the aforementioned problems, in this dissertation, we devise integrated decision-making policies for maintenance scheduling and production operations in flexible manufacturing systems (FMS) optimizing a customizable objective function that takes into account operation-dependent degradation models and production targets. The objective function consists of costs associated with scheduled and unscheduled maintenance, rewards for successfully completed products and penalties for missed production targets. In order to maximize the objective function, a paradigm based on metaheuristic optimization and evaluation of candidate solutions via discrete-event simulations of operations of the underlying manufacturing system is used. Firstly, we propose an operation-dependent decision-making policy for a multiple-product/multiple-equipment manufacturing system, where each product requires several operations for completion and the sequence in which different product types are produced is a priori given. The proposed method is tested in simulations of a cluster tool and the results show that operation-dependent maintenance decision-making outperforms the case where maintenance decisions are made without considerations of operation-dependent degradation dynamics. Secondly, we propose an integrated decision-making policy for maintenance scheduling and product sequencing where the sequence in which different product types can be arranged in a way to maximize the customizable profit function. The results show that jointly making maintenance and production sequencing decisions consistently and often significantly outperforms the current practice of making these decisions separately. Finally, a joint maintenance scheduling and production operations decision making policy is proposed for a flexible manufacturing system where the degradation states of the equipment are not perfectly observable, but are rather hidden states of a known Hidden Markov Model (HMM). Proposed integrated decision-making policy under imperfect degradation state…
Advisors/Committee Members: Djurdjanovic, Dragan (advisor), Chen, Frank (committee member), Hasenbein, John J (committee member), Kutanoglu, Erhan (committee member), Morton, David P (committee member).
Subjects/Keywords: Maintenance decision making; Product sequencing; Concurrent maintenance & operation decision making; POMDP; Imperfect observation
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
-3292-7049. (2016). Joint maintenance and production operations decision making in flexible manufacturing systems. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/46237
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Chicago Manual of Style (16th Edition):
-3292-7049. “Joint maintenance and production operations decision making in flexible manufacturing systems.” 2016. Doctoral Dissertation, University of Texas – Austin. Accessed March 02, 2021.
http://hdl.handle.net/2152/46237.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
MLA Handbook (7th Edition):
-3292-7049. “Joint maintenance and production operations decision making in flexible manufacturing systems.” 2016. Web. 02 Mar 2021.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Vancouver:
-3292-7049. Joint maintenance and production operations decision making in flexible manufacturing systems. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2016. [cited 2021 Mar 02].
Available from: http://hdl.handle.net/2152/46237.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Council of Science Editors:
-3292-7049. Joint maintenance and production operations decision making in flexible manufacturing systems. [Doctoral Dissertation]. University of Texas – Austin; 2016. Available from: http://hdl.handle.net/2152/46237
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
12.
-9177-9336.
Copositive programming approaches for robust optimization and Löwner-John ellipsoid problems.
Degree: PhD, Operations Research and Industrial Engineering, 2019, University of Texas – Austin
URL: http://dx.doi.org/10.26153/tsw/5342
► This thesis primarily focuses on studying the copositive programming reformulations of difficult optimization problems, using them to approximate the original problem, and comparing the performance…
(more)
▼ This thesis primarily focuses on studying the copositive programming reformulations of difficult optimization problems, using them to approximate the original problem, and comparing the performance of the resulting approximations with other approximation schemes.
We first study the robust quadratic programs where the uncertain problem parameters can contain both continuous and integer components. Under reasonable assumptions, we show that these problems are amenable to exact copositive programming reformulations. The resultant convex optimization problems are NP-hard but admit a conservative semidefinite programming (SDP) approximation that can be solved efficiently. We prove that this approximation is stronger than the popular S-Procedure for problem instances with only continuous uncertainty. We also show that all results can be extended to the two-stage robust optimization setting if the problem has complete recourse. We assess the effectiveness of our proposed SDP reformulations and demonstrate their superiority over the state-of-the-art solution schemes for least squares, project management, and multi-item newsvendor problems.
Next, we study the problem of finding Lowner-
John ellipsoid, i.e., an ellipsoid with minimum volume that contains a given convex set. We reformulate the problem as a generalized copositive program, and use that reformulation to derive tractable SDP approximations for instances where the set is defined by affine and quadratic inequalities. We prove that our method always provides an ellipsoid of the same or lower volume than the one obtained by scaling the maximum volume inscribed ellipsoid, as well as the one provided by the application of the S-procedure. We provide empirical comparisons with the exact solution scheme, as well as other state-of-the-art approximation schemes. We apply our method to find improved decision rules for two-stage robust optimization problems, and to find ellipsoidal approximations to the set of reachable states in a linear dynamical system.
The final problem that we consider is performing marginal inference in graphical models. Graphical models are used to represent probabilistic relations between different uncertain parameters. Marginal inference refers to computing the marginal distribution of each uncertain parameter in the graphical model. The complexity of exact marginal inference algorithms in graphical models is exponential in the treewidth of the underlying graph. We develop a method to perform approximate marginal inference on discrete graphical models by modifying the graph to a new graph of lower treewidth. We prove error bounds on the approximate inference solution compared to the exact solution. We formulate the problem of finding parameters of the new graph which gives the tightest error bounds as a linear program (LP). The number of constraints in the LP grows exponentially with the number of nodes. To solve this issue, we develop a row generation algorithm to solve the LP.
Advisors/Committee Members: Hanasusanto, Grani Adiwena (advisor), Boyles, Stephen (committee member), Burer, Samuel A. (committee member), Hasenbein, John J. (committee member).
Subjects/Keywords: Copositive programming; Robust optimization; Minimum volume ellipsoids; Graphical models
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
-9177-9336. (2019). Copositive programming approaches for robust optimization and Löwner-John ellipsoid problems. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://dx.doi.org/10.26153/tsw/5342
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Chicago Manual of Style (16th Edition):
-9177-9336. “Copositive programming approaches for robust optimization and Löwner-John ellipsoid problems.” 2019. Doctoral Dissertation, University of Texas – Austin. Accessed March 02, 2021.
http://dx.doi.org/10.26153/tsw/5342.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
MLA Handbook (7th Edition):
-9177-9336. “Copositive programming approaches for robust optimization and Löwner-John ellipsoid problems.” 2019. Web. 02 Mar 2021.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Vancouver:
-9177-9336. Copositive programming approaches for robust optimization and Löwner-John ellipsoid problems. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2019. [cited 2021 Mar 02].
Available from: http://dx.doi.org/10.26153/tsw/5342.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Council of Science Editors:
-9177-9336. Copositive programming approaches for robust optimization and Löwner-John ellipsoid problems. [Doctoral Dissertation]. University of Texas – Austin; 2019. Available from: http://dx.doi.org/10.26153/tsw/5342
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

University of Texas – Austin
13.
-1709-7032.
Resource allocation in service and logistics systems.
Degree: PhD, Operations Research & Industrial Engineering, 2016, University of Texas – Austin
URL: http://hdl.handle.net/2152/47042
► Resource allocation is a problem commonly encountered in strategic planning, where a typical objective is to minimize the associated cost or maximize the resulting profit.…
(more)
▼ Resource allocation is a problem commonly encountered in strategic planning, where a typical objective is to minimize the associated cost or maximize the resulting profit. It is studied analytically and numerically for service and logistics systems in this dissertation, with the major resource being people, services or trucks. First, a staffing level problem is analyzed for large-scale single-station queueing systems. The system manager operates an Erlang-C queueing system with a quality-of-service (QoS) constraint on the probability that a customer is queued. However, in this model, the arrival rate is uncertain in the sense that even the arrival-rate distribution is not completely known to the manager. Rather, the manager has an estimate of the support of the arrival-rate distribution and the mean. The goal is to determine the number of servers needed to satisfy the quality of service constraint. Two models are explored. First, the constraint is enforced on an overall delay probability, given the probability that different feasible arrival-rate distributions are selected. In the second case, the constraint has to be satisfied by every possible distribution. For both problems, asymptotically optimal solutions are developed based on Halfin-Whitt type scalings. The work is followed by a discussion on solution uniqueness with a joint QoS constraint and a given arrival-rate distribution in multi-station systems. Second, an extension to Naor’s analysis on the joining or balking problem in observable M=M=1 queues and its variant in unobservable M=M=1 queues is presented to incorporate parameter uncertainty. The arrival-rate distribution is known to all, but the exact arrival rate is unknown in both cases. The optimal joining strategies are obtained and compared from the perspectives of individual customers, the social optimizer and the profit maximizer, where differences are recognized between the results for systems with deterministic and stochastic arrival rates. Finally, an integrated ordering and inbound shipping problem is formulated for an assembly plant with a large number of suppliers. The objective is to minimize the annual total cost with a static strategy. Potential transportation modes include full truckload shipping and less than truckload shipping, the former of which allows customized routing while the latter does not. A location-based model is applied in search of near-optimal solutions instead of an exact model with vehicle routing, and numerical experiments are conducted to investigate the insights of the problem.
Advisors/Committee Members: Hasenbein, John J. (advisor), Kutanoglu, Erhan (advisor), Bickel, James E. (committee member), Khajavirad, Aida (committee member), Morrice, Douglas J. (committee member).
Subjects/Keywords: Staffing service systems; Parameter uncertainty; Game-theoretic queueing; Inbound shipping
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
-1709-7032. (2016). Resource allocation in service and logistics systems. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/47042
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Chicago Manual of Style (16th Edition):
-1709-7032. “Resource allocation in service and logistics systems.” 2016. Doctoral Dissertation, University of Texas – Austin. Accessed March 02, 2021.
http://hdl.handle.net/2152/47042.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
MLA Handbook (7th Edition):
-1709-7032. “Resource allocation in service and logistics systems.” 2016. Web. 02 Mar 2021.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Vancouver:
-1709-7032. Resource allocation in service and logistics systems. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2016. [cited 2021 Mar 02].
Available from: http://hdl.handle.net/2152/47042.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Council of Science Editors:
-1709-7032. Resource allocation in service and logistics systems. [Doctoral Dissertation]. University of Texas – Austin; 2016. Available from: http://hdl.handle.net/2152/47042
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

University of Texas – Austin
14.
-2165-4068.
Efficient sequential probability assessment heuristic in decision analysis.
Degree: PhD, Operations Research and Industrial Engineering, 2015, University of Texas – Austin
URL: http://hdl.handle.net/2152/33281
► Many decision problems involve situations where the possible outcomes are specified but the corresponding probability mass function is only partially known. In such cases, the…
(more)
▼ Many decision problems involve situations where the possible outcomes are specified but the corresponding probability mass function is only partially known. In such cases, the expected utility of an alternative is not explicitly computable and decisions are made without full information. To address this problem, previous research has tried to establish dominance, by determining if one alternative has a larger expected value or utility than other alternatives for all feasible distributions. In practice, however, dominance is rarely established directly and decision maker needs to make many probability assessments. This work addresses the difficult problem of how to efficiently make probability assessments in decision analysis with complicated uncertainties. After study of the problem, we formulate the problem of achieving dominance with least probability assessments as a dynamic decision problem that shows a huge complexity. A novel heuristic called Sequential Probability Assessment Heuristic (SPAH) is proposed to offer decision analysts a practical way to solve the problem. This method iteratively selects a feasible assessment question for decision analyst to present to the decision maker or expert for assessment in their communication. The heuristic is borrowed from machine learning and, as we show, displays some desirable properties. It performs well when applied to two canonical example decision analysis problems, Eagle Airlines, a decision whether to purchase a plane, and Wildcatter’s valuation, a decision whether to explore an oil well. Our method shows a close performance when compared to the optimal strategy that is solved with the clairvoyance of the true distribution, and a dominating performance over the current standard way of doing probability assessments. The assessment strategy generated by SPAH can also give the decision analyst more insight into the structure of the decision problem they face, as finally we will see from the two examples.
Advisors/Committee Members: Bickel, J. Eric (advisor), Dyer, James S (committee member), Hasenbein, John J (committee member), Caramanis, Constantine (committee member), Dimitrov, Nedialko (committee member).
Subjects/Keywords: Decision analysis; Sequential probability assessment; Partial information; SPAH; Orthogonal matching pursuit
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
-2165-4068. (2015). Efficient sequential probability assessment heuristic in decision analysis. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/33281
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Chicago Manual of Style (16th Edition):
-2165-4068. “Efficient sequential probability assessment heuristic in decision analysis.” 2015. Doctoral Dissertation, University of Texas – Austin. Accessed March 02, 2021.
http://hdl.handle.net/2152/33281.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
MLA Handbook (7th Edition):
-2165-4068. “Efficient sequential probability assessment heuristic in decision analysis.” 2015. Web. 02 Mar 2021.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Vancouver:
-2165-4068. Efficient sequential probability assessment heuristic in decision analysis. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2015. [cited 2021 Mar 02].
Available from: http://hdl.handle.net/2152/33281.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Council of Science Editors:
-2165-4068. Efficient sequential probability assessment heuristic in decision analysis. [Doctoral Dissertation]. University of Texas – Austin; 2015. Available from: http://hdl.handle.net/2152/33281
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

University of Texas – Austin
15.
Sisbot, Emre Arda.
Fluid and queueing networks with Gurvich-type routing.
Degree: PhD, Operations research and industrial engineering, 2015, University of Texas – Austin
URL: http://hdl.handle.net/2152/32536
► Queueing networks have applications in a wide range of domains, from call center management to telecommunication networks. Motivated by a healthcare application, in this dissertation,…
(more)
▼ Queueing networks have applications in a wide range of domains, from call center management to telecommunication networks. Motivated by a healthcare application, in this dissertation, we analyze a class of queueing and fluid networks with an additional routing option that we call Gurvich-type routing. The networks we consider include parallel buffers, each associated with a different class of entity, and Gurvich-type routing allows to control the assignment of an incoming entity to one of the classes. In addition to routing, scheduling of entities is also controlled as the classes of entities compete for service at the same station. A major theme in this work is the investigation of the interplay of this routing option with the scheduling decisions in networks with various topologies. The first part of this work focuses on a queueing network composed of two parallel buffers. We form a Markov decision process representation of this system and prove structural results on the optimal routing and scheduling controls. Via these results, we determine a near-optimal discrete policy by solving the associated fluid model along with perturbation expansions. In the second part, we analyze a single-station fluid network composed of N parallel buffers with an arbitrary N. For this network, along with structural proofs on the optimal scheduling policies, we show that the optimal routing policies are threshold-based. We then develop a numerical procedure to compute the optimal policy for any initial state. The final part of this work extends the analysis of the previous part to tandem fluid networks composed of two stations. For two different models, we provide results on the optimal scheduling and routing policies.
Advisors/Committee Members: Hasenbein, John J. (advisor), Bickel, James Eric (committee member), Cudina, Milica (committee member), Djurdjanovic, Dragan (committee member), Khajavirad, Aida (committee member).
Subjects/Keywords: Markov decision processes; Queueing theory; Optimal control; Fluid model; Scheduling; Routing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Sisbot, E. A. (2015). Fluid and queueing networks with Gurvich-type routing. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/32536
Chicago Manual of Style (16th Edition):
Sisbot, Emre Arda. “Fluid and queueing networks with Gurvich-type routing.” 2015. Doctoral Dissertation, University of Texas – Austin. Accessed March 02, 2021.
http://hdl.handle.net/2152/32536.
MLA Handbook (7th Edition):
Sisbot, Emre Arda. “Fluid and queueing networks with Gurvich-type routing.” 2015. Web. 02 Mar 2021.
Vancouver:
Sisbot EA. Fluid and queueing networks with Gurvich-type routing. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2015. [cited 2021 Mar 02].
Available from: http://hdl.handle.net/2152/32536.
Council of Science Editors:
Sisbot EA. Fluid and queueing networks with Gurvich-type routing. [Doctoral Dissertation]. University of Texas – Austin; 2015. Available from: http://hdl.handle.net/2152/32536

University of Texas – Austin
16.
-9242-5353.
Applications of network optimization in cybersecurity and service parts logistics.
Degree: PhD, Operations Research and Industrial Engineering, 2019, University of Texas – Austin
URL: http://dx.doi.org/10.26153/tsw/3008
► We develop and analyze novel network-based optimization models for two very important network-related applications: cybersecurity and service parts logistics. We consider one cybersecurity network problem…
(more)
▼ We develop and analyze novel network-based optimization models for two very important network-related applications: cybersecurity and service parts logistics. We consider one cybersecurity network problem and two service parts logistics network problems. The goal is to find tractable solutions to all three problems by creating carefully designed network-based models. The first problem we consider involves decision making in a cybersecurity environment. The goal here is to find the optimal locations to place defensive investments in a cyber physical system so that the probability of being compromised by a persistent attacker is minimized. We use Markov Decision Processes (MDPs) to show that the problem involves stochastic decision making, and we approach it using a network interdiction model. Initially, we create an MDP to come up with a description of a cyber physical network and try to find the optimal attack strategy for a persistent hacker. We show that the results of our MDP model are the same as those of the so called s-t reliability problem, a well-studiedP network problem. To tackle the exponential increase in the state space and the calculation time of the MDP with respect to the size of the cyber physical network, we create a mixed integer program (MIP) to come up with an attacker’s strategy, and develop it further to include a defender by creating a network interdiction model. We show that the results coming from the MIP and MDP model are the same, thus providing a tractable solution to the cybersecurity problem as well as the related s-t reliability problem. The second problem we consider involves decision making in a Service Parts Logistics (SPL) problem. Modifying the traditional assumption of failure based replacements in post-sales service models, we incorporate Condition Based Replacement (CBR) policies into SPL. We utilize the Internet of Things (IoT) and sensors to operationalize the continuous monitoring of the conditions of the parts in the network. We create a model to decide on strategic network design and spare parts stocking, as well as the customer to network facility allocations. Despite the focused work on high value, low demand logistics models such as SPL in the literature, there has not been a study of integrated SPL problems involving CBR policies. Along with the facility location, customer-to-facility allocation and part stock level decisions for given fill-rate based service levels, the CBR-extended SPL model also finds the optimal conditions to replace the parts at each customer. After a careful development of the part degradation process using a Continuous Time Markov Chain model, we incorporate the CBR policies into the integrated SPL model, which turns out to be a Mixed Integer Program with Quadratic Constraints (MIQCP). Our results show that the CBR flexibility brings in significant savings in the objective function (total costs of the network) when compared to the optimal solutions of the failure-based replacement (FBR) policies. Moreover, in almost all problem instances under a…
Advisors/Committee Members: Kutanoglu, Erhan (advisor), Hanasusanto, Grani A (committee member), Hasenbein, John J (committee member), Iyoob, Ilyas (committee member).
Subjects/Keywords: Network optimization; Cybersecurity; Service parts logistics; Condition based replacement; Additive manufacturing; Integer programming; Mixed integer programming with quadratic constraints; Markov Decision Processes
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
-9242-5353. (2019). Applications of network optimization in cybersecurity and service parts logistics. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://dx.doi.org/10.26153/tsw/3008
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Chicago Manual of Style (16th Edition):
-9242-5353. “Applications of network optimization in cybersecurity and service parts logistics.” 2019. Doctoral Dissertation, University of Texas – Austin. Accessed March 02, 2021.
http://dx.doi.org/10.26153/tsw/3008.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
MLA Handbook (7th Edition):
-9242-5353. “Applications of network optimization in cybersecurity and service parts logistics.” 2019. Web. 02 Mar 2021.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Vancouver:
-9242-5353. Applications of network optimization in cybersecurity and service parts logistics. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2019. [cited 2021 Mar 02].
Available from: http://dx.doi.org/10.26153/tsw/3008.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Council of Science Editors:
-9242-5353. Applications of network optimization in cybersecurity and service parts logistics. [Doctoral Dissertation]. University of Texas – Austin; 2019. Available from: http://dx.doi.org/10.26153/tsw/3008
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

University of Texas – Austin
17.
-8916-5076.
Post-contingency states representation and redispatch for restoration in power systems operation.
Degree: PhD, Electrical and Computer Engineering, 2018, University of Texas – Austin
URL: http://hdl.handle.net/2152/63632
► In this treatise, we will present a dynamic version of the Security Constrained Optimal Power Flow (SCOPF) problem, the "Look Ahead Security Constrained Optimal Power…
(more)
▼ In this treatise, we will present a dynamic version of the Security Constrained Optimal Power Flow (SCOPF) problem, the "Look Ahead Security Constrained Optimal Power Flow" (LASCOPF) problem with post-contingency states representation and redispatch scheme for restoration to normal operation, following an outage represented in the mathematical formulation. We will also propose a distributed algorithm to solve the OPF, SCOPF, and LASCOPF problems. The objective of the problem is to minimize the cost of operation, over a number of dispatch intervals and across all contingency scenarios subject to the constraints of the network. It is, therefore, a large optimization problem, requiring an effective distributed solution method. As one of the means to address this challenge, we will be extending the Proximal Message Passing (PMP) algorithmic framework, which is based on another algorithm, called Alternating Direction Method of Multipliers (ADMM) and combine it with the Auxiliary Problem Principle (APP). The resulting algorithm, which we hereafter will call Auxiliary Proximal Message Passing (APMP) is extremely scalable with respect to both network size and the number of scenarios. We implement a look-ahead contingency planning, representing the post-contingency states of the system ahead of time, in a Receding Horizon Control (RHC) or, Model Predictive Control (MPC) type of formulation. One goal of this work is to particularly focus our attention on the trajectories of post-contingency line temperature rise, line MW flow rise, and line current rise and try to limit them through our proposed method. We also investigate how to reduce the computational burden. The reason for paying particular attention to line temperature rise and limiting the same, is the intention of the present scheme to make the most use of the existing transmission capability, without costly transmission upgrades. The means of attaining that goal is to make use of short term thermal overload rating and dynamic thermal limit, and in the event of an actual outage, modifying the dispatch in such a way, that the flows on the remaining lines can be brought back to within allowed values in a given time interval. We demonstrate the effectiveness of our distributed method with a series of numerical simulations based on some simple systems and the IEEE test systems. Finally, we conclude, with a suggestion to some possible future research directions.
Advisors/Committee Members: Baldick, Ross (advisor), Santoso, Surya (committee member), Caramanis, Constantine (committee member), Arapostathis, Aristotle (committee member), Hasenbein, John J (committee member).
Subjects/Keywords: Distributed optimization; Convex optimization; Optimal power flow (OPF); Security constrained optimal power flow (SCOPF); Look-ahead security constrained optimal power flow (LASCOPF); Alternating direction method of multipliers (ADMM); Proximal message passing (PMP); Auxiliary problem principle (APP)
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
-8916-5076. (2018). Post-contingency states representation and redispatch for restoration in power systems operation. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/63632
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Chicago Manual of Style (16th Edition):
-8916-5076. “Post-contingency states representation and redispatch for restoration in power systems operation.” 2018. Doctoral Dissertation, University of Texas – Austin. Accessed March 02, 2021.
http://hdl.handle.net/2152/63632.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
MLA Handbook (7th Edition):
-8916-5076. “Post-contingency states representation and redispatch for restoration in power systems operation.” 2018. Web. 02 Mar 2021.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Vancouver:
-8916-5076. Post-contingency states representation and redispatch for restoration in power systems operation. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2018. [cited 2021 Mar 02].
Available from: http://hdl.handle.net/2152/63632.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Council of Science Editors:
-8916-5076. Post-contingency states representation and redispatch for restoration in power systems operation. [Doctoral Dissertation]. University of Texas – Austin; 2018. Available from: http://hdl.handle.net/2152/63632
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

University of Texas – Austin
18.
-6943-657X.
Optimal spatiotemporal resource allocation in public health and renewable energy.
Degree: PhD, Operations Research & Industrial Engineering, 2016, University of Texas – Austin
URL: http://hdl.handle.net/2152/44589
► Optimizing the spatiotemporal allocation and distribution of a limited number of critical resources is a pervasive problem, concerning both government agencies and private companies. This…
(more)
▼ Optimizing the spatiotemporal allocation and distribution of a limited number of critical resources is a pervasive problem, concerning both government agencies and private companies. This challenge is complicated by mismatches between supply and demand over time and also by uncertainty in demand and/or supply. We study such problems in public health and in renewable energy. Public health resources, such as antiviral medications and vaccines, are often in limited availability at the start of an influenza pandemic. Government agencies need to make balanced policy decisions, accounting for regional equity while maintaining an efficient distribution to mitigate spread of the influenza virus. In the absence of good initial information regarding the demand, resource allocation decisions need to encompass a variety of demand scenarios. On the renewable energy side, we seek to provide a fixed supply of energy from a system which includes a highly variable renewable source, such as wind power. Here, we must commit to a decision before the stochastic supply is realized. When bidding into the electricity market to buy or sell energy, an added difficulty concerning the prices of energy arises. We study five specific problems in these contexts.
Advisors/Committee Members: Dimitrov, Nedialko B. (advisor), Morton, David P. (advisor), Meyers, Lauren A (committee member), Santoso, Surya (committee member), Hasenbein, John J (committee member), Bard, Jonathan F (committee member).
Subjects/Keywords: Stochastic optimization; Chance-constrained programming; Pumped-hydroelectric system; Public health
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
-6943-657X. (2016). Optimal spatiotemporal resource allocation in public health and renewable energy. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/44589
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Chicago Manual of Style (16th Edition):
-6943-657X. “Optimal spatiotemporal resource allocation in public health and renewable energy.” 2016. Doctoral Dissertation, University of Texas – Austin. Accessed March 02, 2021.
http://hdl.handle.net/2152/44589.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
MLA Handbook (7th Edition):
-6943-657X. “Optimal spatiotemporal resource allocation in public health and renewable energy.” 2016. Web. 02 Mar 2021.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Vancouver:
-6943-657X. Optimal spatiotemporal resource allocation in public health and renewable energy. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2016. [cited 2021 Mar 02].
Available from: http://hdl.handle.net/2152/44589.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Council of Science Editors:
-6943-657X. Optimal spatiotemporal resource allocation in public health and renewable energy. [Doctoral Dissertation]. University of Texas – Austin; 2016. Available from: http://hdl.handle.net/2152/44589
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

University of Texas – Austin
19.
-3979-4771.
Design and performance of resource allocation mechanisms for network slicing.
Degree: PhD, Electrical and Computer Engineering, 2018, University of Texas – Austin
URL: http://hdl.handle.net/2152/68642
► Next generation wireless networks are expected to handle an exponential increase in demand for capacity generated by a collection of tenants and/or services with heterogeneous…
(more)
▼ Next generation wireless networks are expected to handle an exponential increase in demand for capacity generated by a collection of tenants and/or services with heterogeneous requirements. Multi-tenant network sharing, enabled through virtualization and network slicing, offers the opportunity to reduce operational and deployment costs, and the challenge of managing resource allocations among multiple tenants serving possibly mobile diverse customers. When designing shared radio resource allocation mechanisms, it is as important to provide tenants with customization and isolation guarantees, as it is to achieve high resource utilization and to do so via low complexity and easy to implement algorithms. This thesis is devoted to the design and analysis of resource allocation mechanisms that meet these objectives.
We propose a sharing model in which tenants are assigned a share/budget of a pool of network resources. This share is then redistributed in the form of weights amongst users, which in turn drive dynamic resource allocations which are partially able to adapt to the traffic demands on, and requirements of, different slices customer populations. We propose and analyze two approaches for redistributing slices’ share among customers which we classify into their associated (i) cooperative, and (ii) competitive resource allocations.
In the cooperative resource allocation setting, a pre-established policy is proposed, in which resources are eventually assigned in proportion to the slice’s share and the relative number of active users in currently has at a resource. This is shown to be socially optimal in a particular setting and simple to implement, with statistical multiplexing gains that increase with the number of tenants and the size of the resource pool. These gains stem from the ability of the scheme to adapt to dynamic loads leading to an up to 50% network capacity savings with respect to static allocations. We further improve these gains by presenting a framework that combines resource allocation and wireless user association which uses limited computational, information, and handoff overheads. However, using our cooperative scheme over a large pool of resources restricts the degree to which a slice can differentiate its customers’ performance at a per resource level. Thus, we study how this trade-off affects the network utility and propose a mechanism to determine an optimal partition the resources into a collection of self-managed pools under cooperative resource allocations.
Our competitive resource allocation approach enables tenants to reap the performance benefits of sharing while retaining the ability to customize their own users’ allocations. This setting results in a network slicing game in which each tenant reacts to the user allocations of the others so as to maximize its own customers’ utility. We show that, under appropriate conditions, the game associated with such strategic behavior converges to a Nash equilibrium. At the Nash equilibrium, a ten- ant always achieves the same, or better, utility…
Advisors/Committee Members: De Veciana, Gustavo (advisor), Banchs Roca, Albert (advisor), Andrews, Jeffrey G (committee member), Baccelli, Francois (committee member), Shakkottai, Sanjay (committee member), Hasenbein, John J (committee member).
Subjects/Keywords: Network slicing; Cellular communications; Resource allocation; Algorithm design and analysis; Heuristic algorithms; Mobile communication; Dynamic scheduling; Wireless networks; Multitenant
networks; Game theory
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
-3979-4771. (2018). Design and performance of resource allocation mechanisms for network slicing. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/68642
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Chicago Manual of Style (16th Edition):
-3979-4771. “Design and performance of resource allocation mechanisms for network slicing.” 2018. Doctoral Dissertation, University of Texas – Austin. Accessed March 02, 2021.
http://hdl.handle.net/2152/68642.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
MLA Handbook (7th Edition):
-3979-4771. “Design and performance of resource allocation mechanisms for network slicing.” 2018. Web. 02 Mar 2021.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Vancouver:
-3979-4771. Design and performance of resource allocation mechanisms for network slicing. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2018. [cited 2021 Mar 02].
Available from: http://hdl.handle.net/2152/68642.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Council of Science Editors:
-3979-4771. Design and performance of resource allocation mechanisms for network slicing. [Doctoral Dissertation]. University of Texas – Austin; 2018. Available from: http://hdl.handle.net/2152/68642
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
20.
Levin, Michael William.
Modeling and optimizing network infrastructure for autonomous vehicles.
Degree: PhD, Civil Engineering, 2017, University of Texas – Austin
URL: http://hdl.handle.net/2152/47311
► Autonomous vehicle (AV) technology has matured sufficiently to be in testing on public roads. However, traffic models of AVs are still in development. Most previous…
(more)
▼ Autonomous vehicle (AV) technology has matured sufficiently to be in testing on public roads. However, traffic models of AVs are still in development. Most previous work has studied AV technologies in micro-simulation. The purpose of this dissertation is to model and optimize AV technologies for large city networks to predict how AVs might affect city traffic patterns and travel behaviors. To accomplish these goals, we construct a dynamic network loading model for AVs, consisting of link and node models of AV technologies, which is used to calculate time-dependent travel times in dynamic traffic assignment. We then study several applications of the dynamic network loading to predict how AVs might affect travel demand and traffic congestion. AVs admit reduced perception-reaction times through technologies such as (cooperative) adaptive cruise control, which can reduce following headways and increase capacity. Previous work has studied these in micro-simulation, but we construct a mesoscopic simulation model for analyses on large networks. To study scenarios with both autonomous and conventional vehicles, we modify the kinematic wave theory to include multiple classes of flow. The flow-density relationship also changes in space and time with the class proportions. We present multiclass cell transmission model and prove that it is a Godunov approximation to the multiclass kinematic wave theory. We also develop a car-following model to predict the fundamental diagram at arbitrary proportions of AVs. Complete market penetration scenarios admit dynamic lane reversal – changing lane direction at high frequencies to more optimally allocate road capacity. We develop a kinematic wave theory in which the number of lanes changes in space and time, and approximately solve it with a cell transmission model. We study two methods of determining lane direction. First, we present a mixed integer linear program for system optimal dynamic traffic assignment. Since this program is computationally difficult to solve, we also study dynamic lane reversal on a single link with deterministic and stochastic demands. The resulting policy is shown to significantly reduce travel times on a city network. AVs also admit reservation-based intersection control, which can make greater use of intersection capacity than traffic signals. AVs communicate with the intersection manager to reserve space-time paths through the intersection. We create a mesoscopic node model by starting with the conflict point variant of reservations and aggregating conflict points into capacity-constrained conflict regions. This model yields an integer program that can be adapted to arbitrary objective functions. To motivate optimization, we present several examples on theoretical and realistic networks demonstrating that naïve reservation policies can perform worse than traffic signals. These occur due to asymmetric intersections affecting optimal capacity allocation and/or user equilibrium route choice behavior. To improve reservations, we adapt the decentralized…
Advisors/Committee Members: Boyles, Stephen David, 1982- (advisor), Claudel, Christian G (committee member), Kockelman, Kara M (committee member), Stone, Peter (committee member), Hasenbein, John J (committee member).
Subjects/Keywords: Autonomous vehicles; Dynamic traffic assignment; Traffic flow; Dynamic lane reversal; Reservation-based intersection control
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Levin, M. W. (2017). Modeling and optimizing network infrastructure for autonomous vehicles. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/47311
Chicago Manual of Style (16th Edition):
Levin, Michael William. “Modeling and optimizing network infrastructure for autonomous vehicles.” 2017. Doctoral Dissertation, University of Texas – Austin. Accessed March 02, 2021.
http://hdl.handle.net/2152/47311.
MLA Handbook (7th Edition):
Levin, Michael William. “Modeling and optimizing network infrastructure for autonomous vehicles.” 2017. Web. 02 Mar 2021.
Vancouver:
Levin MW. Modeling and optimizing network infrastructure for autonomous vehicles. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2017. [cited 2021 Mar 02].
Available from: http://hdl.handle.net/2152/47311.
Council of Science Editors:
Levin MW. Modeling and optimizing network infrastructure for autonomous vehicles. [Doctoral Dissertation]. University of Texas – Austin; 2017. Available from: http://hdl.handle.net/2152/47311
21.
Shen, Yue, master of science in engineering.
Amusement park visitor routes design and optimization.
Degree: MSin Engineering, Operations Research and Industrial Engineering, 2012, University of Texas – Austin
URL: http://hdl.handle.net/2152/ETD-UT-2012-05-5652
► Amusement parks are a huge business. Guest experiences determine the success or failure for an amusement park. This report suggests an approach to improve guest…
(more)
▼ Amusement parks are a huge business. Guest experiences determine the success or failure for an amusement park. This report suggests an approach to improve guest experience by managing guest flow. The guest happiness optimization problem is formulated into a visitor routing management model. The constraints for this model include attraction attributes and guest behavior. To build the attraction constraints, their information is first gathered from internet, field studies and surveys, and then input into simulation software. Constraints on guest behavior are set up with a literature study and a guest survey. A two phase heuristic is developed to solve this problem with constraints. Candidate routes are generated with a route construction algorithm in the first phase. Visitor distribution and selection on these candidate routes are determined in the second phase using a mixed integer programming solver. Visitor routes are then recommended to the park’s operator side, for them to distribute to guests visiting on their vacations.
Data from Disney Epcot are collected and applied in the case study to implement the methodology in this report. Attraction operations capability is maintained at the current level with no additional cost for the project, while guest satisfaction is improved by ensuring the number and type of attractions they visit. In addition, average waiting time for visitors is reduced by at least 70% in the recommended operation strategy.
Advisors/Committee Members: Hasenbein, John J. (advisor), Kutanoglu, Erhan (committee member).
Subjects/Keywords: Amusement park operations; Visitor routes management; Two-phase heuristics; Attraction simulation; Queue waiting time; Route construction algorithm; Mixed integer programming
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Shen, Yue, m. o. s. i. e. (2012). Amusement park visitor routes design and optimization. (Masters Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2012-05-5652
Chicago Manual of Style (16th Edition):
Shen, Yue, master of science in engineering. “Amusement park visitor routes design and optimization.” 2012. Masters Thesis, University of Texas – Austin. Accessed March 02, 2021.
http://hdl.handle.net/2152/ETD-UT-2012-05-5652.
MLA Handbook (7th Edition):
Shen, Yue, master of science in engineering. “Amusement park visitor routes design and optimization.” 2012. Web. 02 Mar 2021.
Vancouver:
Shen, Yue mosie. Amusement park visitor routes design and optimization. [Internet] [Masters thesis]. University of Texas – Austin; 2012. [cited 2021 Mar 02].
Available from: http://hdl.handle.net/2152/ETD-UT-2012-05-5652.
Council of Science Editors:
Shen, Yue mosie. Amusement park visitor routes design and optimization. [Masters Thesis]. University of Texas – Austin; 2012. Available from: http://hdl.handle.net/2152/ETD-UT-2012-05-5652
22.
Ng, Man Wo.
Generalizing the multivariate normality assumption in the simulation of dependencies in transportation systems.
Degree: MSin Statistics, Statistics, 2010, University of Texas – Austin
URL: http://hdl.handle.net/2152/ETD-UT-2010-05-1122
► By far the most popular method to account for dependencies in the transportation network analysis literature is the use of the multivariate normal (MVN) distribution.…
(more)
▼ By far the most popular method to account for dependencies in the transportation
network analysis literature is the use of the multivariate normal (MVN) distribution.
While in certain cases there is some theoretical underpinning for the MVN assumption, in
others there is none. This can lead to misleading results: results do not only depend on
whether dependence is modeled, but also how dependence is modeled. When assuming
the MVN distribution, one is limiting oneself to a specific set of dependency structures,
which can substantially limit validity of results. In this report an existing, more flexible,
correlation-based approach (where just marginal distributions and their correlations are
specified) is proposed, and it is demonstrated that, in simulation studies, such an
approach is a generalization of the MVN assumption. The need for such generalization is
particularly critical in the transportation network modeling literature, where oftentimes there exists no or insufficient data to estimate probability distributions, so that sensitivity
analyses assuming different dependence structures could be extremely valuable.
However, the proposed method has its own drawbacks. For example, it is again not able
to exhaust all possible dependence forms and it relies on some not-so-known properties
of the correlation coefficient.
Advisors/Committee Members: Waller, S. Travis (advisor), Hasenbein, John J. (committee member).
Subjects/Keywords: Correlation; Multivariate normal distribution; Simulation; Transportation; Dependence
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Ng, M. W. (2010). Generalizing the multivariate normality assumption in the simulation of dependencies in transportation systems. (Masters Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2010-05-1122
Chicago Manual of Style (16th Edition):
Ng, Man Wo. “Generalizing the multivariate normality assumption in the simulation of dependencies in transportation systems.” 2010. Masters Thesis, University of Texas – Austin. Accessed March 02, 2021.
http://hdl.handle.net/2152/ETD-UT-2010-05-1122.
MLA Handbook (7th Edition):
Ng, Man Wo. “Generalizing the multivariate normality assumption in the simulation of dependencies in transportation systems.” 2010. Web. 02 Mar 2021.
Vancouver:
Ng MW. Generalizing the multivariate normality assumption in the simulation of dependencies in transportation systems. [Internet] [Masters thesis]. University of Texas – Austin; 2010. [cited 2021 Mar 02].
Available from: http://hdl.handle.net/2152/ETD-UT-2010-05-1122.
Council of Science Editors:
Ng MW. Generalizing the multivariate normality assumption in the simulation of dependencies in transportation systems. [Masters Thesis]. University of Texas – Austin; 2010. Available from: http://hdl.handle.net/2152/ETD-UT-2010-05-1122
23.
Zoghby, Jeriad Marcus.
Critical arc strategies for the reentrant job shop scheduling problem with setups.
Degree: PhD, Mechanical Engineering., 2002, University of Texas – Austin
URL: http://hdl.handle.net/2152/1656
► This thesis presents the Critical Arc Strategies for solving the reentrant job shop scheduling problem with setups. These metaheuristic strategies use combinations of critical path…
(more)
▼ This thesis presents the Critical Arc Strategies for solving the reentrant job shop
scheduling problem with setups. These metaheuristic strategies use combinations
of critical path characteristics to gauge which heuristic decisions will have the
greatest impact on reducing the average delay of the schedule. This research also
investigates feasibility in light of iterative searches for the disjunctive graph of the
reentrant job shop scheduling problem with sequence dependent setups.
The class of strategies investigated in this thesis is problem specific and uses
the inherent properties of the disjunctive graph to develop critical arc weights for
prioritizing the candidate list for arc reversals. There are 3 subclasses of Critical
Arc Strategies presented in this thesis. The Delay Weighted Critical Arc
(DWCA) strategy uses linear combinations of a critical arc’s operation delay and
the job delays for which it is a member of the job’s specific critical path. The
viii
Sequentially Weighted Critical Arc (SWCA) strategies rank the candidates based
on the number of critical paths, critical arcs, or accumulated operation delays they
influence based on critical path membership. The Exponentially Weighted
Critical Arc (EWCA) strategy uses an exponentially weighted average of the
critical arc operation delays the candidate influences, which are also based on
critical path membership. These strategies aid the metaheuristic in identifying the
most significant critical arcs in the graph, allowing it to find improvements faster
than traditional tabu search methodologies. An elite candidate list strategy is
applied to the candidates, which dynamically restricts the candidate list size based
on search performance.
Benchmarking experiments show that the Critical Arc Strategies outperform
traditional tabu search candidate list strategies. Additional experiments show the
value of applying the metaheuristic strategies to “best” policy generated solutions
to minimize average delay in a schedule. These results show the value of
applying the Critical Arc Strategies on realistic sized complex problems, such as
semiconductor manufacturing facilities.
Advisors/Committee Members: Hasenbein, John J. (advisor), Barnes, J. Wesley. (advisor).
Subjects/Keywords: Production scheduling
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Zoghby, J. M. (2002). Critical arc strategies for the reentrant job shop scheduling problem with setups. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/1656
Chicago Manual of Style (16th Edition):
Zoghby, Jeriad Marcus. “Critical arc strategies for the reentrant job shop scheduling problem with setups.” 2002. Doctoral Dissertation, University of Texas – Austin. Accessed March 02, 2021.
http://hdl.handle.net/2152/1656.
MLA Handbook (7th Edition):
Zoghby, Jeriad Marcus. “Critical arc strategies for the reentrant job shop scheduling problem with setups.” 2002. Web. 02 Mar 2021.
Vancouver:
Zoghby JM. Critical arc strategies for the reentrant job shop scheduling problem with setups. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2002. [cited 2021 Mar 02].
Available from: http://hdl.handle.net/2152/1656.
Council of Science Editors:
Zoghby JM. Critical arc strategies for the reentrant job shop scheduling problem with setups. [Doctoral Dissertation]. University of Texas – Austin; 2002. Available from: http://hdl.handle.net/2152/1656
24.
Nadimpalli, Vamsi Krishna.
An average cost Markov decision process model to decide when to challenge a call in a tennis match.
Degree: MSin Engineering, Operations Research and Industrial Engineering, 2010, University of Texas – Austin
URL: http://hdl.handle.net/2152/ETD-UT-2010-08-1822
► In a standard tennis match each player has an unlimited opportunity to challenge an umpire’s call, but if three incorrect challenges are made in a…
(more)
▼ In a standard tennis match each player has an unlimited opportunity
to challenge an umpire’s call, but if three incorrect challenges are made in a set he is not allowed to challenge anymore in that set. If the set goes into a tie break the limit on incorrect challenges increases by one. These limited
incorrect challenges are not carried over from one set to another. So this is kind of a limited resource available to the player and if he knows how to use
this resource in a best possible way, there is a scope for increasing his overall chances of winning a match. With the motive of gaining insight on when to challenge a call, we have modeled a single game in a tennis match as a Markov decision process. We have also studied the impact of variables like player’s probability of winning a point, the player’s perception of the challengability
of a call and proportion of challengable calls on the decision making process.
Advisors/Committee Members: Hasenbein, John J. (advisor), Bickel, J. E. (committee member).
Subjects/Keywords: Tennis; Markov decision process; Call challenge; Linear programming
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Nadimpalli, V. K. (2010). An average cost Markov decision process model to decide when to challenge a call in a tennis match. (Masters Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2010-08-1822
Chicago Manual of Style (16th Edition):
Nadimpalli, Vamsi Krishna. “An average cost Markov decision process model to decide when to challenge a call in a tennis match.” 2010. Masters Thesis, University of Texas – Austin. Accessed March 02, 2021.
http://hdl.handle.net/2152/ETD-UT-2010-08-1822.
MLA Handbook (7th Edition):
Nadimpalli, Vamsi Krishna. “An average cost Markov decision process model to decide when to challenge a call in a tennis match.” 2010. Web. 02 Mar 2021.
Vancouver:
Nadimpalli VK. An average cost Markov decision process model to decide when to challenge a call in a tennis match. [Internet] [Masters thesis]. University of Texas – Austin; 2010. [cited 2021 Mar 02].
Available from: http://hdl.handle.net/2152/ETD-UT-2010-08-1822.
Council of Science Editors:
Nadimpalli VK. An average cost Markov decision process model to decide when to challenge a call in a tennis match. [Masters Thesis]. University of Texas – Austin; 2010. Available from: http://hdl.handle.net/2152/ETD-UT-2010-08-1822

University of Texas – Austin
25.
Whittemore, Anthony Ryan.
Modeling machine degradation with Hidden Markov Models.
Degree: MSin Engineering, Operations Research & Industrial Engineering, 2018, University of Texas – Austin
URL: http://hdl.handle.net/2152/68912
Subjects/Keywords: Hidden Markov Models; Machine maintenance; Optimal policy; Condition based maintenance
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Whittemore, A. R. (2018). Modeling machine degradation with Hidden Markov Models. (Masters Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/68912
Chicago Manual of Style (16th Edition):
Whittemore, Anthony Ryan. “Modeling machine degradation with Hidden Markov Models.” 2018. Masters Thesis, University of Texas – Austin. Accessed March 02, 2021.
http://hdl.handle.net/2152/68912.
MLA Handbook (7th Edition):
Whittemore, Anthony Ryan. “Modeling machine degradation with Hidden Markov Models.” 2018. Web. 02 Mar 2021.
Vancouver:
Whittemore AR. Modeling machine degradation with Hidden Markov Models. [Internet] [Masters thesis]. University of Texas – Austin; 2018. [cited 2021 Mar 02].
Available from: http://hdl.handle.net/2152/68912.
Council of Science Editors:
Whittemore AR. Modeling machine degradation with Hidden Markov Models. [Masters Thesis]. University of Texas – Austin; 2018. Available from: http://hdl.handle.net/2152/68912

University of Texas – Austin
26.
Billings, Ronald Lester.
A heuristic method for scheduling and dispatching of factory production using multiclass fluid networks.
Degree: PhD, Mechanical Engineering., 2003, University of Texas – Austin
URL: http://hdl.handle.net/2152/461
► This dissertation describes a two-phase heuristic method for scheduling and dispatching production in a factory. In the first phase, the production flow is modeled as…
(more)
▼ This dissertation describes a two-phase heuristic method for scheduling
and dispatching production in a factory. In the first phase, the production flow is
modeled as a multiclass fluid network. This fluid queueing model is a relaxation
of the deterministic factory scheduling problem (in addition to being a limit of the
stochastic queueing model) so it functions as an approximation of a discrete
flexible job-shop with WIP and ongoing inputs. However, buffer levels are
allowed to have non-integer values, equipment processing can be simultaneously
shared between different products, and a single lot can begin processing at a
downstream step before it completely finishes at the previous step. By solving a
finite series of quadratic (or linear) programs, an optimal (or nearly optimal)
control policy is found for this fluid relaxation problem (with a weighted holding
cost objective).
In the second phase, production in the discrete factory queueing network is
scheduled ahead of time or dispatched in real time by minimizing the deviation of
the production from the optimal fluid control policy. Starting assignments are set
with a mixed-integer program, and special techniques are used to deal with
batching and to avoid sequence-dependent set-ups.
Advisors/Committee Members: Hasenbein, John J. (advisor).
Subjects/Keywords: Factory management
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Billings, R. L. (2003). A heuristic method for scheduling and dispatching of factory production using multiclass fluid networks. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/461
Chicago Manual of Style (16th Edition):
Billings, Ronald Lester. “A heuristic method for scheduling and dispatching of factory production using multiclass fluid networks.” 2003. Doctoral Dissertation, University of Texas – Austin. Accessed March 02, 2021.
http://hdl.handle.net/2152/461.
MLA Handbook (7th Edition):
Billings, Ronald Lester. “A heuristic method for scheduling and dispatching of factory production using multiclass fluid networks.” 2003. Web. 02 Mar 2021.
Vancouver:
Billings RL. A heuristic method for scheduling and dispatching of factory production using multiclass fluid networks. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2003. [cited 2021 Mar 02].
Available from: http://hdl.handle.net/2152/461.
Council of Science Editors:
Billings RL. A heuristic method for scheduling and dispatching of factory production using multiclass fluid networks. [Doctoral Dissertation]. University of Texas – Austin; 2003. Available from: http://hdl.handle.net/2152/461

University of Texas – Austin
27.
Bauer, Daniel Howard.
Scheduling of Generalized Cambridge Rings.
Degree: PhD, Operations Research and Industrial Engineering, 2009, University of Texas – Austin
URL: http://hdl.handle.net/2152/6530
► A Generalized Cambridge Ring is a queueing system that can be used as an approximate model of some material handling systems used in modern factories.…
(more)
▼ A Generalized Cambridge Ring is a queueing system that can be used
as an approximate model of some material handling systems used in modern
factories. It consists of one or more vehicles that carry cargo from origins
to destinations around a loop, with queues forming when cargo temporarily
exceeds the capacity of the system. For some Generalized Cambridge Rings
that satisfy the usual traffic conditions for stability, it is demonstrated that
some nonidling scheduling polices are unstable. A good scheduling policy
will increase the efficiency of these systems by reducing waiting times and by
therefore also reducing work in process (WIP). Simple heuristic policies are
developed which provide substantial improvements over the commonly used
first-in-first-out (FIFO) policy. Variances are incorporated into previously
developed fluid models that used only means to produce a more accurate
partially discrete fluid mean-variance model, which is used to further reduce
waiting times. Optimal policies are obtained for some simple special cases, and
simulations are used to compare policies in more general cases. The methods
developed may be applicable to other queueing systems.
Advisors/Committee Members: Hasenbein, John J. (advisor).
Subjects/Keywords: Generalized Cambridge Rings; Scheduling; Queueing systems; Material handling systems; Simulation methods; Fluid models
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Bauer, D. H. (2009). Scheduling of Generalized Cambridge Rings. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/6530
Chicago Manual of Style (16th Edition):
Bauer, Daniel Howard. “Scheduling of Generalized Cambridge Rings.” 2009. Doctoral Dissertation, University of Texas – Austin. Accessed March 02, 2021.
http://hdl.handle.net/2152/6530.
MLA Handbook (7th Edition):
Bauer, Daniel Howard. “Scheduling of Generalized Cambridge Rings.” 2009. Web. 02 Mar 2021.
Vancouver:
Bauer DH. Scheduling of Generalized Cambridge Rings. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2009. [cited 2021 Mar 02].
Available from: http://hdl.handle.net/2152/6530.
Council of Science Editors:
Bauer DH. Scheduling of Generalized Cambridge Rings. [Doctoral Dissertation]. University of Texas – Austin; 2009. Available from: http://hdl.handle.net/2152/6530

University of Texas – Austin
28.
Adusumilli, Kranthi Mitra, 1979-.
Scheduling and control of stochastic processing networks.
Degree: PhD, Operations Research and Industrial Engineering, 2007, University of Texas – Austin
URL: http://hdl.handle.net/2152/3167
► In this dissertation the following two control problems of different queueing systems are addressed. Service rate and Admission Control: We consider a single server system…
(more)
▼ In this dissertation the following two control problems of different queueing
systems are addressed.
Service rate and Admission Control: We consider a single server system
with constant Poisson arrivals subjected to both service rate and admission
controls. The controller can admit or reject a customer on arrival and choose
the service rate, from a fixed subset, when an arrival or departure occurs.
With each control decision is associated a one time rejection cost and a cost
for service. A holding cost and cost for service are continuously incurred.
The holding cost is non-decreasing in the number of customers in the system
and the cost for service is non-decreasing in the service rate. The objective
is to minimize the long run average cost per unit time. We restrict to
(state-dependent) stationary deterministic controls and derive the optimality
equations. We use standard average cost dynamic programming techniques
to obtain the optimality equations in terms of minimum achievable average
cost. The stationary controls correspond to a threshold system state (finite
or infinite) and service rates for each of the states. Customer are rejected
service once the number of customers in the system is greater than or equal
to the threshold. We suggest a fast scheme, based on considering incremental
values of the system threshold for computing the optimal average cost and
the associated optimal service rates. This is similar to initially fixing a system
threshold, and choosing the optimal service rates thereafter. We establish
the monotonicity of optimal service rates in terms of the queue lengths, for
the original system as well as the intermediate systems. Finally, we prove
that the constructed stationary optimal policy is optimal across all possible
non-anticipative controls.
Stochastic Scheduling under Parameter Uncertainty: We suggest a new
approach to model randomness in the context of job shop scheduling. In
addition to inherent randomness such as variable processing times for a job
class, certain parameters, e.g. like the initial number of jobs might not be
known with certainty. We consider scheduling of such a system: a stochastic
job shop with parameter uncertainty.
We model a situation in which the initial number of jobs and the mean
processing times of jobs are uncertain. We assume that the controller has a
limited ability to make certain control decisions before the initial number of
jobs and processing times are revealed. Thus these decisions must be made
a priori. For each server, the scheduler must choose a cycle length and the
fraction of time devoted to processing each job class during a cycle. Under
these assumptions the resulting optimization problem for minimizing expected
makespan is a stochastic integer program. We obtain a continuous job shop
model, a relaxation of the original model, by relaxing the integrality requirements.
When we restrict allowable policies to satisfy certain time allocation
constraints, we obtain a further relaxation called the fluid model.…
Advisors/Committee Members: Hasenbein, John J. (advisor).
Subjects/Keywords: Queuing theory; Customer services
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Adusumilli, Kranthi Mitra, 1. (2007). Scheduling and control of stochastic processing networks. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/3167
Chicago Manual of Style (16th Edition):
Adusumilli, Kranthi Mitra, 1979-. “Scheduling and control of stochastic processing networks.” 2007. Doctoral Dissertation, University of Texas – Austin. Accessed March 02, 2021.
http://hdl.handle.net/2152/3167.
MLA Handbook (7th Edition):
Adusumilli, Kranthi Mitra, 1979-. “Scheduling and control of stochastic processing networks.” 2007. Web. 02 Mar 2021.
Vancouver:
Adusumilli, Kranthi Mitra 1. Scheduling and control of stochastic processing networks. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2007. [cited 2021 Mar 02].
Available from: http://hdl.handle.net/2152/3167.
Council of Science Editors:
Adusumilli, Kranthi Mitra 1. Scheduling and control of stochastic processing networks. [Doctoral Dissertation]. University of Texas – Austin; 2007. Available from: http://hdl.handle.net/2152/3167

University of Texas – Austin
29.
Sampath, Balaji, 1977-.
Scheduling and stability analysis of Cambridge Ring.
Degree: PhD, Operations Research and Industrial Engineering, 2007, University of Texas – Austin
URL: http://hdl.handle.net/2152/3164
► Multiclass queueing networks are widely used to model complex manufacturing systems and communications networks. In this dissertation we describe and analyze a multiclass queueing network…
(more)
▼ Multiclass queueing networks are widely used to model complex manufacturing systems and communications networks. In this dissertation we describe and analyze a multiclass queueing network model known as the Cambridge Ring. As the name suggest this network has a circular topology with unidirectional routing. In many cases the analysis of a stochastic model is a difficult task. For a few special cases of this network we show that all non-idling policies are throughput optimal for this system. One of the major differences between this work and precious literature is that we prove throughput optimality of all non-idling policies, whereas most of the previous work has been on establishing throughput optimality for a specific policy (usually First-In-First-Out). We use a macroscopic technique known as fluid model to identify optimal policies with respect to work in process. In one case we consider, the discrete scheduling policy motivated by the optimal fluid policy is indeed optimal in the discrete network. For the other special case we show by means of a deterministic counterexample that the discrete policy most naturally suggested by the fluid optimal policy may not be optimal for the queueing network. We also formulate the fluid holding cost optimization problem and present its solution for a simple version of the Cambridge Ring. Further we establish that the optimal policy under a class of policies known as "non-ejective" policies may be an idling policy. We use an example of the Cambridge Ring with a single vehicle to show that the optimal policy for this example has to be an idling policy.
Advisors/Committee Members: Hasenbein, John J. (advisor).
Subjects/Keywords: Queuing networks (Data transmission) – Mathematical models; Queuing theory
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Sampath, Balaji, 1. (2007). Scheduling and stability analysis of Cambridge Ring. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/3164
Chicago Manual of Style (16th Edition):
Sampath, Balaji, 1977-. “Scheduling and stability analysis of Cambridge Ring.” 2007. Doctoral Dissertation, University of Texas – Austin. Accessed March 02, 2021.
http://hdl.handle.net/2152/3164.
MLA Handbook (7th Edition):
Sampath, Balaji, 1977-. “Scheduling and stability analysis of Cambridge Ring.” 2007. Web. 02 Mar 2021.
Vancouver:
Sampath, Balaji 1. Scheduling and stability analysis of Cambridge Ring. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2007. [cited 2021 Mar 02].
Available from: http://hdl.handle.net/2152/3164.
Council of Science Editors:
Sampath, Balaji 1. Scheduling and stability analysis of Cambridge Ring. [Doctoral Dissertation]. University of Texas – Austin; 2007. Available from: http://hdl.handle.net/2152/3164

University of Texas – Austin
30.
Yildirim, Utku.
Stability and pricing of queueing models.
Degree: PhD, Operations Research and Industrial Engineering, 2006, University of Texas – Austin
URL: http://hdl.handle.net/2152/2958
► A queueing system can be described as a population of customers which from time to time utilize the resources of a service provider in order…
(more)
▼ A queueing system can be described as a population of customers which
from time to time utilize the resources of a service provider in order to obtain
service. Since it is a difficult task to analyze a stochastic model, often
macroscopic models are utilized to gain insight on high level properties of the
real model. The contributions of this thesis can be summarized in three parts.
In the first and second parts of the thesis, we investigate the stability of the
fluid models and the relationship between the fluid and the stochastic models.
In the third part, we use queueing theory to tackle a revenue management
problem of a monopolistic firm.
First, we investigate a fundamental property of fluid solutions in multiclass
fluid networks. In [14] it is shown that if a fluid network has the finite
decomposition property and is not weakly stable, then any queueing network
associated with the fluid network is not rate stable. In particular, we show
that the finite decomposition property holds for certain classes of two-pass
fluid networks.
Next, we try to characterize the intersection of stability regions of the
static buffer priority service disciplines for a certain type of three station networks.
The results expand the known stability region by utilizing fluid trajectories
and a new methodology is proposed to identify if a service rate vector
is in the aforementioned stability region or not.
Finally, we investigate the pricing problem of a firm which dominates
the market. In our model, there is a single server with exponential service
times and arrivals follow a compound Poisson process where the number of
customers in a group is a random variable. We let the firm to adjust the price
as the length of the queue changes. A major difference between this research
and the previous literature is that we allow group arrivals and the firm may
only accept or reject customer groups as a whole. We identify the optimal
acceptance policy that maximizes the revenue and show that this policy is
also socially optimal.
Advisors/Committee Members: Hasenbein, John J. (advisor).
Subjects/Keywords: Queuing theory; Stability; Pricing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share





❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Yildirim, U. (2006). Stability and pricing of queueing models. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/2958
Chicago Manual of Style (16th Edition):
Yildirim, Utku. “Stability and pricing of queueing models.” 2006. Doctoral Dissertation, University of Texas – Austin. Accessed March 02, 2021.
http://hdl.handle.net/2152/2958.
MLA Handbook (7th Edition):
Yildirim, Utku. “Stability and pricing of queueing models.” 2006. Web. 02 Mar 2021.
Vancouver:
Yildirim U. Stability and pricing of queueing models. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2006. [cited 2021 Mar 02].
Available from: http://hdl.handle.net/2152/2958.
Council of Science Editors:
Yildirim U. Stability and pricing of queueing models. [Doctoral Dissertation]. University of Texas – Austin; 2006. Available from: http://hdl.handle.net/2152/2958
◁ [1] [2] ▶
.