+publisher:"University of Texas – Austin" +contributor:("Hasenbein, John J.")

University of Texas – Austin

1. Bauer, Daniel Howard. Scheduling of Generalized Cambridge Rings.

Degree: Operations Research and Industrial Engineering, 2009, University of Texas – Austin

► 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)

Subjects/Keywords: Generalized Cambridge Rings; Scheduling; Queueing systems; Material handling systems; Simulation methods; Fluid models

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Bauer, D. H. (2009). Scheduling of Generalized Cambridge Rings. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/6530

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Bauer, Daniel Howard. “Scheduling of Generalized Cambridge Rings.” 2009. Thesis, University of Texas – Austin. Accessed August 24, 2019. http://hdl.handle.net/2152/6530.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Bauer, Daniel Howard. “Scheduling of Generalized Cambridge Rings.” 2009. Web. 24 Aug 2019.

Vancouver:

Bauer DH. Scheduling of Generalized Cambridge Rings. [Internet] [Thesis]. University of Texas – Austin; 2009. [cited 2019 Aug 24]. Available from: http://hdl.handle.net/2152/6530.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bauer DH. Scheduling of Generalized Cambridge Rings. [Thesis]. University of Texas – Austin; 2009. Available from: http://hdl.handle.net/2152/6530

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Texas – Austin

2. Zhu, Meimeizi. Control of a three-class fluid model with routing.

Degree: 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)

Subjects/Keywords: Fluid model

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Zhu, M. (2013). Control of a three-class fluid model with routing. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/24082

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Zhu, Meimeizi. “Control of a three-class fluid model with routing.” 2013. Thesis, University of Texas – Austin. Accessed August 24, 2019. http://hdl.handle.net/2152/24082.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Zhu, Meimeizi. “Control of a three-class fluid model with routing.” 2013. Web. 24 Aug 2019.

Vancouver:

Zhu M. Control of a three-class fluid model with routing. [Internet] [Thesis]. University of Texas – Austin; 2013. [cited 2019 Aug 24]. Available from: http://hdl.handle.net/2152/24082.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zhu M. Control of a three-class fluid model with routing. [Thesis]. University of Texas – Austin; 2013. Available from: http://hdl.handle.net/2152/24082

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Texas – Austin

3. -5319-9514. Traffic signal control using queueing theory.

Degree: 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)

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

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

-5319-9514. (2018). Traffic signal control using queueing theory. (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
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

-5319-9514. “Traffic signal control using queueing theory.” 2018. Thesis, University of Texas – Austin. Accessed August 24, 2019. http://hdl.handle.net/2152/67640.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

-5319-9514. “Traffic signal control using queueing theory.” 2018. Web. 24 Aug 2019.

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] [Thesis]. University of Texas – Austin; 2018. [cited 2019 Aug 24]. 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
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

-5319-9514. Traffic signal control using queueing theory. [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
Not specified: Masters Thesis or Doctoral Dissertation

4. Lu, Fang, active 21st century. Modeling and optimization for spatial detection to minimize abandonment rate.

Degree: Operations Research and 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)

Subjects/Keywords: Spatial detection; Queues with abandonments; Simulation; Stochastic programming; Multi-stage stochastic facility location problem; Scheduling heuristics

5 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Lu, Fang, a. 2. c. (2014). Modeling and optimization for spatial detection to minimize abandonment rate. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/25998

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Lu, Fang, active 21st century. “Modeling and optimization for spatial detection to minimize abandonment rate.” 2014. Thesis, University of Texas – Austin. Accessed August 24, 2019. http://hdl.handle.net/2152/25998.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Lu, Fang, active 21st century. “Modeling and optimization for spatial detection to minimize abandonment rate.” 2014. Web. 24 Aug 2019.

Vancouver:

Lu, Fang a2c. Modeling and optimization for spatial detection to minimize abandonment rate. [Internet] [Thesis]. University of Texas – Austin; 2014. [cited 2019 Aug 24]. Available from: http://hdl.handle.net/2152/25998.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lu, Fang a2c. Modeling and optimization for spatial detection to minimize abandonment rate. [Thesis]. University of Texas – Austin; 2014. Available from: http://hdl.handle.net/2152/25998

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Texas – Austin

5. Liao, Melody. A numerical study of single-machine multiple-recipe predictive maintenance.

Degree: Mechanical 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)

Subjects/Keywords: Machine maintenance; Maintenance policy; Predictive maintenance

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Liao, M. (2011). A numerical study of single-machine multiple-recipe predictive maintenance. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2011-05-3320

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Liao, Melody. “A numerical study of single-machine multiple-recipe predictive maintenance.” 2011. Thesis, University of Texas – Austin. Accessed August 24, 2019. http://hdl.handle.net/2152/ETD-UT-2011-05-3320.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Liao, Melody. “A numerical study of single-machine multiple-recipe predictive maintenance.” 2011. Web. 24 Aug 2019.

Vancouver:

Liao M. A numerical study of single-machine multiple-recipe predictive maintenance. [Internet] [Thesis]. University of Texas – Austin; 2011. [cited 2019 Aug 24]. Available from: http://hdl.handle.net/2152/ETD-UT-2011-05-3320.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Liao M. A numerical study of single-machine multiple-recipe predictive maintenance. [Thesis]. University of Texas – Austin; 2011. Available from: http://hdl.handle.net/2152/ETD-UT-2011-05-3320

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Texas – Austin

6. -2213-7353. Comparison of prediction methods for batter-pitcher matchups.

Degree: Mechanical 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)

Subjects/Keywords: Baseball; Batter; Pitcher; Matchups; Log5; Logistic regression; Morey-Z; Batter-pitcher matchups; Hitter; PvP; Baseball confrontation

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

-2213-7353. (2016). Comparison of prediction methods for batter-pitcher matchups. (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
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

-2213-7353. “Comparison of prediction methods for batter-pitcher matchups.” 2016. Thesis, University of Texas – Austin. Accessed August 24, 2019. http://hdl.handle.net/2152/45747.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

-2213-7353. “Comparison of prediction methods for batter-pitcher matchups.” 2016. Web. 24 Aug 2019.

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] [Thesis]. University of Texas – Austin; 2016. [cited 2019 Aug 24]. 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
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

-2213-7353. Comparison of prediction methods for batter-pitcher matchups. [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
Not specified: Masters Thesis or Doctoral Dissertation

University of Texas – Austin

7. Tondukulam Seeth, Srikanth. Forecasting of sick leave usage among nurses via artificial neural networks.

Degree: Operations Research and Industrial Engineering, 2010, University of Texas – Austin

URL: http://hdl.handle.net/2152/ETD-UT-2010-12-2259

► This report examines the trends in sick leave usage among nurses in a hospital and aims at creating a forecasting model to predict sick leave… (more)

Subjects/Keywords: Artificial neural networks; Forecasting; Nursing; Nurses; Absenteeism

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Tondukulam Seeth, S. (2010). Forecasting of sick leave usage among nurses via artificial neural networks. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2010-12-2259

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Tondukulam Seeth, Srikanth. “Forecasting of sick leave usage among nurses via artificial neural networks.” 2010. Thesis, University of Texas – Austin. Accessed August 24, 2019. http://hdl.handle.net/2152/ETD-UT-2010-12-2259.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Tondukulam Seeth, Srikanth. “Forecasting of sick leave usage among nurses via artificial neural networks.” 2010. Web. 24 Aug 2019.

Vancouver:

Tondukulam Seeth S. Forecasting of sick leave usage among nurses via artificial neural networks. [Internet] [Thesis]. University of Texas – Austin; 2010. [cited 2019 Aug 24]. Available from: http://hdl.handle.net/2152/ETD-UT-2010-12-2259.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tondukulam Seeth S. Forecasting of sick leave usage among nurses via artificial neural networks. [Thesis]. University of Texas – Austin; 2010. Available from: http://hdl.handle.net/2152/ETD-UT-2010-12-2259

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Texas – Austin

8. Gurfein, Kate Elizabeth. Evaluation of basis functions for generating approximate linear programming (ALP) average cost solutions and policies for multiclass queueing networks.

Degree: Operations Research and 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

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Gurfein, K. E. (2012). Evaluation of basis functions for generating approximate linear programming (ALP) average cost solutions and policies for multiclass queueing networks. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2012-05-5441

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Gurfein, Kate Elizabeth. “Evaluation of basis functions for generating approximate linear programming (ALP) average cost solutions and policies for multiclass queueing networks.” 2012. Thesis, University of Texas – Austin. Accessed August 24, 2019. http://hdl.handle.net/2152/ETD-UT-2012-05-5441.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th 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. 24 Aug 2019.

Vancouver:

Gurfein KE. Evaluation of basis functions for generating approximate linear programming (ALP) average cost solutions and policies for multiclass queueing networks. [Internet] [Thesis]. University of Texas – Austin; 2012. [cited 2019 Aug 24]. Available from: http://hdl.handle.net/2152/ETD-UT-2012-05-5441.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

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. [Thesis]. University of Texas – Austin; 2012. Available from: http://hdl.handle.net/2152/ETD-UT-2012-05-5441

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Texas – Austin

9. Ng, Man Wo. Travel time reliability assessment techniques for large-scale stochastic transportation networks.

Degree: Civil, Architectural, and Environmental Engineering, 2010, University of Texas – Austin

URL: http://hdl.handle.net/2152/ETD-UT-2010-05-1050

► Real-life transportation systems are subject to numerous uncertainties in their operation. Researchers have suggested various reliability measures to characterize their network-level performances. One of these… (more)

▼ Real-life transportation systems are subject to numerous uncertainties in their operation. Researchers have suggested various reliability measures to characterize their network-level performances. One of these measures is given by travel time reliability, defined as the probability that travel times remain below certain (acceptable) levels. Existing reliability assessment (and optimization) techniques tend to be computationally intensive. In this dissertation we develop computationally efficient alternatives. In particular, we make the following three contributions. In the first contribution, we present a novel reliability assessment methodology when the source of uncertainty is given by road capacities. More specifically, we present a method based on the theory of Fourier transforms to numerically approximate the probability density function of the (system-wide) travel time. The proposed methodology takes advantage of the established computational efficiency of the fast Fourier transform. In the second contribution, we relax the common assumption that probability distributions of the sources of uncertainties are known explicitly. In reality, this distribution may be unavailable (or inaccurate) as we may have no (or insufficient) data to calibrate the distributions. We present a new method to assess travel time reliability that is distribution-free in the sense that the methodology only requires that the first N moments (where N is any positive integer) of the travel time to be known and that the travel times reside in a set of known and bounded intervals. Instead of deriving exact probabilities on travel times exceeding certain thresholds via computationally intensive methods, we develop analytical probability inequalities to quickly obtain upper bounds on the desired probability. Because of the computationally intensive nature of (virtually all) existing reliability assessment techniques, the optimization of the reliability of transportation systems has generally been computationally prohibitive. The third and final contribution of this dissertation is the introduction of a new transportation network design model in which the objective is to minimize the unreliability of travel time. The computational requirements are shown to be much lower due to the assessment techniques developed in this dissertation. Moreover, numerical results suggest that it has the potential to form a computationally efficient proxy for current simulation-based network design models. Advisors/Committee Members: Waller, S. Travis (advisor), Kockelman, Kara M. (committee member), Zhang, Zhanmin (committee member), Hasenbein, John J. (committee member), Morton, David P. (committee member).

Subjects/Keywords: Travel time; Reliability; Stochastic, uncertain; Fast Fourier transform; Distribution-free probability inequalities; Network design problem; Genetic algorithm

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Ng, M. W. (2010). Travel time reliability assessment techniques for large-scale stochastic transportation networks. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2010-05-1050

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Ng, Man Wo. “Travel time reliability assessment techniques for large-scale stochastic transportation networks.” 2010. Thesis, University of Texas – Austin. Accessed August 24, 2019. http://hdl.handle.net/2152/ETD-UT-2010-05-1050.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Ng, Man Wo. “Travel time reliability assessment techniques for large-scale stochastic transportation networks.” 2010. Web. 24 Aug 2019.

Vancouver:

Ng MW. Travel time reliability assessment techniques for large-scale stochastic transportation networks. [Internet] [Thesis]. University of Texas – Austin; 2010. [cited 2019 Aug 24]. Available from: http://hdl.handle.net/2152/ETD-UT-2010-05-1050.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ng MW. Travel time reliability assessment techniques for large-scale stochastic transportation networks. [Thesis]. University of Texas – Austin; 2010. Available from: http://hdl.handle.net/2152/ETD-UT-2010-05-1050

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Texas – Austin

10. Sadiq, Bilal. Optimality and robustness in opportunistic scheduler design for wireless networks.

Degree: Electrical and Computer Engineering, 2010, University of Texas – Austin

URL: http://hdl.handle.net/2152/ETD-UT-2010-08-1548

► We investigate in detail two multiuser opportunistic scheduling problems in centralized wireless systems: the scheduling of "delay-sensitive" flows with packet delay requirements of a few… (more)

▼ We investigate in detail two multiuser opportunistic scheduling problems in centralized wireless systems: the scheduling of "delay-sensitive" flows with packet delay requirements of a few tens to few hundreds of milliseconds over the air interface, and the scheduling of "best-effort" flows with the objective of minimizing mean file transfer delay. Schedulers for delay-sensitive flows are characterized by a fundamental tradeoff between "maximizing total service rate by being opportunistic" and "balancing unequal queues (or delays) across users". In choosing how to realize this tradeoff in schedulers, our key premise is that "robustness" should be a primary design objective alongside performance. Different performance objectives – mean packet delay, the tail of worst user's queue distribution, or that of the overall queue distribution – result in remarkably different scheduling policies. Different design objectives and resulting schedulers are also not equally robust, which is important due to the uncertainty and variability in both the wireless environment and the traffic. The proposed class of schedulers offers low packet delays, less sensitivity to the scheduler parameters and channel characteristics, and a more graceful degradation of service in terms of the fraction of users meeting their delay requirements under transient overloads, when compared with other well-known schedulers. Schedulers for best-effort flows are characterized by a fundamental tradeoff between "maximizing the total service rate" and "prioritizing flows with short residual sizes". We characterize two regimes based on the "degree" of opportunistic gain present in the system. In the first regime – where the opportunistic capacity of the system increases sharply with the number of users – the use of residual flow-size information in scheduling will 'not' result in a significant reduction in flow-level delays. Whereas, in the second regime – where the opportunistic capacity increases slowly with the number of users – using flow-size information alongside channel state information 'may' result in a significant reduction. We then propose a class of schedulers which offers good performance in either regime, in terms of mean file transfer delays as well as probability of blocking for systems that enforce flow admission control. This thesis provides a comprehensive theoretical study of these fundamental tradeoffs for opportunistic schedulers, as well as an exploration of some of the practical ramifications to engineering wireless systems. Advisors/Committee Members: De Veciana, Gustavo (advisor), Andrews, Jeffery G. (committee member), Arapostathis, Aristotle (committee member), Hasenbein, John J. (committee member), Shakkottai, Sanjay (committee member).

Subjects/Keywords: Opportunistic scheduling; Opportunistic scheduler; Wireless systems; Delay-sensitive flows; Best-effort flows

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Sadiq, B. (2010). Optimality and robustness in opportunistic scheduler design for wireless networks. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2010-08-1548

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Sadiq, Bilal. “Optimality and robustness in opportunistic scheduler design for wireless networks.” 2010. Thesis, University of Texas – Austin. Accessed August 24, 2019. http://hdl.handle.net/2152/ETD-UT-2010-08-1548.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Sadiq, Bilal. “Optimality and robustness in opportunistic scheduler design for wireless networks.” 2010. Web. 24 Aug 2019.

Vancouver:

Sadiq B. Optimality and robustness in opportunistic scheduler design for wireless networks. [Internet] [Thesis]. University of Texas – Austin; 2010. [cited 2019 Aug 24]. Available from: http://hdl.handle.net/2152/ETD-UT-2010-08-1548.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sadiq B. Optimality and robustness in opportunistic scheduler design for wireless networks. [Thesis]. University of Texas – Austin; 2010. Available from: http://hdl.handle.net/2152/ETD-UT-2010-08-1548

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Texas – Austin

11. Belyi, Dmitriy. Optimization models and methods under nonstationary uncertainty.

Degree: Mechanical Engineering, 2010, University of Texas – Austin

URL: http://hdl.handle.net/2152/ETD-UT-2010-08-1685

► This research focuses on finding the optimal maintenance policy for an item with varying failure behavior. We analyze several types of item failure rates and… (more)

Subjects/Keywords: Maintenance optimization; Stochastic optimization; Failure rate modeling; Bayesian nonparametrics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Belyi, D. (2010). Optimization models and methods under nonstationary uncertainty. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2010-08-1685

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Belyi, Dmitriy. “Optimization models and methods under nonstationary uncertainty.” 2010. Thesis, University of Texas – Austin. Accessed August 24, 2019. http://hdl.handle.net/2152/ETD-UT-2010-08-1685.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Belyi, Dmitriy. “Optimization models and methods under nonstationary uncertainty.” 2010. Web. 24 Aug 2019.

Vancouver:

Belyi D. Optimization models and methods under nonstationary uncertainty. [Internet] [Thesis]. University of Texas – Austin; 2010. [cited 2019 Aug 24]. Available from: http://hdl.handle.net/2152/ETD-UT-2010-08-1685.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Belyi D. Optimization models and methods under nonstationary uncertainty. [Thesis]. University of Texas – Austin; 2010. Available from: http://hdl.handle.net/2152/ETD-UT-2010-08-1685

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Texas – Austin

12. Zarifoglu, Emrah. Planning and scheduling in semiconductor manufacturing.

Degree: Mechanical Engineering, 2010, University of Texas – Austin

URL: http://hdl.handle.net/2152/ETD-UT-2010-08-1803

► Semiconductor manufacturing is one of the most complex existing manufacturing systems. It requires constant improvement to meet demands and expectations. This dissertation studies semiconductor manufacturing… (more)

Subjects/Keywords: Planning; Scheduling; Semiconductor manufacturing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Zarifoglu, E. (2010). Planning and scheduling in semiconductor manufacturing. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2010-08-1803

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Zarifoglu, Emrah. “Planning and scheduling in semiconductor manufacturing.” 2010. Thesis, University of Texas – Austin. Accessed August 24, 2019. http://hdl.handle.net/2152/ETD-UT-2010-08-1803.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Zarifoglu, Emrah. “Planning and scheduling in semiconductor manufacturing.” 2010. Web. 24 Aug 2019.

Vancouver:

Zarifoglu E. Planning and scheduling in semiconductor manufacturing. [Internet] [Thesis]. University of Texas – Austin; 2010. [cited 2019 Aug 24]. Available from: http://hdl.handle.net/2152/ETD-UT-2010-08-1803.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zarifoglu E. Planning and scheduling in semiconductor manufacturing. [Thesis]. University of Texas – Austin; 2010. Available from: http://hdl.handle.net/2152/ETD-UT-2010-08-1803

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Texas – Austin

13. Rengarajan, Tara. Probabilistic bicriteria models : sampling methodologies and solution strategies.

Degree: Mechanical Engineering, 2010, University of Texas – Austin

URL: http://hdl.handle.net/2152/ETD-UT-2010-08-1827

► Many complex systems involve simultaneous optimization of two or more criteria, with uncertainty of system parameters being a key driver in decision making. In this… (more)

▼ Many complex systems involve simultaneous optimization of two or more criteria, with uncertainty of system parameters being a key driver in decision making. In this thesis, we consider probabilistic bicriteria models in which we seek to operate a system reliably, keeping operating costs low at the same time. High reliability translates into low risk of uncertain events that can adversely impact the system. In bicriteria decision making, a good solution must, at the very least, have the property that the criteria cannot both be improved relative to it. The problem of identifying a broad spectrum of such solutions can be highly involved with no analytical or robust numerical techniques readily available, particularly when the system involves nontrivial stochastics. This thesis serves as a step in the direction of addressing this issue. We show how to construct approximate solutions using Monte Carlo sampling, that are sufficiently close to optimal, easily calculable and subject to a low margin of error. Our approximations can be used in bicriteria decision making across several domains that involve significant risk such as finance, logistics and revenue management. As a first approach, we place a premium on a low risk threshold, and examine the effects of a sampling technique that guarantees a prespecified upper bound on risk. Our model incorporates a novel construct in the form of an uncertain disrupting event whose time and magnitude of occurrence are both random. We show that stratifying the sample observations in an optimal way can yield savings of a high order. We also demonstrate the existence of generalized stratification techniques which enjoy this property, and which can be used without full distributional knowledge of the parameters that govern the time of disruption. Our work thus provides a computationally tractable approach for solving a wide range of bicriteria models via sampling with a probabilistic guarantee on risk. Improved proximity to the efficient frontier is illustrated in the context of a perishable inventory problem. In contrast to this approach, we next aim to solve a bicriteria facility sizing model, in which risk is the probability the system fails to jointly satisfy a vector-valued random demand. Here, instead of seeking a probabilistic guarantee on risk, we instead seek to approximate well the efficient frontier for a range of risk levels of interest. Replacing the risk measure with an empirical measure induced by a random sample, we proceed to solve a family of parametric chance-constrained and cost-constrained models. These two sampling-based approximations differ substantially in terms of what is known regarding their asymptotic behavior, their computational tractability, and even their feasibility as compared to the underlying "true" family of models. We establish however, that in the bicriteria setting we have the freedom to employ either the chance-constrained or cost-constrained family of models, improving our ability to characterize the quality of the efficient frontiers… Advisors/Committee Members: Morton, David P. (advisor), Hasenbein, John J. (committee member), Kutanoglu, Erhan (committee member), Muthuraman, Kumar (committee member), Popova, Elmira (committee member).

Subjects/Keywords: Bicriteria; Risk; Sampling; Efficient frontier; Models; Decision making

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Rengarajan, T. (2010). Probabilistic bicriteria models : sampling methodologies and solution strategies. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2010-08-1827

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Rengarajan, Tara. “Probabilistic bicriteria models : sampling methodologies and solution strategies.” 2010. Thesis, University of Texas – Austin. Accessed August 24, 2019. http://hdl.handle.net/2152/ETD-UT-2010-08-1827.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Rengarajan, Tara. “Probabilistic bicriteria models : sampling methodologies and solution strategies.” 2010. Web. 24 Aug 2019.

Vancouver:

Rengarajan T. Probabilistic bicriteria models : sampling methodologies and solution strategies. [Internet] [Thesis]. University of Texas – Austin; 2010. [cited 2019 Aug 24]. Available from: http://hdl.handle.net/2152/ETD-UT-2010-08-1827.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rengarajan T. Probabilistic bicriteria models : sampling methodologies and solution strategies. [Thesis]. University of Texas – Austin; 2010. Available from: http://hdl.handle.net/2152/ETD-UT-2010-08-1827

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Texas – Austin

14. -3880-9783. Models and methods for operational planning in freight railroads.

Degree: 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)

Subjects/Keywords: Optimization; Railroad operational planning

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

-3880-9783. (2015). Models and methods for operational planning in freight railroads. (Thesis). 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
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

-3880-9783. “Models and methods for operational planning in freight railroads.” 2015. Thesis, University of Texas – Austin. Accessed August 24, 2019. http://hdl.handle.net/2152/31604.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

-3880-9783. “Models and methods for operational planning in freight railroads.” 2015. Web. 24 Aug 2019.

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] [Thesis]. University of Texas – Austin; 2015. [cited 2019 Aug 24]. 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
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

-3880-9783. Models and methods for operational planning in freight railroads. [Thesis]. 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
Not specified: Masters Thesis or Doctoral Dissertation

University of Texas – Austin

15. Sisbot, Emre Arda. Fluid and queueing networks with Gurvich-type routing.

Degree: 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)

Subjects/Keywords: Markov decision processes; Queueing theory; Optimal control; Fluid model; Scheduling; Routing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Sisbot, E. A. (2015). Fluid and queueing networks with Gurvich-type routing. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/32536

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Sisbot, Emre Arda. “Fluid and queueing networks with Gurvich-type routing.” 2015. Thesis, University of Texas – Austin. Accessed August 24, 2019. http://hdl.handle.net/2152/32536.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Sisbot, Emre Arda. “Fluid and queueing networks with Gurvich-type routing.” 2015. Web. 24 Aug 2019.

Vancouver:

Sisbot EA. Fluid and queueing networks with Gurvich-type routing. [Internet] [Thesis]. University of Texas – Austin; 2015. [cited 2019 Aug 24]. Available from: http://hdl.handle.net/2152/32536.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sisbot EA. Fluid and queueing networks with Gurvich-type routing. [Thesis]. University of Texas – Austin; 2015. Available from: http://hdl.handle.net/2152/32536

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Texas – Austin

16. -2165-4068. Efficient sequential probability assessment heuristic in decision analysis.

Degree: 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

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

-2165-4068. (2015). Efficient sequential probability assessment heuristic in decision analysis. (Thesis). 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
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

-2165-4068. “Efficient sequential probability assessment heuristic in decision analysis.” 2015. Thesis, University of Texas – Austin. Accessed August 24, 2019. http://hdl.handle.net/2152/33281.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

-2165-4068. “Efficient sequential probability assessment heuristic in decision analysis.” 2015. Web. 24 Aug 2019.

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] [Thesis]. University of Texas – Austin; 2015. [cited 2019 Aug 24]. 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
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

-2165-4068. Efficient sequential probability assessment heuristic in decision analysis. [Thesis]. 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
Not specified: Masters Thesis or Doctoral Dissertation

University of Texas – Austin

17. -8916-5076. Post-contingency states representation and redispatch for restoration in power systems operation.

Degree: 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

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

-8916-5076. (2018). Post-contingency states representation and redispatch for restoration in power systems operation. (Thesis). 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
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

-8916-5076. “Post-contingency states representation and redispatch for restoration in power systems operation.” 2018. Thesis, University of Texas – Austin. Accessed August 24, 2019. http://hdl.handle.net/2152/63632.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

-8916-5076. “Post-contingency states representation and redispatch for restoration in power systems operation.” 2018. Web. 24 Aug 2019.

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] [Thesis]. University of Texas – Austin; 2018. [cited 2019 Aug 24]. 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
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

-8916-5076. Post-contingency states representation and redispatch for restoration in power systems operation. [Thesis]. 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
Not specified: Masters Thesis or Doctoral Dissertation

University of Texas – Austin

18. -3292-7049. Joint maintenance and production operations decision making in flexible manufacturing systems.

Degree: 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

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

-3292-7049. (2016). Joint maintenance and production operations decision making in flexible manufacturing systems. (Thesis). 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
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

-3292-7049. “Joint maintenance and production operations decision making in flexible manufacturing systems.” 2016. Thesis, University of Texas – Austin. Accessed August 24, 2019. http://hdl.handle.net/2152/46237.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

-3292-7049. “Joint maintenance and production operations decision making in flexible manufacturing systems.” 2016. Web. 24 Aug 2019.

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] [Thesis]. University of Texas – Austin; 2016. [cited 2019 Aug 24]. 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
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

-3292-7049. Joint maintenance and production operations decision making in flexible manufacturing systems. [Thesis]. 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
Not specified: Masters Thesis or Doctoral Dissertation

University of Texas – Austin

19. -1709-7032. Resource allocation in service and logistics systems.

Degree: Operations Research and 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

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

-1709-7032. (2016). Resource allocation in service and logistics systems. (Thesis). 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
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

-1709-7032. “Resource allocation in service and logistics systems.” 2016. Thesis, University of Texas – Austin. Accessed August 24, 2019. http://hdl.handle.net/2152/47042.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

-1709-7032. “Resource allocation in service and logistics systems.” 2016. Web. 24 Aug 2019.

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] [Thesis]. University of Texas – Austin; 2016. [cited 2019 Aug 24]. 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
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

-1709-7032. Resource allocation in service and logistics systems. [Thesis]. 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
Not specified: Masters Thesis or Doctoral Dissertation

University of Texas – Austin

20. -1113-1730. Optimization models for manufacturing and personnel scheduling.

Degree: Operations Research and Industrial Engineering, 2017, University of Texas – Austin

URL: http://hdl.handle.net/2152/61924

► Personnel scheduling problems have been studied by many researchers over the last five decades but much of the literature has ignored the array of break… (more)

▼ Personnel scheduling problems have been studied by many researchers over the last five decades but much of the literature has ignored the array of break types used in practice. We investigate the benefits that flexibility offers in daily shift scheduling, especially when demand is uncertain. The different forms of flexibility considered include shift start times, the number of breaks, break lengths, and break placement. Five related mixed-integer programming models are developed and used to compare break scheduling in advance and either sequentially or in real time for various shift and break profiles. In addition, we investigate the same problem under stochastic demand. We formulate a multi-stage stochastic programming model and then transform it into a two-stage model to ease the computational burden. For testing purpose, we consider 61 scenarios. Five metrics are used for evaluating performance. While the full range of shift and break options are rarely considered in personnel scheduling problems, many practical aspects of machine setups have been neglected in scheduling semiconductor assembly and test (AT) operations. We examine all sides of the problem in a multi-machine, multi-tooling environment to see the impact of using a hierarchical approach to setups on facility performance. The primary objectives of the problem investigated are to minimize the number of shortages of key devices and to maximize weighted throughput, in that order, over a planning horizon of up to five days. Secondary objectives include minimizing the number of machines used to meet output targets, and minimizing makespan. For the shift scheduling problems with flexible breaks the application studied involves airport ground handlers; for the hierarchical machine setup problem for semiconductor assembly and test facilities testing was done with data provided by Texas Instruments. In Chapter 2, we investigate the benefits of flexibility for shifts and breaks with both deterministic and randomized demand. A rolling horizon approach is proposed for real-time break scheduling as demand unfolds over the day. In Chapter 3, we extend the shift scheduling problem to more realistically accommodate stochasticity. We introduce a two-stage stochastic programming model and determine the value of stochastic solutions and the expected value of perfect information. In Chapter 4, we develop an optimization model for scheduling multi-pass lots under hierarchical machine setup rules at assembly and test facilities. We determine machine setups, lot assignments and sequences using a greedy randomized adaptive search procedure. Advisors/Committee Members: Bard, Jonathan F. (advisor), Hasenbein, John J (committee member), Kutanoglu, Erhan (committee member), Kiermaier, Ferdinand (committee member), Frey, Markus (committee member).

Subjects/Keywords: Shift scheduling; Flexible breaks; Rolling horizon framework; Real-time break assignments; Stochastic optimization; Baggage handlers; Implicit modeling of breaks; Semiconductor assembly and test facility; Back-end operations; Hierarchical setups; Reentrant flow; GRASP

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

-1113-1730. (2017). Optimization models for manufacturing and personnel scheduling. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/61924

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

-1113-1730. “Optimization models for manufacturing and personnel scheduling.” 2017. Thesis, University of Texas – Austin. Accessed August 24, 2019. http://hdl.handle.net/2152/61924.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

-1113-1730. “Optimization models for manufacturing and personnel scheduling.” 2017. Web. 24 Aug 2019.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

-1113-1730. Optimization models for manufacturing and personnel scheduling. [Internet] [Thesis]. University of Texas – Austin; 2017. [cited 2019 Aug 24]. Available from: http://hdl.handle.net/2152/61924.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

-1113-1730. Optimization models for manufacturing and personnel scheduling. [Thesis]. University of Texas – Austin; 2017. Available from: http://hdl.handle.net/2152/61924

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

University of Texas – Austin

21. -3979-4771. Design and performance of resource allocation mechanisms for network slicing.

Degree: 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

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

-3979-4771. (2018). Design and performance of resource allocation mechanisms for network slicing. (Thesis). 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
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

-3979-4771. “Design and performance of resource allocation mechanisms for network slicing.” 2018. Thesis, University of Texas – Austin. Accessed August 24, 2019. http://hdl.handle.net/2152/68642.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

-3979-4771. “Design and performance of resource allocation mechanisms for network slicing.” 2018. Web. 24 Aug 2019.

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] [Thesis]. University of Texas – Austin; 2018. [cited 2019 Aug 24]. 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
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

-3979-4771. Design and performance of resource allocation mechanisms for network slicing. [Thesis]. 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
Not specified: Masters Thesis or Doctoral Dissertation

University of Texas – Austin

22. -6943-657X. Optimal spatiotemporal resource allocation in public health and renewable energy.

Degree: Operations Research and 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)

Subjects/Keywords: Stochastic optimization; Chance-constrained programming; Pumped-hydroelectric system; Public health

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

-6943-657X. (2016). Optimal spatiotemporal resource allocation in public health and renewable energy. (Thesis). 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
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

-6943-657X. “Optimal spatiotemporal resource allocation in public health and renewable energy.” 2016. Thesis, University of Texas – Austin. Accessed August 24, 2019. http://hdl.handle.net/2152/44589.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

-6943-657X. “Optimal spatiotemporal resource allocation in public health and renewable energy.” 2016. Web. 24 Aug 2019.

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] [Thesis]. University of Texas – Austin; 2016. [cited 2019 Aug 24]. 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
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

-6943-657X. Optimal spatiotemporal resource allocation in public health and renewable energy. [Thesis]. 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
Not specified: Masters Thesis or Doctoral Dissertation

23. Levin, Michael William. Modeling and optimizing network infrastructure for autonomous vehicles.

Degree: Civil, Architectural, and Environmental 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

13 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Levin, M. W. (2017). Modeling and optimizing network infrastructure for autonomous vehicles. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/47311

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Levin, Michael William. “Modeling and optimizing network infrastructure for autonomous vehicles.” 2017. Thesis, University of Texas – Austin. Accessed August 24, 2019. http://hdl.handle.net/2152/47311.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Levin, Michael William. “Modeling and optimizing network infrastructure for autonomous vehicles.” 2017. Web. 24 Aug 2019.

Vancouver:

Levin MW. Modeling and optimizing network infrastructure for autonomous vehicles. [Internet] [Thesis]. University of Texas – Austin; 2017. [cited 2019 Aug 24]. Available from: http://hdl.handle.net/2152/47311.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Levin MW. Modeling and optimizing network infrastructure for autonomous vehicles. [Thesis]. University of Texas – Austin; 2017. Available from: http://hdl.handle.net/2152/47311

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

24. Zoghby, Jeriad Marcus. Critical arc strategies for the reentrant job shop scheduling problem with setups.

Degree: 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

10 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Zoghby, J. M. (2002). Critical arc strategies for the reentrant job shop scheduling problem with setups. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/1656

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Zoghby, Jeriad Marcus. “Critical arc strategies for the reentrant job shop scheduling problem with setups.” 2002. Thesis, University of Texas – Austin. Accessed August 24, 2019. http://hdl.handle.net/2152/1656.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Zoghby, Jeriad Marcus. “Critical arc strategies for the reentrant job shop scheduling problem with setups.” 2002. Web. 24 Aug 2019.

Vancouver:

Zoghby JM. Critical arc strategies for the reentrant job shop scheduling problem with setups. [Internet] [Thesis]. University of Texas – Austin; 2002. [cited 2019 Aug 24]. Available from: http://hdl.handle.net/2152/1656.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zoghby JM. Critical arc strategies for the reentrant job shop scheduling problem with setups. [Thesis]. University of Texas – Austin; 2002. Available from: http://hdl.handle.net/2152/1656

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

25. Shen, Yue, master of science in engineering. Amusement park visitor routes design and optimization.

Degree: 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)

Subjects/Keywords: Amusement park operations; Visitor routes management; Two-phase heuristics; Attraction simulation; Queue waiting time; Route construction algorithm; Mixed integer programming

8 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Shen, Yue, m. o. s. i. e. (2012). Amusement park visitor routes design and optimization. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2012-05-5652

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Shen, Yue, master of science in engineering. “Amusement park visitor routes design and optimization.” 2012. Thesis, University of Texas – Austin. Accessed August 24, 2019. http://hdl.handle.net/2152/ETD-UT-2012-05-5652.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Shen, Yue, master of science in engineering. “Amusement park visitor routes design and optimization.” 2012. Web. 24 Aug 2019.

Vancouver:

Shen, Yue mosie. Amusement park visitor routes design and optimization. [Internet] [Thesis]. University of Texas – Austin; 2012. [cited 2019 Aug 24]. Available from: http://hdl.handle.net/2152/ETD-UT-2012-05-5652.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Shen, Yue mosie. Amusement park visitor routes design and optimization. [Thesis]. University of Texas – Austin; 2012. Available from: http://hdl.handle.net/2152/ETD-UT-2012-05-5652

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

26. Ng, Man Wo. Generalizing the multivariate normality assumption in the simulation of dependencies in transportation systems.

Degree: Mathematics, 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)

Subjects/Keywords: Correlation; Multivariate normal distribution; Simulation; Transportation; Dependence

7 more images…

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Ng, M. W. (2010). Generalizing the multivariate normality assumption in the simulation of dependencies in transportation systems. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2010-05-1122

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Ng, Man Wo. “Generalizing the multivariate normality assumption in the simulation of dependencies in transportation systems.” 2010. Thesis, University of Texas – Austin. Accessed August 24, 2019. http://hdl.handle.net/2152/ETD-UT-2010-05-1122.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Ng, Man Wo. “Generalizing the multivariate normality assumption in the simulation of dependencies in transportation systems.” 2010. Web. 24 Aug 2019.

Vancouver:

Ng MW. Generalizing the multivariate normality assumption in the simulation of dependencies in transportation systems. [Internet] [Thesis]. University of Texas – Austin; 2010. [cited 2019 Aug 24]. Available from: http://hdl.handle.net/2152/ETD-UT-2010-05-1122.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ng MW. Generalizing the multivariate normality assumption in the simulation of dependencies in transportation systems. [Thesis]. University of Texas – Austin; 2010. Available from: http://hdl.handle.net/2152/ETD-UT-2010-05-1122

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

27. Nadimpalli, Vamsi Krishna. An average cost Markov decision process model to decide when to challenge a call in a tennis match.

Degree: 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)

Subjects/Keywords: Tennis; Markov decision process; Call challenge; Linear programming

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Nadimpalli, V. K. (2010). An average cost Markov decision process model to decide when to challenge a call in a tennis match. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2010-08-1822

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Nadimpalli, Vamsi Krishna. “An average cost Markov decision process model to decide when to challenge a call in a tennis match.” 2010. Thesis, University of Texas – Austin. Accessed August 24, 2019. http://hdl.handle.net/2152/ETD-UT-2010-08-1822.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Nadimpalli, Vamsi Krishna. “An average cost Markov decision process model to decide when to challenge a call in a tennis match.” 2010. Web. 24 Aug 2019.

Vancouver:

Nadimpalli VK. An average cost Markov decision process model to decide when to challenge a call in a tennis match. [Internet] [Thesis]. University of Texas – Austin; 2010. [cited 2019 Aug 24]. Available from: http://hdl.handle.net/2152/ETD-UT-2010-08-1822.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Nadimpalli VK. An average cost Markov decision process model to decide when to challenge a call in a tennis match. [Thesis]. University of Texas – Austin; 2010. Available from: http://hdl.handle.net/2152/ETD-UT-2010-08-1822

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Texas – Austin

28. Whittemore, Anthony Ryan. Modeling machine degradation with Hidden Markov Models.

Degree: Operations Research and 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

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Whittemore, A. R. (2018). Modeling machine degradation with Hidden Markov Models. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/68912

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Whittemore, Anthony Ryan. “Modeling machine degradation with Hidden Markov Models.” 2018. Thesis, University of Texas – Austin. Accessed August 24, 2019. http://hdl.handle.net/2152/68912.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Whittemore, Anthony Ryan. “Modeling machine degradation with Hidden Markov Models.” 2018. Web. 24 Aug 2019.

Vancouver:

Whittemore AR. Modeling machine degradation with Hidden Markov Models. [Internet] [Thesis]. University of Texas – Austin; 2018. [cited 2019 Aug 24]. Available from: http://hdl.handle.net/2152/68912.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Whittemore AR. Modeling machine degradation with Hidden Markov Models. [Thesis]. University of Texas – Austin; 2018. Available from: http://hdl.handle.net/2152/68912

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Texas – Austin

29. Yildirim, Utku. Stability and pricing of queueing models.

Degree: 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

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Yildirim, U. (2006). Stability and pricing of queueing models. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/2958

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Yildirim, Utku. “Stability and pricing of queueing models.” 2006. Thesis, University of Texas – Austin. Accessed August 24, 2019. http://hdl.handle.net/2152/2958.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Yildirim, Utku. “Stability and pricing of queueing models.” 2006. Web. 24 Aug 2019.

Vancouver:

Yildirim U. Stability and pricing of queueing models. [Internet] [Thesis]. University of Texas – Austin; 2006. [cited 2019 Aug 24]. Available from: http://hdl.handle.net/2152/2958.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Yildirim U. Stability and pricing of queueing models. [Thesis]. University of Texas – Austin; 2006. Available from: http://hdl.handle.net/2152/2958

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Texas – Austin

30. Sampath, Balaji, 1977-. Scheduling and stability analysis of Cambridge Ring.

Degree: 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)

Subjects/Keywords: Queuing networks (Data transmission) – Mathematical models; Queuing theory

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Sampath, Balaji, 1. (2007). Scheduling and stability analysis of Cambridge Ring. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/3164

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Sampath, Balaji, 1977-. “Scheduling and stability analysis of Cambridge Ring.” 2007. Thesis, University of Texas – Austin. Accessed August 24, 2019. http://hdl.handle.net/2152/3164.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Sampath, Balaji, 1977-. “Scheduling and stability analysis of Cambridge Ring.” 2007. Web. 24 Aug 2019.

Vancouver:

Sampath, Balaji 1. Scheduling and stability analysis of Cambridge Ring. [Internet] [Thesis]. University of Texas – Austin; 2007. [cited 2019 Aug 24]. Available from: http://hdl.handle.net/2152/3164.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sampath, Balaji 1. Scheduling and stability analysis of Cambridge Ring. [Thesis]. University of Texas – Austin; 2007. Available from: http://hdl.handle.net/2152/3164

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

		in
And / Or
		in
And / Or
		in
And / Or
		in

Open Access Theses and Dissertations