You searched for subject:(operations research).
Showing records 1 – 30 of
3644 total matches.
◁ [1] [2] [3] [4] [5] … [122] ▶
1.
Holsopple, Jared.
Fusia| Future situation and impact awareness.
Degree: 2016, State University of New York at Buffalo
URL: http://pqdtopen.proquest.com/#viewpdf?dispub=10127757 
► Future Situation and Impact Awareness: FuSIA is a mission-centric framework using uncertain observables to determine the current and future impact for critical missions in…
(more)
▼ Future Situation and Impact Awareness: FuSIA is a mission-centric framework using uncertain observables to determine the current and future impact for critical missions in an application such as protecting a computer network or protecting critical entities in a military environment. FuSIA serves to provide an implement of a domain-agnostic, yet domain-configurable, framework for higher level data fusion processes such as situation, impact, and threat assessment. FuSIA ingests groupings of observables called attack tracks to estimate the current state of the assets in the given environment using state estimation. The state estimates can be combined across various in different ways to account for uncertainty through the use of the common mass function, which can be converted into a mission impact score. These assessments can then be processed by a mission tree that calculates the estimated impact of the critical missions, which is modeled by a mission tree. The mission tree uses a modification to the Yager Order-Weighted Aggregators to propagate not only the impact, but also uncertainty into the higher-level missions. The effectiveness of the mission impact calculations was also analyzed to determine how sensitive it was to different levels of uncertainty pertaining to different observables. In addition to calculating current mission impact, FuSIA also generates a list of possible futures indicating events that could come to fruition in the near future. This list is pruned down to a human-manageable level through a process that involves assessing the likelihood of the futures using capability and opportunity metrics. Finally, FuSIA solves a mixed-integer linear optimization problem for individual nodes on the mission tree while providing a heuristic algorithm to determine an optimal set of enforcers, actions that can be taken to improve a mission, to deploy so as the improve the overall state of the mission.
Subjects/Keywords: Operations research
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Holsopple, J. (2016). Fusia| Future situation and impact awareness. (Thesis). State University of New York at Buffalo. Retrieved from http://pqdtopen.proquest.com/#viewpdf?dispub=10127757
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Holsopple, Jared. “Fusia| Future situation and impact awareness.” 2016. Thesis, State University of New York at Buffalo. Accessed March 07, 2021.
http://pqdtopen.proquest.com/#viewpdf?dispub=10127757.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Holsopple, Jared. “Fusia| Future situation and impact awareness.” 2016. Web. 07 Mar 2021.
Vancouver:
Holsopple J. Fusia| Future situation and impact awareness. [Internet] [Thesis]. State University of New York at Buffalo; 2016. [cited 2021 Mar 07].
Available from: http://pqdtopen.proquest.com/#viewpdf?dispub=10127757.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Holsopple J. Fusia| Future situation and impact awareness. [Thesis]. State University of New York at Buffalo; 2016. Available from: http://pqdtopen.proquest.com/#viewpdf?dispub=10127757
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
2.
Roshanaei, Vahid.
Mathematical Modelling and Optimization of Flexible Job
Shops Scheduling Problem.
Degree: MA, Industrial and Manufacturing Systems
Engineering, 2012, National Library of Canada
URL: http://scholar.uwindsor.ca/etd/157
► The flexible job shop scheduling problem (F-JSSP) is mathematically formulated. One novel position-based and three sequence-based mixed integer linear programming models are developed. Since F-JSSPs…
(more)
▼ The flexible job shop scheduling problem
(F-JSSP) is mathematically formulated. One novel position-based and
three sequence-based mixed integer linear programming models are
developed. Since F-JSSPs are strongly NP-hard, MILPs fail to solve
large-size instances within a reasonable timeframe. Thus, a
meta-heuristic, a hybrid of artificial immune and simulated
annealing (AISA), is developed for use with larger instances of the
F-JSSP. To prove the efficiency of developed MILPs and AISA, they
are compared against state-of-the-art MILPs and meta-heuristics in
literature. Comparative evaluations are conducted to test the
quality and performance of the developed models and solution
technique respectively. To this end, size complexities of the
developed MILPs are investigated. The acquired results demonstrate
that the proposed MILPs outperform the state-of-the-art MILP models
in literature. Likewise, the proposed AISA outperforms all the
previously developed meta-heuristics. The developed AISA has
successfully been applied to a realistic case study from mould and
die industry.
Advisors/Committee Members: ElMaraghy, Hoda (Industrial and Manufacturing Systems Engineering).
Subjects/Keywords: Operations research.
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Roshanaei, V. (2012). Mathematical Modelling and Optimization of Flexible Job
Shops Scheduling Problem. (Masters Thesis). National Library of Canada. Retrieved from http://scholar.uwindsor.ca/etd/157
Chicago Manual of Style (16th Edition):
Roshanaei, Vahid. “Mathematical Modelling and Optimization of Flexible Job
Shops Scheduling Problem.” 2012. Masters Thesis, National Library of Canada. Accessed March 07, 2021.
http://scholar.uwindsor.ca/etd/157.
MLA Handbook (7th Edition):
Roshanaei, Vahid. “Mathematical Modelling and Optimization of Flexible Job
Shops Scheduling Problem.” 2012. Web. 07 Mar 2021.
Vancouver:
Roshanaei V. Mathematical Modelling and Optimization of Flexible Job
Shops Scheduling Problem. [Internet] [Masters thesis]. National Library of Canada; 2012. [cited 2021 Mar 07].
Available from: http://scholar.uwindsor.ca/etd/157.
Council of Science Editors:
Roshanaei V. Mathematical Modelling and Optimization of Flexible Job
Shops Scheduling Problem. [Masters Thesis]. National Library of Canada; 2012. Available from: http://scholar.uwindsor.ca/etd/157
Stanford University
3.
Jasin, Stefanus.
Asymptotically optimal heuristics for network Revenue Management.
Degree: 2011, Stanford University
URL: http://pqdtopen.proquest.com/#viewpdf?dispub=3471011
► We consider a network Revenue Management (RM) problem with multiple products and resources. Prices are assumed to be fixed. The objective is to design…
(more)
▼ We consider a network Revenue Management (RM) problem with multiple products and resources. Prices are assumed to be fixed. The objective is to design a dynamic resource allocation control in order to maximize expected revenue. As it is, the problem is computationally intractable and so the literature documents many attempts to develop near-optimal heuristics. Recently there has been some interests in studying the performance of heuristics constructed using the solutions of the so-called Deterministic Linear Program (DLP) formulation of the original RM problem. The appeal is obvious - an LP is easy to solve, and the formulation also lends itself to many intuitive interpretations. The drawback, however, is also obvious - the LP formulation only takes into account first-order information (i.e. expected value of future demand) and ignores the rest. A way to partly overcome this issue is by <i>re-optimizing </i> the control several times throughout the selling horizon. But how good is such approach? We show that the benefit of re-optimization depends largely on the specific of heuristics being used. That is, different LP-based heuristics may have very different performance under frequent re-optimization. Our main result: there exists an LP-based heuristic that has O(1) expected loss under sufficiently frequent re-optimization. That is, the loss of this heuristic is <i> independent</i> of the size of the problem. We also extend the result to a more general case with customer choice.
Subjects/Keywords: Operations Research
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Jasin, S. (2011). Asymptotically optimal heuristics for network Revenue Management. (Thesis). Stanford University. Retrieved from http://pqdtopen.proquest.com/#viewpdf?dispub=3471011
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Jasin, Stefanus. “Asymptotically optimal heuristics for network Revenue Management.” 2011. Thesis, Stanford University. Accessed March 07, 2021.
http://pqdtopen.proquest.com/#viewpdf?dispub=3471011.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Jasin, Stefanus. “Asymptotically optimal heuristics for network Revenue Management.” 2011. Web. 07 Mar 2021.
Vancouver:
Jasin S. Asymptotically optimal heuristics for network Revenue Management. [Internet] [Thesis]. Stanford University; 2011. [cited 2021 Mar 07].
Available from: http://pqdtopen.proquest.com/#viewpdf?dispub=3471011.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Jasin S. Asymptotically optimal heuristics for network Revenue Management. [Thesis]. Stanford University; 2011. Available from: http://pqdtopen.proquest.com/#viewpdf?dispub=3471011
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Columbia University
4.
Kim, Kyoung-Kuk.
Affine processes in finance| Numerical approximation, simulation and model properties.
Degree: 2008, Columbia University
URL: http://pqdtopen.proquest.com/#viewpdf?dispub=3333483
► This thesis deals with theoretical and numerical questions related to affine jump-diffusion models used in finance. In more detail, we look at three different…
(more)
▼ This thesis deals with theoretical and numerical questions related to affine jump-diffusion models used in finance. In more detail, we look at three different classes within the affine jump-diffusion class. The first is the Heston stochastic volatility model which has been used extensively since its first introduction by Heston (1993). To price financial derivatives with complex payoff structures, we have to resort to the Monte Carlo simulation. We propose new simulation schemes for the Heston model based on the squared Bessel bridge decomposition. These new methods perform well in different parameter settings and they are compared with two other existing methods, first, the exact scheme of Broadie and Kaya (2006) and, second, the QE method of Andersen (2005). The second question is about the tail behavior of the canonical affine diffusion processes which were introduced by Dai and Singleton (2000) in the context of financial econometrics to study the term structure of interest rates. We show that the canonical models have light tails or exponential bounded tails, and the explicit conditions that guarantee light tails are given. Moreover, we prove that there exists a unique limiting stationary distribution for each canonical model and the regions of finite exponential moments of such stationary distributions are determined by the stability region of the dynamical system associated with a given model. We further go into the detailed analysis of the dynamical system of a canonical affine diffusion process. We prove that the stability region of such a dynamical system can be represented by the union of stable sub-manifolds under some mild conditions, and also derive some partial differential equation of which solution is blow-up times of the dynamical system. Through an asymptotic analysis of those blow-up times, we calculate the implied volatility asymptotics for options with short maturities and extreme strikes based on Lee (2004). The third and final question involves the general affine jump-diffusion models. It is computationally too expensive to apply numerical integration schemes to compute vanilla option prices in an affine jump-diffusion model which does not have an explicit Fourier transform formula. To extend the category of models that can be tested in financial econometrics, we apply the well known saddlepoint technique to affine jump-diffusion models. After we develop the basic idea and review some known saddlepoint techniques, we test them for the Heston model, the model of stochastic volatility with jumps (SVJ) and the Scott model. Implementation details and some modifications of existing methods are also given.
Subjects/Keywords: Operations Research
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Kim, K. (2008). Affine processes in finance| Numerical approximation, simulation and model properties. (Thesis). Columbia University. Retrieved from http://pqdtopen.proquest.com/#viewpdf?dispub=3333483
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Kim, Kyoung-Kuk. “Affine processes in finance| Numerical approximation, simulation and model properties.” 2008. Thesis, Columbia University. Accessed March 07, 2021.
http://pqdtopen.proquest.com/#viewpdf?dispub=3333483.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Kim, Kyoung-Kuk. “Affine processes in finance| Numerical approximation, simulation and model properties.” 2008. Web. 07 Mar 2021.
Vancouver:
Kim K. Affine processes in finance| Numerical approximation, simulation and model properties. [Internet] [Thesis]. Columbia University; 2008. [cited 2021 Mar 07].
Available from: http://pqdtopen.proquest.com/#viewpdf?dispub=3333483.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Kim K. Affine processes in finance| Numerical approximation, simulation and model properties. [Thesis]. Columbia University; 2008. Available from: http://pqdtopen.proquest.com/#viewpdf?dispub=3333483
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
5.
Zhang, Yidong.
Long Term CO2 Sequestration System Modeling.
Degree: 2012, State University of New York at Buffalo
URL: http://pqdtopen.proquest.com/#viewpdf?dispub=3541321
► To satisfy the forecast of significantly increased demand and replacement or retrofit of aging power plants of in the next few decades, a large…
(more)
▼ To satisfy the forecast of significantly increased demand and replacement or retrofit of aging power plants of in the next few decades, a large amount of new power generation needs to come on line. Coal, an abundant resource in the U.S. remains an important part of the solution to this issue because of its availability. As a part of the solution to the energy issue, coal based plants have many advantages but one disadvantage which cannot be ignored: it can generate a significant amount of CO2 which has a serious impact on the green house effect. All other pollutants e.g. NO2, SO2 and particulate matters have been regulated on emissions, and CO2 is expected to be regulated in the near future. Carbon capture and storage (CCS), a critical technology pathway to mitigating the contribution of fossil fuel emissions of greenhouse gas is expensive. However, the technology may be improved to cost less than current coal based plants do by 2025 which would make sequestration of CO2 practical. Even so, there are still a variety of costs involved in a whole system approach: where, when and how to construct and operate potential new plants, retrofit the existing plants, construct and operate injection wells and pipelines. This is especially important with a planning horizon of 20–40 years. This necessitates the thorough development of a mathematical programming model of the entire system with consideration of all costs and revenues and environmental regulations. In this research, a comprehensive mathematical programming model is proposed to evaluate the full economic impact of such a system. Also, computational experiments for different scenarios are used to validate this model necessitating algorithmic development for large-scale instances.
Subjects/Keywords: Operations Research
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Zhang, Y. (2012). Long Term CO2 Sequestration System Modeling. (Thesis). State University of New York at Buffalo. Retrieved from http://pqdtopen.proquest.com/#viewpdf?dispub=3541321
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Zhang, Yidong. “Long Term CO2 Sequestration System Modeling.” 2012. Thesis, State University of New York at Buffalo. Accessed March 07, 2021.
http://pqdtopen.proquest.com/#viewpdf?dispub=3541321.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Zhang, Yidong. “Long Term CO2 Sequestration System Modeling.” 2012. Web. 07 Mar 2021.
Vancouver:
Zhang Y. Long Term CO2 Sequestration System Modeling. [Internet] [Thesis]. State University of New York at Buffalo; 2012. [cited 2021 Mar 07].
Available from: http://pqdtopen.proquest.com/#viewpdf?dispub=3541321.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Zhang Y. Long Term CO2 Sequestration System Modeling. [Thesis]. State University of New York at Buffalo; 2012. Available from: http://pqdtopen.proquest.com/#viewpdf?dispub=3541321
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Lehigh University
6.
Latifoglu, Cagri.
Models for production planning and power procurement portfolios.
Degree: 2012, Lehigh University
URL: http://pqdtopen.proquest.com/#viewpdf?dispub=3542669
► In this dissertation our objective is to characterize and measure the impact of various sources of uncertainty in the electricity market from the end-user…
(more)
▼ In this dissertation our objective is to characterize and measure the impact of various sources of uncertainty in the electricity market from the end-user perspective and develop optimization methodologies to mitigate the final impact. In Chapter 2, we study interruptible load contracts from the perspective of a participating manufacturing company. We develop a production planning frame- work that mitigates the uncertainty created by the contractual clauses. We present a mathematical modeling approach and computational results. In Chapter 3, we conduct an experiment using real time electricity prices from the two regional U.S. markets to test the for inherent patterns in real-time locational marginal prices (LMPs) that could be used for constructing the uncertainty sets for the optimization problems. We present the statistical results and findings to characterize these patterns. Next, another experiment is conducted to compare the information content of various data selection rules and the accuracy of various forecasting techniques. In Chapter 4, we conduct an experiment to quantify the value of information using two problem classes: the production planning problem and the job shop scheduling problem. We present various mathematical models to represent a limited set of protoypical optimization problems for each problem class, a comparison of various methods that can be used to construct these optimization problems, simulations of these models with real prices, and finally a numerical analysis of the impact of price uncertainty on optimal solutions. In this chapter, the value of information is quantified as the reflection of the price uncertainty on the optimal objective function value's deviation from a solution obtained by solving an optimization problem with imperfect information. Our findings indicate that depending on the production and the manufacturing environment, the impact of the price uncertainty on the optimal solutions varies significantly. Without conducting a similar analysis to ours, negotiating terms and prices purely based on price uncertainty may be speculative, illusory and misleading for the contract taking parties.
Subjects/Keywords: Operations Research
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Latifoglu, C. (2012). Models for production planning and power procurement portfolios. (Thesis). Lehigh University. Retrieved from http://pqdtopen.proquest.com/#viewpdf?dispub=3542669
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Latifoglu, Cagri. “Models for production planning and power procurement portfolios.” 2012. Thesis, Lehigh University. Accessed March 07, 2021.
http://pqdtopen.proquest.com/#viewpdf?dispub=3542669.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Latifoglu, Cagri. “Models for production planning and power procurement portfolios.” 2012. Web. 07 Mar 2021.
Vancouver:
Latifoglu C. Models for production planning and power procurement portfolios. [Internet] [Thesis]. Lehigh University; 2012. [cited 2021 Mar 07].
Available from: http://pqdtopen.proquest.com/#viewpdf?dispub=3542669.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Latifoglu C. Models for production planning and power procurement portfolios. [Thesis]. Lehigh University; 2012. Available from: http://pqdtopen.proquest.com/#viewpdf?dispub=3542669
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Illinois Institute of Technology
7.
Wilder, Coleen R.
The queuing theory of two-populations with lane switching.
Degree: 2010, Illinois Institute of Technology
URL: http://pqdtopen.proquest.com/#viewpdf?dispub=3417951
► The objective of this research is to produce a set of tables for practitioner use for a selected set of queuing configurations. The tables…
(more)
▼ The objective of this research is to produce a set of tables for practitioner use for a selected set of queuing configurations. The tables that distinguish this research from previous studies are the mixed queue configurations; other tables are included for comparison and reference. The mixed queue configurations belong to a class of problems known as Lane Switching models. The goal for switching lanes applied to this research is to equalize the workload between two servers. All tables are presented in a unique manner in order to facilitate their application; this presentation is defined by the algorithm used to populate the tables with various combinations of exogenous variables. The tables are used in two actual and one hypothetical application to demonstrate their value in a variety of situations. Each application focuses on a different performance metric to evaluate implementation options. Each case emphasizes the complexities involved in queuing problems, which are multivariable functions.
Subjects/Keywords: Operations Research
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Wilder, C. R. (2010). The queuing theory of two-populations with lane switching. (Thesis). Illinois Institute of Technology. Retrieved from http://pqdtopen.proquest.com/#viewpdf?dispub=3417951
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Wilder, Coleen R. “The queuing theory of two-populations with lane switching.” 2010. Thesis, Illinois Institute of Technology. Accessed March 07, 2021.
http://pqdtopen.proquest.com/#viewpdf?dispub=3417951.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Wilder, Coleen R. “The queuing theory of two-populations with lane switching.” 2010. Web. 07 Mar 2021.
Vancouver:
Wilder CR. The queuing theory of two-populations with lane switching. [Internet] [Thesis]. Illinois Institute of Technology; 2010. [cited 2021 Mar 07].
Available from: http://pqdtopen.proquest.com/#viewpdf?dispub=3417951.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Wilder CR. The queuing theory of two-populations with lane switching. [Thesis]. Illinois Institute of Technology; 2010. Available from: http://pqdtopen.proquest.com/#viewpdf?dispub=3417951
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
8.
Zhang, Ying.
Model elicitation in nation-building simulation| Analytic network process for ranking decisions and Petri Nets for robust optimization.
Degree: 2013, State University of New York at Buffalo
URL: http://pqdtopen.proquest.com/#viewpdf?dispub=3554522
► Simulation is the main tool to study nation-building problems because of their complexity. Considering the substantial work which is necessary to reconstruct a nation,…
(more)
▼ Simulation is the main tool to study nation-building problems because of their complexity. Considering the substantial work which is necessary to reconstruct a nation, there are many complex and interacting modules as well as a large number of parameters in nation-building simulation models. Thus, it is time-consuming and computationally expensive to study quantitative relationships within a nation-building system by simulation. Also, simulation cannot explicitly answer optimization-related questions which are important to nation-building decisions. For example, the optimal sequence of nation-building operations cannot be found by simulation unless all possible sequences are simulated, which is impossible in reality. Therefore, it is greatly beneficial to elicit analytic models and solutions from large-scale simulation for the nation-building interests that cannot be supported by simulation effectively and efficiently. This dissertation defines the framework of model elicitation in nation-building simulation, and it presents systematic methodologies to elicit the Analytic Network Process (ANP) and Robust Optimization (RO) models from large-scale simulation models. The first elicitation approach is developed to derive the ANP models from simulation models to study the entities with stochastic attributes and the input parameters in a nation-building system. Although the same purpose can be achieved by analyzing simulation results statistically, the ANP models are much more efficient to evaluate and rank model entities and input parameters by their significance without running a simulation model intensively. The numerical experiments show that the ANP models can provide good results which approximate to those by simulation with great time efficiency. The second elicitation approach is proposed to formulate RO models from the simulation models developed by Ptolemy II software. Since it is not easy to formulate RO models from a Ptolemy II model directly, Colored Stochastic Timed Petri Nets (CSTPNs) are used to facilitate this elicitation. More specifically, a Ptolemy II model is first converted to a CSTPN, and then RO models are formulated based on the graph and network representation of the CSTPN model. The whole process is illustrated by developing two types of RO models from a Ptolemy II model which simulates a nation-building system, and the elicitation approach is validated by comparing the solutions from the RO models with simulation results.
Subjects/Keywords: Operations Research
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Zhang, Y. (2013). Model elicitation in nation-building simulation| Analytic network process for ranking decisions and Petri Nets for robust optimization. (Thesis). State University of New York at Buffalo. Retrieved from http://pqdtopen.proquest.com/#viewpdf?dispub=3554522
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Zhang, Ying. “Model elicitation in nation-building simulation| Analytic network process for ranking decisions and Petri Nets for robust optimization.” 2013. Thesis, State University of New York at Buffalo. Accessed March 07, 2021.
http://pqdtopen.proquest.com/#viewpdf?dispub=3554522.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Zhang, Ying. “Model elicitation in nation-building simulation| Analytic network process for ranking decisions and Petri Nets for robust optimization.” 2013. Web. 07 Mar 2021.
Vancouver:
Zhang Y. Model elicitation in nation-building simulation| Analytic network process for ranking decisions and Petri Nets for robust optimization. [Internet] [Thesis]. State University of New York at Buffalo; 2013. [cited 2021 Mar 07].
Available from: http://pqdtopen.proquest.com/#viewpdf?dispub=3554522.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Zhang Y. Model elicitation in nation-building simulation| Analytic network process for ranking decisions and Petri Nets for robust optimization. [Thesis]. State University of New York at Buffalo; 2013. Available from: http://pqdtopen.proquest.com/#viewpdf?dispub=3554522
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
9.
Madhavan, Anusha.
Models and algorithms for integer multi-commodity network routing applications.
Degree: 2010, Southern Methodist University
URL: http://pqdtopen.proquest.com/#viewpdf?dispub=3387997
► This dissertation presents two applications of multi-commodity network routing problems, one in the area of telecommunication network operation and the other in the area…
(more)
▼ This dissertation presents two applications of multi-commodity network routing problems, one in the area of telecommunication network operation and the other in the area of cash management for the banking industry. For the telecommunication problem, the multiple commodities arise from the multiple origin-destination demand pairs that must share the capacity of a fiber optical link. For the cash management problem, the commodities are associated with the various denominations (ones, fives, tens, twenties, fifties, hundreds, and various coins) that share the capacity of armed trucks and storage vaults. Dijkstra’s simple shortest path algorithm provided the building block for link-state routing protocols in data networks. The open shortest path first (OSPF) protocol uses this algorithm in a distributed procedure in an attempt to balance the trade-off between routing implementation complexity and optimal network utilization. Today, powerful optimization software tools are available that can be used by a central processor in an attempt to improve network performance via implementation of better routing strategies. Two environments can be considered. In the first case, the routing software remains unchanged and the central processor simply determines optimal link weights that are supplied to the routers. Each router uses the link weights and Dijkstra’s algorithm to determine its routing table. In the second environment, the routing software is modified to accept an optimal routing table. Chapter 2 of this dissertation presents both node-arc and arc-path optimization models for both environments, along with an empirical analysis of all four models. The Federal Reserve Bank (Fed) provides currency services to banks. These services include sorting currency into fit and non-fit bills and repackaging bills for redistribution. To reduce their own cost of currency management operations, many banks would make Fed deposits and withdrawals of the same denominations during a given week. In July of 2007, the Fed introduced cross-shipping fees (i.e. fees for making both deposits and withdrawals during a given Monday through Friday period) to encourage banks to recycle their currency. Recognizing the market opportunity, Fiserv initiated a project to optimize bank vault inventories across time and space for a major “Top 5” bank who previously suffered from over 7 billion dollars setting idle either in trucks, vaults, branches, or ATMs. Rarely in academic research does one enjoy an opportunity to actually implement and therefore test one’s work within the applied “dirty” world of business applications. The business results were most impressive. The integer programming model as well as an empirical investigation to reduce the computational time is presented in Chapter 3. The model has been successfully applied to the vault operations of large banks. The underlying configuration is a time-space multi-commodity network with a fixed-charge cost structure.
Subjects/Keywords: Operations Research
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Madhavan, A. (2010). Models and algorithms for integer multi-commodity network routing applications. (Thesis). Southern Methodist University. Retrieved from http://pqdtopen.proquest.com/#viewpdf?dispub=3387997
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Madhavan, Anusha. “Models and algorithms for integer multi-commodity network routing applications.” 2010. Thesis, Southern Methodist University. Accessed March 07, 2021.
http://pqdtopen.proquest.com/#viewpdf?dispub=3387997.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Madhavan, Anusha. “Models and algorithms for integer multi-commodity network routing applications.” 2010. Web. 07 Mar 2021.
Vancouver:
Madhavan A. Models and algorithms for integer multi-commodity network routing applications. [Internet] [Thesis]. Southern Methodist University; 2010. [cited 2021 Mar 07].
Available from: http://pqdtopen.proquest.com/#viewpdf?dispub=3387997.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Madhavan A. Models and algorithms for integer multi-commodity network routing applications. [Thesis]. Southern Methodist University; 2010. Available from: http://pqdtopen.proquest.com/#viewpdf?dispub=3387997
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of California – Berkeley
10.
Yu, Lian.
Nonparametric Optimization with Objective Operational Statistics.
Degree: Industrial Engineering & Operations Research, 2010, University of California – Berkeley
URL: http://www.escholarship.org/uc/item/18z443nf
► In the first part of this thesis, we study the non-parametricmethods for estimation and optimization. In particular, a newnon-parametric method, objective operational statistics, is proposedto…
(more)
▼ In the first part of this thesis, we study the non-parametricmethods for estimation and optimization. In particular, a newnon-parametric method, objective operational statistics, is proposedto inventory control problems, where the only information availableis the sample data and we do not assume any relationship betweendemands and order quantities. A kernel algorithm based on objectiveoperational statistics is constructed to approximate the objectivefunction directly from sample data. Moreover, we give conditionsunder which the operational statistics approximation functionconverges to the true objective. Numerical results of the algorithmwith applications to newsvendor problem show that the objectiveoperational statistics approach works well for small amount of dataand outperforms the previous parametric and non-parametric methods.In the second part of this thesis, we present a robust hedgingproblem under model uncertainty and the bounds of the optimalobjective value are derived by duality analysis.
Subjects/Keywords: Operations research
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Yu, L. (2010). Nonparametric Optimization with Objective Operational Statistics. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/18z443nf
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Yu, Lian. “Nonparametric Optimization with Objective Operational Statistics.” 2010. Thesis, University of California – Berkeley. Accessed March 07, 2021.
http://www.escholarship.org/uc/item/18z443nf.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Yu, Lian. “Nonparametric Optimization with Objective Operational Statistics.” 2010. Web. 07 Mar 2021.
Vancouver:
Yu L. Nonparametric Optimization with Objective Operational Statistics. [Internet] [Thesis]. University of California – Berkeley; 2010. [cited 2021 Mar 07].
Available from: http://www.escholarship.org/uc/item/18z443nf.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Yu L. Nonparametric Optimization with Objective Operational Statistics. [Thesis]. University of California – Berkeley; 2010. Available from: http://www.escholarship.org/uc/item/18z443nf
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of California – Berkeley
11.
He, Long.
Data-driven Approaches to Flexible Systems Design.
Degree: Industrial Engineering & Operations Research, 2015, University of California – Berkeley
URL: http://www.escholarship.org/uc/item/55j7q66j
► This dissertation studies the data-driven approaches to flexible systems design problems under uncertainty. We discuss real applications in various contexts with flexibility: the capability to…
(more)
▼ This dissertation studies the data-driven approaches to flexible systems design problems under uncertainty. We discuss real applications in various contexts with flexibility: the capability to satisfy different types of customer demands (e.g. one-way and round trips in the context of car sharing systems); the geographical demand distribution estimation and associated inventory allocation; and the freedom in production plans to fulfill uncertain customer demands (e.g. flexible recipes in continuous production process).The problems we consider have different objectives and more importantly several degrees of richness in data availability. We develop data-driven optimization models accordingly. Specifically, in the case of new market expansion for example, the firm has to make one-shot decision with limited or side information. The focus of data-driven approach in this case is on the portability of information. Distributionally-robust optimization methodologies are applied to derive strategic decisions that hedge the risks. At the tactical level, e.g. resource planning, the firm deploys planning with ample historical data. For online retailers, geographical demand distributions need to be estimated from historical sales and serve as key input to their regular inventory allocation decisions. Furthermore, operational decisions generally require more detailed data, especially the continuous data for real-time decisions. We study the problem where routine production plans are chosen together with raw material investment decisions when periodic demand data may be available.In the first part of the dissertation, we study the planning problem faced by urban electric vehicle (EV) sharing systems, that offer both one-way and round trips, in designing the geographical service region. This decision encompasses the trade-off between maximizing customer adoption by covering travel needs, and controlling fleet operations costs. We develop a mathematical programming model that incorporates details of both customer adoption behavior and fleet management (including EV repositioning and charging) operations under spatially-imbalanced and time-varying travel patterns. To address uncertainty in customer adoption, we employ a distributionally-robust optimization framework that informs robust decisions to avoid possible ambiguity (or lack) of data. Mathematically, the problem is approximated by a mixed integer second-order cone program (MISOCP), which is computationally-tractable. Applying this approach to the case of Car2Go's service in San Diego, California, with real operations data, we investigate several planning questions and suggest potential for future development of the service.To make better inventory allocation to distribution centers, understanding of the geographical demand distribution is essential to online retailers who possess historical sales data that might be contaminated and/or with missing data. The second part of the dissertation presents two models: the first model estimates the geographical demand distribution; the…
Subjects/Keywords: Operations research
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
He, L. (2015). Data-driven Approaches to Flexible Systems Design. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/55j7q66j
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
He, Long. “Data-driven Approaches to Flexible Systems Design.” 2015. Thesis, University of California – Berkeley. Accessed March 07, 2021.
http://www.escholarship.org/uc/item/55j7q66j.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
He, Long. “Data-driven Approaches to Flexible Systems Design.” 2015. Web. 07 Mar 2021.
Vancouver:
He L. Data-driven Approaches to Flexible Systems Design. [Internet] [Thesis]. University of California – Berkeley; 2015. [cited 2021 Mar 07].
Available from: http://www.escholarship.org/uc/item/55j7q66j.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
He L. Data-driven Approaches to Flexible Systems Design. [Thesis]. University of California – Berkeley; 2015. Available from: http://www.escholarship.org/uc/item/55j7q66j
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of California – Berkeley
12.
Liao, Chen-Nan.
Game Theory Applications in Socially Responsible Operations and Operations-Marketing Interface.
Degree: Industrial Engineering & Operations Research, 2015, University of California – Berkeley
URL: http://www.escholarship.org/uc/item/8qm007mz
► This dissertation includes three chapters: (1) Farmers' Information Management in Developing Countries - A Highly Asymmetric Information Structure. (2) Information Provision Policies for Improving Farmer…
(more)
▼ This dissertation includes three chapters: (1) Farmers' Information Management in Developing Countries - A Highly Asymmetric Information Structure. (2) Information Provision Policies for Improving Farmer Welfare in Developing Countries: Heterogeneous Farmers and Market Selection. (3) Role of Exchangeable Tickets in the Optimal Menu Design for Airline Tickets. The first chapter studies farmers' information management and utilization problems in developing countries. In these countries, governments, non-governmental organizations, and social entrepreneurs are disseminating agriculture information to farmers to improve their welfare. However, instead of having direct access to the information, farmers usually acquire information from local social networks, and, thus, they may have very different information channels. In this paper, we establish a general framework that accommodates highly asymmetric information structures to capture the fact that information is transmitted indirectly through the social network. In our model, a bipartite graph describes which subset of signals is accessible to a farmer. We characterize a unique Bayesian Nash equilibrium and express farmers' strategies and expected profits in closed forms. We discuss properties of this equilibrium and show that asymmetric information structures can lead to various novel results. We also conduct comprehensive studies on the equilibrium in the "weak signal limit", where signals are subject to substantial noise. We examine the government's optimal information allocation in this limit when its goal is to maximize (1) farmers' total profits or (2) the social welfare. In the second chapter, we examine the impact of information provision policies on farmer welfare in developing countries where farmers lack relevant and timely information for making informed decisions regarding which crop to grow and which market to sell in. In addition to heterogeneous farmers, we consider the case when farmers are price takers and yet the price of each crop (or the price in each market) is a linearly decreasing function of the total sales quantity. When market information is offered free-of-charge, we show that: (a) providing information is always beneficial to farmers at the individual level; and (b) providing information to all farmers may not be welfare maximizing at the aggregate level. To maximize farmer welfare, it is optimal to provide information to a targeted group of farmers who are located far away from either market. However, to overcome perceived unfairness among farmers, we show that the government should provide information to all farmers at a nominal fee so that the farmers will adopt the intended optimal provision policy willingly. We extend our analysis to examine different issues including: precision of market information, and information dissemination via a for-profit company.The third chapter examines the optimal menu design problem with three types of tickets: refundable, nonrefundable, and exchangeable tickets. We identify the role of exchangeable tickets…
Subjects/Keywords: Operations research
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Liao, C. (2015). Game Theory Applications in Socially Responsible Operations and Operations-Marketing Interface. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/8qm007mz
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Liao, Chen-Nan. “Game Theory Applications in Socially Responsible Operations and Operations-Marketing Interface.” 2015. Thesis, University of California – Berkeley. Accessed March 07, 2021.
http://www.escholarship.org/uc/item/8qm007mz.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Liao, Chen-Nan. “Game Theory Applications in Socially Responsible Operations and Operations-Marketing Interface.” 2015. Web. 07 Mar 2021.
Vancouver:
Liao C. Game Theory Applications in Socially Responsible Operations and Operations-Marketing Interface. [Internet] [Thesis]. University of California – Berkeley; 2015. [cited 2021 Mar 07].
Available from: http://www.escholarship.org/uc/item/8qm007mz.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Liao C. Game Theory Applications in Socially Responsible Operations and Operations-Marketing Interface. [Thesis]. University of California – Berkeley; 2015. Available from: http://www.escholarship.org/uc/item/8qm007mz
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
13.
Ding, Shiman.
Centralized and Decentralized Warehouse Logistics Collaboration.
Degree: Industrial Engineering & Operations Research, 2017, University of California – Berkeley
URL: http://www.escholarship.org/uc/item/9gz4f4gj
► In an emerging trend in the grocery industry, multiple suppliers and retailers share a warehouse to facilitate horizontal collaboration, in order to lower transportation costs…
(more)
▼ In an emerging trend in the grocery industry, multiple suppliers and retailers share a warehouse to facilitate horizontal collaboration, in order to lower transportation costs and increase outbound delivery frequencies. Typically, these systems (sometimes known as Mixing and Consolidation Centers) are operated in a decentralized manner, with little effort to coordinate shipments from multiple suppliers with shipments to multiple retailers. Indeed, implementing coordination in this setting, where potential competitors are using the same logistics resources, could be very challenging. In this thesis, we characterizes the loss due to this decentralized operation, in order to develop insight into the value of making the extra effort and investment necessary to imple- ment some form of coordinated control. To do this, we consider a setting where several suppliers ship to several retailers through a shared warehouse, so that outbound trucks from the warehouse contain the products of multiple suppliers. We extend the classic one warehouse multi-retailer analysis of Roundy (1985) to incorporate multiple suppli- ers and per truck outbound transportation cost from the warehouse, and develop a cost lower bound on centralized operation as benchmark. We then analyze decentralized versions of the system, in which each retailer and each supplier maximizes his or her own utility in a variety of settings, and we analytically bound the ratio of the cost of decentralized to centralized operation, to bound the loss due to decentralization. We find that easy-to-implement decentralized policies are efficient and effective in this set- ting, suggesting that centralization (and thus, coordination effort intended to lead to some of the benefit of centralization) does not bring significant benefits. In a compu- tational study, we explore how system parameters impact the relative performance of this system under centralized and decentralized control. Finally, we consider a stochas- tic version of this model of decentralized collaboration, where we assume independent Poisson demand occurs at each retailer for all products. To coordinate replenishment, each retailer follows an aggregate (Q,S) policy, i.e., an order is placed to raise inventory position to S whenever total demand since the last order at that retailer reaches Q.In this setting demand at the warehouse can be well-approximated by a compound Poisson process, and thus inventory at the warehouse is managed via an (s,S) policy. We develop optimal and heuristic algorithms to optimize parameter settings in this model.
Subjects/Keywords: Operations research
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Ding, S. (2017). Centralized and Decentralized Warehouse Logistics Collaboration. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/9gz4f4gj
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Ding, Shiman. “Centralized and Decentralized Warehouse Logistics Collaboration.” 2017. Thesis, University of California – Berkeley. Accessed March 07, 2021.
http://www.escholarship.org/uc/item/9gz4f4gj.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Ding, Shiman. “Centralized and Decentralized Warehouse Logistics Collaboration.” 2017. Web. 07 Mar 2021.
Vancouver:
Ding S. Centralized and Decentralized Warehouse Logistics Collaboration. [Internet] [Thesis]. University of California – Berkeley; 2017. [cited 2021 Mar 07].
Available from: http://www.escholarship.org/uc/item/9gz4f4gj.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Ding S. Centralized and Decentralized Warehouse Logistics Collaboration. [Thesis]. University of California – Berkeley; 2017. Available from: http://www.escholarship.org/uc/item/9gz4f4gj
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Cornell University
14.
Hosseini Alamdari, Soroush.
Exact and Approximate Algorithms for Some Combinatorial Problems.
Degree: PhD, Computer Science, 2018, Cornell University
URL: http://hdl.handle.net/1813/59333
► Three combinatorial problems are studied and efficient algorithms are presented for each of them. The first problem is concerned with lot-sizing, the second one arises…
(more)
▼ Three combinatorial problems are studied and efficient algorithms are presented for each of them. The first problem is concerned with lot-sizing, the second one arises in exam-scheduling, and the third lies on the intersection of the k-median and k-center clustering problems.
Advisors/Committee Members: Shmoys, David B. (chair), Kleinberg, Jon M. (committee member), Gomes, Carla P. (committee member).
Subjects/Keywords: Operations research
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Hosseini Alamdari, S. (2018). Exact and Approximate Algorithms for Some Combinatorial Problems. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/59333
Chicago Manual of Style (16th Edition):
Hosseini Alamdari, Soroush. “Exact and Approximate Algorithms for Some Combinatorial Problems.” 2018. Doctoral Dissertation, Cornell University. Accessed March 07, 2021.
http://hdl.handle.net/1813/59333.
MLA Handbook (7th Edition):
Hosseini Alamdari, Soroush. “Exact and Approximate Algorithms for Some Combinatorial Problems.” 2018. Web. 07 Mar 2021.
Vancouver:
Hosseini Alamdari S. Exact and Approximate Algorithms for Some Combinatorial Problems. [Internet] [Doctoral dissertation]. Cornell University; 2018. [cited 2021 Mar 07].
Available from: http://hdl.handle.net/1813/59333.
Council of Science Editors:
Hosseini Alamdari S. Exact and Approximate Algorithms for Some Combinatorial Problems. [Doctoral Dissertation]. Cornell University; 2018. Available from: http://hdl.handle.net/1813/59333
Cornell University
15.
Kim, Dayoung.
Consumer-Driven Operations: Empirical and Experimental Studies in Demand Models.
Degree: PhD, Management, 2017, Cornell University
URL: http://hdl.handle.net/1813/56885
► The new selling techniques enabled by information technologies in today's marketplaces, such as online sales channels, search portals, and review platforms, changed the consumer-driven demand…
(more)
▼ The new selling techniques enabled by information technologies in today's marketplaces, such as online sales channels, search portals, and review platforms, changed the consumer-driven demand in many ways. Unlike traditional retail competition, mostly driven by product attributes (e.g., quality, price, etc.), these selling techniques based on information technologies have become more important to consider customer behavior and its resulting effect in shaping demand, in order for firms to better plan their operational strategies. In this dissertation, we investigate different sources of demand uncertainty and obtain insights into
operations of the firms competing in the current marketplace. We develop methods for more accurate estimations of demand in the presence of downstream customers' choice behavior or social interactions. We adopt the Markov Chain based model to understand customer demand and validate the model using human-
subject experiment and field data. We also conduct empirical
research to capture online browsing behavior of consumers and provide implications to operational managers.
This dissertation consists of three chapters.
- Chapter 1: The Effect of Social Information on Demand in Quality Competition. This is joint work with Professor Vishal Gaur and Professor Andrew Davis
- Chapters 2: Predicting Order Variability in Inventory Decisions: A Model of Forecast Anchoring. This is joint work with Professor Andrew Davis and Professor Li Chen
- Chapter 3: Predicting Purchase Propensity from Online Browsing Behavior. This is joint work with Professor Vishal Gaur
The three chapters are self-contained but are related to one another: Chapter 1 investigates the impact of social information on demand uncertainty using experimental work, Chapter 2 explores the sources of amplified demand uncertainty from the downstream buyers' inventory decisions, and Chapter 3 empirically explores the effect of online browsing behavior on demand prediction and is a work-in-progress. All these chapters commonly focus on the behavioral sources of demand endogeneity. Therefore, this dissertation aims to contribute to improve the accuracy of demand estimation by incorporating those behavioral factors into the models in
Operations.
Advisors/Committee Members: Gaur, Vishal (chair), Davis, Andrew M. (committee member), Gavirneni, Srinagesh (committee member).
Subjects/Keywords: Operations research
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Kim, D. (2017). Consumer-Driven Operations: Empirical and Experimental Studies in Demand Models. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/56885
Chicago Manual of Style (16th Edition):
Kim, Dayoung. “Consumer-Driven Operations: Empirical and Experimental Studies in Demand Models.” 2017. Doctoral Dissertation, Cornell University. Accessed March 07, 2021.
http://hdl.handle.net/1813/56885.
MLA Handbook (7th Edition):
Kim, Dayoung. “Consumer-Driven Operations: Empirical and Experimental Studies in Demand Models.” 2017. Web. 07 Mar 2021.
Vancouver:
Kim D. Consumer-Driven Operations: Empirical and Experimental Studies in Demand Models. [Internet] [Doctoral dissertation]. Cornell University; 2017. [cited 2021 Mar 07].
Available from: http://hdl.handle.net/1813/56885.
Council of Science Editors:
Kim D. Consumer-Driven Operations: Empirical and Experimental Studies in Demand Models. [Doctoral Dissertation]. Cornell University; 2017. Available from: http://hdl.handle.net/1813/56885
Princeton University
16.
Sepin, Tardu Selim.
Studies on optimal trade execution.
Degree: 2015, Princeton University
URL: http://pqdtopen.proquest.com/#viewpdf?dispub=3682773
► This dissertation deals with the question of how to optimally execute orders for financial assets that are subject to transaction costs. We study the…
(more)
▼ This dissertation deals with the question of how to optimally execute orders for financial assets that are subject to transaction costs. We study the problem in a discrete–time model where the asset price processes of interest are subject to stochastic volatility and liquidity. First, we consider the case for the execution of a single asset. We find predictable strategies that minimize the expectation, mean–variance and expected exponential of the implementation cost. Second, we extend the single asset case to incorporate a dark pool where the orders can be crossed at the mid-price depending on the liquidity available. The orders submitted to the dark pool face execution uncertainty and are assumed to be subject to adverse selection risk. We find strategies that minimize the expectation and the expected exponential of the implementation shortfall and show that one can incur less costs by also making use of the dark pool. Next chapter studies a multi asset setting in the presence of a dark pool. We find strategies that minimize the expectation and expected exponential of a cost functional that consists of the implementation shortfall and an aversion term that penalizes the orders crossed in the dark pool. In the expected exponential of the cost case, the dimensionality of the problem does not allow for the numerical computation of optimal strategies. Therefore, we first solve the expected exponential case for a second order Taylor approximation and then provide a framework via a duality argument which can be used to generate approximate strategies. Lastly, we treat the case where the single asset execution problem exhibits ambiguity for the distribution of stochastic liquidity and volatility. We see the implementation cost as the sum of risk terms arising at each execution period. We consider the problem obtained from aggregating worst case expectations of these risk terms, by penalizing the distributions used with dynamic indicator, relative entropy and Gini indices. Next, we formulate the problem as the multi–prior first order certainty equivalent of the exponential cost and lastly we consider a second order certainty equivalence formulation.
Subjects/Keywords: Operations Research
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Sepin, T. S. (2015). Studies on optimal trade execution. (Thesis). Princeton University. Retrieved from http://pqdtopen.proquest.com/#viewpdf?dispub=3682773
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Sepin, Tardu Selim. “Studies on optimal trade execution.” 2015. Thesis, Princeton University. Accessed March 07, 2021.
http://pqdtopen.proquest.com/#viewpdf?dispub=3682773.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Sepin, Tardu Selim. “Studies on optimal trade execution.” 2015. Web. 07 Mar 2021.
Vancouver:
Sepin TS. Studies on optimal trade execution. [Internet] [Thesis]. Princeton University; 2015. [cited 2021 Mar 07].
Available from: http://pqdtopen.proquest.com/#viewpdf?dispub=3682773.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Sepin TS. Studies on optimal trade execution. [Thesis]. Princeton University; 2015. Available from: http://pqdtopen.proquest.com/#viewpdf?dispub=3682773
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Stellenbosch University
17.
Smuts, Francois.
Estimating the effectiveness of a mobile phone network's deferred revenue calculated through the use of a business automation and support system.
Degree: Logistics, 2011, Stellenbosch University
URL: http://hdl.handle.net/10019.1/6726
► Thesis (MComm (Logistics)) – University of Stellenbosch, 2011.
ENGLISH ABSTRACT: Mobile phone networks form an integral part of economic and social development globally. Mobile phones have…
(more)
▼ Thesis (MComm (Logistics)) – University of Stellenbosch, 2011.
ENGLISH ABSTRACT: Mobile phone networks form an integral part of economic and social development globally. Mobile phones have become an everyday part of life and it is hard to imagine a competitive economy without the availability of mobile communications. Emerging markets benefit most from the implementation of mobile technology and growth trends are outperforming earlier predictions. The most popular and sustainable payment model used by mobile phone networks in emerging markets is the pre paid mechanism used for the distribution of airtime. This mechanism brings about unique challenges for networks in emerging markets. In this thesis the importance of the mobile phone network pre paid value channel is introduced through an analysis of pre paid revenue. A brief introduction is given to the systems and products that contribute to the functioning of the pre paid value channel. The revenue generation process is described with regards to the pre paid sector of the market and an in-depth explanation of the importance of deferred revenue is given, how it is recorded and what role it fulfils in the generation of revenue. The complexity of the network environment, both technical and operational makes the use of a business automation and support system (BSS) a necessary tool for effective execution of tasks and processes within the network environment. These systems record information from a wide spectrum of available technical network resources and use this information to automate the flow of network products. The use of such a system for the calculation of deferred revenue is suggested. Saaty‟s Analytical Hierarchy Process (AHP) algorithm and the Elimination and Choice Expressing Reality (ELECTRE) method are used to compare the newly proposed method for the calculation of deferred revenue using a BSS.
Using Saaty's algorithm to estimate the effectiveness of deferred revenue as reported through the use of a BSS yields favourable results for the proposed method. This helps to bridge the gap in the poorly researched mobile telecommunications industry. ELECTRE is used to substantiate the findings of the model using AHP and meaningful tests are done to motivate correctness and accuracy of the results obtained throughout. Most importantly, the findings
were shared with academic and industry experts, adding meaningful resemblance to the goals set out to achieve.
AFRIKAANSE OPSOMMING: Mobiele foon netwerke is wêreldwyd 'n onlosmaakbare deel van ekonomiese en sosiale ontwikkeling. Mobiele fone is deel van ons alledaagse lewe en dit is moeilik om 'n kompeterende ekonomie te bedink sonder die beskikbaarheid van mobiele kommunikasie. Ontluikende markte trek die meeste voordeel uit die implementering van mobiele tegnologie en groeitendense vertoon beter as wat vroeër voorspel is. Die mees gewilde en volhoubare betaalmetode wat deur mobiele foon netwerke in ontluikende markte gebruik word, is die voorafbetalingsmeganisme wat vir die verspreiding van lugtyd gebruik…
Advisors/Committee Members: Visagie, S. E., Nieuwoudt, I., University of Stellenbosch. Faculty of Economic and Management Sciences. Dept. of Logistics..
Subjects/Keywords: Operations research
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Smuts, F. (2011). Estimating the effectiveness of a mobile phone network's deferred revenue calculated through the use of a business automation and support system. (Thesis). Stellenbosch University. Retrieved from http://hdl.handle.net/10019.1/6726
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Smuts, Francois. “Estimating the effectiveness of a mobile phone network's deferred revenue calculated through the use of a business automation and support system.” 2011. Thesis, Stellenbosch University. Accessed March 07, 2021.
http://hdl.handle.net/10019.1/6726.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Smuts, Francois. “Estimating the effectiveness of a mobile phone network's deferred revenue calculated through the use of a business automation and support system.” 2011. Web. 07 Mar 2021.
Vancouver:
Smuts F. Estimating the effectiveness of a mobile phone network's deferred revenue calculated through the use of a business automation and support system. [Internet] [Thesis]. Stellenbosch University; 2011. [cited 2021 Mar 07].
Available from: http://hdl.handle.net/10019.1/6726.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Smuts F. Estimating the effectiveness of a mobile phone network's deferred revenue calculated through the use of a business automation and support system. [Thesis]. Stellenbosch University; 2011. Available from: http://hdl.handle.net/10019.1/6726
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Stellenbosch University
18.
Raad, Darian Nicholas.
Multi-objective optimisation of water distribution systems design using metaheuristics.
Degree: Logistics, 2011, Stellenbosch University
URL: http://hdl.handle.net/10019.1/6617
► Thesis (PhD (Logistics)) – University of Stellenbosch, 2011.
ENGLISH ABSTRACT: The design of a water distribution system (WDS) involves finding an acceptable trade-off between cost minimisation…
(more)
▼ Thesis (PhD (Logistics)) – University of Stellenbosch, 2011.
ENGLISH ABSTRACT: The design of a water distribution system (WDS) involves finding an acceptable trade-off between cost minimisation and the maximisation of numerous system benefits, such as hydraulic
reliability and surplus capacity. The primary design problem involves cost-effective specifica-
tion of a pipe network layout and pipe sizes (which are typically available in a discrete set
of commercial diameters) in order to satisfy expected consumer water demands within required
pressure limits. The problem may be extended to consider the design of additional WDS com-
ponents, such as reservoirs, tanks, pumps and valves. Practical designs must also cater for the
uncertainty of demand, the requirement of surplus capacity for future growth, and the hydraulic
reliability of the system under different demand and potential failure conditions.
A detailed literature review of exact and approximate approaches towards single-objective (minimum cost) WDS design optimisation is provided. Essential topics which have to be included in
any modern WDS design paradigm (such as demand estimation, reliability quantification, tank
design and pipe layout) are discussed. A number of formative concepts in multi-objective evo-
lutionary optimisation are also reviewed (including a generic problem formulation, performance
evaluation measures, comparative testing strategies, and suitable classes of metaheuristics).
The two central themes of this dissertation are conducting multi-objective WDS design optimi-
sation using metaheuristics, and a critical examination of surrogate measures used to quantify
WDS reliability. The aim in the first theme is to compare numerous modern metaheuristics, in-
cluding several multi-objective evolutionary algorithms, an estimation of distribution algorithm
and a recent hyperheuristic named AMALGAM (an evolutionary framework for the simulta-
neous incorporation of multiple metaheuristics applied here for the first time to a real-world
problem), in order to determine which approach is most capable with respect to WDS design
optimisation. Several novel metaheuristics are developed, as well as a number of new variants
of existing algorithms, so that a total of twenty-three algorithms were compared.
Testing with respect to eight small-to-large-sized WDS benchmarks from the literature reveals
that the four top-performing algorithms are mutually non-dominated with respect to the vari-
ous performance metrics. These algorithms are NSGA-II, TAMALGAMJndu, TAMALGAMndu
and AMALGAMSndp (the last three being novel variants of AMALGAM). However, when these
four algorithms are applied to the design of a very large real-world benchmark, the AMALGAM
paradigm outperforms NSGA-II convincingly, with AMALGAMSndp exhibiting the best perfor-
mance overall. As part of this study, a novel multi-objective greedy algorithm is developed by
combining several heuristic design methods from the literature in order to mimic the design
strategy of a…
Advisors/Committee Members: Van Vuuren, Jan H., Sinske, Alexander, University of Stellenbosch. Faculty of Economic and Management Sciences. Dept. of Logistics..
Subjects/Keywords: Operations research
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Raad, D. N. (2011). Multi-objective optimisation of water distribution systems design using metaheuristics. (Thesis). Stellenbosch University. Retrieved from http://hdl.handle.net/10019.1/6617
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Raad, Darian Nicholas. “Multi-objective optimisation of water distribution systems design using metaheuristics.” 2011. Thesis, Stellenbosch University. Accessed March 07, 2021.
http://hdl.handle.net/10019.1/6617.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Raad, Darian Nicholas. “Multi-objective optimisation of water distribution systems design using metaheuristics.” 2011. Web. 07 Mar 2021.
Vancouver:
Raad DN. Multi-objective optimisation of water distribution systems design using metaheuristics. [Internet] [Thesis]. Stellenbosch University; 2011. [cited 2021 Mar 07].
Available from: http://hdl.handle.net/10019.1/6617.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Raad DN. Multi-objective optimisation of water distribution systems design using metaheuristics. [Thesis]. Stellenbosch University; 2011. Available from: http://hdl.handle.net/10019.1/6617
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of California – Berkeley
19.
YI, PENG.
Some Generalizations of The Linear Complementarity Problem.
Degree: Industrial Engineering & Operations Research, 2016, University of California – Berkeley
URL: http://www.escholarship.org/uc/item/1tz7524z
► In this thesis, we study two generalizations of the classical linear complementarity problem (LCP) - the weighted extended linear complementarity problem (wXLCP) and the complementarity…
(more)
▼ In this thesis, we study two generalizations of the classical linear complementarity problem (LCP) - the weighted extended linear complementarity problem (wXLCP) and the complementarity problem (CP) over a general closed cone. Our goal is twofold: extend some fundamental results of the LCP to a more general setting and identify a class of nonmonotone problems which could be solved numerically. The thesis is organized as follows:In Chapter 1, we formulate problems relevant to our study and introduce background material that will be needed in the rest of the thesis.In Chapter 2, we formulate the weighted extended linear complementarity problem (XLCP), which naturally generalizes the LCP, the horizontal linear complementarity problem (HLCP) and the extended linear complementarity problem (XLCP). Motivated by important roles played by matrix theoretic properties in the LCP theory, we study the monotonicity, sufficiency, P-property and R0-property in the setting of the XLCP. Together with two optimization reformulations of the problem, we establish several fundamental results. Specifically, we show that the characterizing conditions of the row and column sufficiency properties in can be similarly described in the context of the wXLCP. Under the monotonicity property, the wXLCP is equivalent to a convex optimization problem and it is solvable whenever it is strictly feasible. Also, we show that the row sufficiency property ensures that every stationary point of some unconstrained optimization problem is a solution of the wXLCP. In Chapter 3, we confine our discussions on the notion of \emph{uniform non-singularity property} for transformations defined over an Euclidean space \Euclidsp. The motivation is to identify a more general class of nonmonotone symmetric cone complementarity problems (SCCPs) which are numerically solvable. When \Euclidsp = \realsn, the uniform non-singularity property lies strictly between the notion of P-function and uniform P-function; and it yields a new characterization of the P-matrix when the function is linear. Under suitable assumptions, the uniform non-singularity property recovers the strong monotonicity and a weaker version of the Cartesian P-property. We also make connections to other existing P-type properties, and show that they are all equivalent for two special cases.\item In Chapter 3, we propose the general notion of uniform nonsingularity property for transformations over Euclidean spaces. We show that this property is closely related to a number of existing properties in the literature. In particular, the variants of the uniform non-singularity property recover P-property of a matrix, the strong monotonicity of a nonlinear transformation, and a weaker version of the Cartesian P-property and the P-type property in . Also, we show that a form of this property implies the Lipschitzian GUS-property.In Chapter 4, we present the applications of the uniform non-singularity property to the solution property of…
Subjects/Keywords: Operations research
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
YI, P. (2016). Some Generalizations of The Linear Complementarity Problem. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/1tz7524z
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
YI, PENG. “Some Generalizations of The Linear Complementarity Problem.” 2016. Thesis, University of California – Berkeley. Accessed March 07, 2021.
http://www.escholarship.org/uc/item/1tz7524z.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
YI, PENG. “Some Generalizations of The Linear Complementarity Problem.” 2016. Web. 07 Mar 2021.
Vancouver:
YI P. Some Generalizations of The Linear Complementarity Problem. [Internet] [Thesis]. University of California – Berkeley; 2016. [cited 2021 Mar 07].
Available from: http://www.escholarship.org/uc/item/1tz7524z.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
YI P. Some Generalizations of The Linear Complementarity Problem. [Thesis]. University of California – Berkeley; 2016. Available from: http://www.escholarship.org/uc/item/1tz7524z
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
California State Polytechnic University – Pomona
20.
Cortes, Miguel.
Optimization of Hurricane Relief Distribution.
Degree: M.S.E.M., Department of Industrial and Manufacturing Engineering, 2020, California State Polytechnic University – Pomona
URL: http://hdl.handle.net/10211.3/216766
► The purpose of this paper is to discuss the findings that relate some of the concepts of the Master of Science in Engineering Management (MSEM)…
(more)
▼ The purpose of this paper is to discuss the findings that relate some of the concepts of the Master of Science in Engineering Management (MSEM) program to particular hurricane events that have occurred in order to analyze and reduce several factors and to properly allocate resources. It will serve as the termination master project report that goes in conjunction with the project presentation. Specifically, this report will delve on the following, four hurricane events will be described, MSEM concepts will be applied to a proposed project objective, and an analysis will be made to determine the impact resulting from drastic events followed by a recommendation to minimize hurricane disaster.
Advisors/Committee Members: Placencia, Greg (advisor), Parsa, Payam (committee member).
Subjects/Keywords: operations research
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Cortes, M. (2020). Optimization of Hurricane Relief Distribution. (Masters Thesis). California State Polytechnic University – Pomona. Retrieved from http://hdl.handle.net/10211.3/216766
Chicago Manual of Style (16th Edition):
Cortes, Miguel. “Optimization of Hurricane Relief Distribution.” 2020. Masters Thesis, California State Polytechnic University – Pomona. Accessed March 07, 2021.
http://hdl.handle.net/10211.3/216766.
MLA Handbook (7th Edition):
Cortes, Miguel. “Optimization of Hurricane Relief Distribution.” 2020. Web. 07 Mar 2021.
Vancouver:
Cortes M. Optimization of Hurricane Relief Distribution. [Internet] [Masters thesis]. California State Polytechnic University – Pomona; 2020. [cited 2021 Mar 07].
Available from: http://hdl.handle.net/10211.3/216766.
Council of Science Editors:
Cortes M. Optimization of Hurricane Relief Distribution. [Masters Thesis]. California State Polytechnic University – Pomona; 2020. Available from: http://hdl.handle.net/10211.3/216766
California State Polytechnic University – Pomona
21.
Thach, Calvin.
The University Class Scheduling Problem.
Degree: MS, Department of Mathematics and Statistics, 2020, California State Polytechnic University – Pomona
URL: http://hdl.handle.net/10211.3/216733
► In this thesis, we investigate different models of the University Class Scheduling Problem (UCSP) and their corresponding solutions. We construct a base model using linear…
(more)
▼ In this thesis, we investigate different models of the University Class Scheduling Problem (UCSP) and their corresponding solutions. We construct a base model using linear programming based upon [1], along with extensions that build up to a model that resembles the environment of Cal Poly Pomona (CPP). Then, with the collection of our models, we consider examples using simulated data to illustrate their behavior. Finally, we use real-world data obtained from CPP???s Mathematics and Statistics Department with our CPP model to obtain an optimal solution to the modeled problem.
Advisors/Committee Members: Cannons, Jillian (advisor), von Bremen, Hubertus (committee member).
Subjects/Keywords: operations research
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Thach, C. (2020). The University Class Scheduling Problem. (Masters Thesis). California State Polytechnic University – Pomona. Retrieved from http://hdl.handle.net/10211.3/216733
Chicago Manual of Style (16th Edition):
Thach, Calvin. “The University Class Scheduling Problem.” 2020. Masters Thesis, California State Polytechnic University – Pomona. Accessed March 07, 2021.
http://hdl.handle.net/10211.3/216733.
MLA Handbook (7th Edition):
Thach, Calvin. “The University Class Scheduling Problem.” 2020. Web. 07 Mar 2021.
Vancouver:
Thach C. The University Class Scheduling Problem. [Internet] [Masters thesis]. California State Polytechnic University – Pomona; 2020. [cited 2021 Mar 07].
Available from: http://hdl.handle.net/10211.3/216733.
Council of Science Editors:
Thach C. The University Class Scheduling Problem. [Masters Thesis]. California State Polytechnic University – Pomona; 2020. Available from: http://hdl.handle.net/10211.3/216733
UCLA
22.
Jahandideh, Hossein.
Dynamic Allocation of Temporal Resources Under Uncertainty.
Degree: Management (MS/PHD), 2018, UCLA
URL: http://www.escholarship.org/uc/item/2g16m6j1
► Temporal resources are defined as human or capital resources with a per-unit-time capacity that can be allocated to different services or products in different periods…
(more)
▼ Temporal resources are defined as human or capital resources with a per-unit-time capacity that can be allocated to different services or products in different periods of time. Examples of temporal resources include machinery, computing power, warehouses, venues, staff, and specialized technology such as a chemical reactor. In this dissertation, I study the problem of dynamically allocating temporal resources to maximize revenue or to minimize costs when the decision-maker is uncertain about the outcome of decisions. I consider two different problems that represent challenges encountered in various industries. In the first chapter, I provide an introduction to the two problems presented in Chapters 2 and 3, discuss the respective motivating industries, and provide examples of broader applications. The first problem, presented in Chapter 2, is the sales of cloud services to owners of interactive (user-based) applications such as websites and mobile apps. If an application owner purchases the service, the provider hosts the application on the cloud and provides the computing power required to support the application users. Here, the units of resource (hardware capacity) allocated to an application over time is directly determined by the traffic-pattern of the application's users. Considering the resource capacity, the provider dynamically prices services to maximize revenue. I model the provider's pricing problem as a large-scale stochastic dynamic program. I decompose this multi-dimensional stochastic dynamic program into single-dimensional sub-problems by proposing a tractable decomposition procedure. I then extend the proposed framework to define an individualized dynamic pricing mechanism for the cloud provider. To evaluate the performance of the proposed pricing mechanism, I present novel upper bounds on the optimal revenue. The computational results show that the proposed model of selling cloud services achieves significantly greater revenue than the prevalent alternative, and that the presented pricing scheme attains near-optimal revenue.In the third chapter of my dissertation I analyze a catalyst-activated batch-production process with uncertainty in production times, learning about catalyst-productivity characteristics, and decay of catalyst performance across batches. The challenge is to determine the quality level of batches and to decide when to replenish a catalyst so as to minimize average costs consisting of inventory holding, backlogging, and catalyst switching costs. The temporal resource in this problem is the common reactor shared across batches and multiple products. I formulate this problem as a Semi-Markov Decision Process (SMDP), and use structural properties of the SMDP to define an effective two-level heuristic which is easy to interpret and implement, and to establish a lower bound on the optimal average cost to evaluate the heuristic. Through application to data from a leading food processing company, I show that the proposed methodology, in addition to attaining near-optimal costs,…
Subjects/Keywords: Operations research
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Jahandideh, H. (2018). Dynamic Allocation of Temporal Resources Under Uncertainty. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/2g16m6j1
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Jahandideh, Hossein. “Dynamic Allocation of Temporal Resources Under Uncertainty.” 2018. Thesis, UCLA. Accessed March 07, 2021.
http://www.escholarship.org/uc/item/2g16m6j1.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Jahandideh, Hossein. “Dynamic Allocation of Temporal Resources Under Uncertainty.” 2018. Web. 07 Mar 2021.
Vancouver:
Jahandideh H. Dynamic Allocation of Temporal Resources Under Uncertainty. [Internet] [Thesis]. UCLA; 2018. [cited 2021 Mar 07].
Available from: http://www.escholarship.org/uc/item/2g16m6j1.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Jahandideh H. Dynamic Allocation of Temporal Resources Under Uncertainty. [Thesis]. UCLA; 2018. Available from: http://www.escholarship.org/uc/item/2g16m6j1
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
23.
Qian, Zhuang.
Dynamic Linkages between Corporate Diversification Strategies and Operational Performance| An Empirical Investigation.
Degree: 2018, State University of New York at Buffalo
URL: http://pqdtopen.proquest.com/#viewpdf?dispub=10823925
► The strategic importance of corporate diversification on firm?s competitive advantage and superior financial performance has been extensively studied in the strategic management literature. However,…
(more)
▼ The strategic importance of corporate diversification on firm?s competitive advantage and superior financial performance has been extensively studied in the strategic management literature. However, in the field of operations management, there is a lack of research on whether and how corporate diversification strategies would impact a firm?s operational performance, and vice versa. To fill this research gap, in this dissertation, we conduct three empirical studies to investigate (1) how product and international diversification strategies influence a firm?s inventory performance; (2) how a firm?s existing resources and target market uncertainty jointly impact product scope expansion; and (3) how a firm?s utilization of resources impacts product scope expansion.
The first essay aims to investigate the impacts of two important corporate diversification strategies on firm?s inventory performance: product diversification (including related and unrelated diversification) and international diversification. Based upon a large firm-level data sample collected from Compustat Fundamental Annual and Compustat Segment, we find that firm?s inventory level increases with the degree of related product diversification but decreases with the degree of unrelated product diversification. There is also strong evidence that highly internationally diversified firms tend to hold more inventory.
Current research has investigated the importance of product scope to a firm?s operational performance (e.g., inventory efficiency, operational costs, and service levels). However, what drives a firm?s decision to expand its product scope remains under-studied. Recent real options research points to the role of uncertainty in the target market. The second essay adds to the literature by proposing that a firm?s resources endowments and target market uncertainty jointly influence its product scope. The empirical analysis confirms a curvilinear relationship between target market uncertainty and the likelihood of product scope expansion. More importantly, we find that different categories of resources alter the influence of target market uncertainty on product scope expansion differently.
Given the fact that firms are striving for improving operational efficiency and reducing operational slack (i.e., resources in excess of what is required to fulfill expected demand), the third essay focuses on the effects of a firm?s capacity, inventory, and supply chain slacks on product scope decision. Our empirical results reveal that firms with more production and inventory slacks are more likely to expand product scopes. Furthermore, our analysis demonstrates that market relatedness positively moderates the effects of production and supply chain slacks on the likelihood of product scope expansion, but negatively moderates the effect of inventory slack on the likelihood of product scope expansion.
Subjects/Keywords: Operations research
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Qian, Z. (2018). Dynamic Linkages between Corporate Diversification Strategies and Operational Performance| An Empirical Investigation. (Thesis). State University of New York at Buffalo. Retrieved from http://pqdtopen.proquest.com/#viewpdf?dispub=10823925
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Qian, Zhuang. “Dynamic Linkages between Corporate Diversification Strategies and Operational Performance| An Empirical Investigation.” 2018. Thesis, State University of New York at Buffalo. Accessed March 07, 2021.
http://pqdtopen.proquest.com/#viewpdf?dispub=10823925.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Qian, Zhuang. “Dynamic Linkages between Corporate Diversification Strategies and Operational Performance| An Empirical Investigation.” 2018. Web. 07 Mar 2021.
Vancouver:
Qian Z. Dynamic Linkages between Corporate Diversification Strategies and Operational Performance| An Empirical Investigation. [Internet] [Thesis]. State University of New York at Buffalo; 2018. [cited 2021 Mar 07].
Available from: http://pqdtopen.proquest.com/#viewpdf?dispub=10823925.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Qian Z. Dynamic Linkages between Corporate Diversification Strategies and Operational Performance| An Empirical Investigation. [Thesis]. State University of New York at Buffalo; 2018. Available from: http://pqdtopen.proquest.com/#viewpdf?dispub=10823925
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Columbia University
24.
Saure, Denis R.
Essays in Consumer Choice Driven Assortment Planning.
Degree: 2011, Columbia University
URL: https://doi.org/10.7916/D8T4412P
► Product assortment selection is among the most critical decisions facing retailers: product variety and relevance is a fundamental driver of consumers' purchase decisions and ultimately…
(more)
▼ Product assortment selection is among the most critical decisions facing retailers: product variety and relevance is a fundamental driver of consumers' purchase decisions and ultimately of a retailer's profitability. In the last couple of decades an increasing number of firms have gained the ability to frequently revisit their assortment decisions during a selling season. In addition, the development and consolidation of online retailing have introduced new levels of operational flexibility, and cheap access to detailed transactional information. These new operational features present the retailer with both benefits and challenges. The ability to revisit the assortment decision frequently over time allows the retailer to introduce and test new products during the selling season, and adjust on the fly to unexpected changes in consumer preferences, and use customer profile information to customize (in real time) online shopping experience. Our main objective in this thesis is to formulate and solve assortment optimization models addressing the challenges present in modern retail environments. We begin by analyzing the role of the assortment decision in balancing information collection and revenue maximization, when consumer preferences are initially unknown. By considering utility maximizing consumers, we establish fundamental limits on the performance of any assortment policy whose aim is to maximize long run revenues. In addition, we propose adaptive assortment policies that attain such performance limits. Our results highlight salient features of this dynamic assortment problem that distinguish it from similar problems of sequential decision making under model uncertainty. Next, we extend the analysis to the case when additional consumer profile information is available; our primary motivation here is the emerging area of online advertisement. As in the previous setup, we identify fundamental performance limits and propose adaptive policies attaining these limits. Finally, we focus on the effects of competition and consumers' access to information on assortment strategies. In particular, we study competition among retailers when they have access to common products, i.e., products that are available to the competition, and where consumers have full information about the retailers' offerings. Our results shed light on equilibrium properties in such settings and the effect common products have on this behavior.
Subjects/Keywords: Operations research
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Saure, D. R. (2011). Essays in Consumer Choice Driven Assortment Planning. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/D8T4412P
Chicago Manual of Style (16th Edition):
Saure, Denis R. “Essays in Consumer Choice Driven Assortment Planning.” 2011. Doctoral Dissertation, Columbia University. Accessed March 07, 2021.
https://doi.org/10.7916/D8T4412P.
MLA Handbook (7th Edition):
Saure, Denis R. “Essays in Consumer Choice Driven Assortment Planning.” 2011. Web. 07 Mar 2021.
Vancouver:
Saure DR. Essays in Consumer Choice Driven Assortment Planning. [Internet] [Doctoral dissertation]. Columbia University; 2011. [cited 2021 Mar 07].
Available from: https://doi.org/10.7916/D8T4412P.
Council of Science Editors:
Saure DR. Essays in Consumer Choice Driven Assortment Planning. [Doctoral Dissertation]. Columbia University; 2011. Available from: https://doi.org/10.7916/D8T4412P
Columbia University
25.
Liu, Yunan.
Many-Server Queues with Time-Varying Arrivals, Customer Abandonment, and non-Exponential Distributions.
Degree: 2011, Columbia University
URL: https://doi.org/10.7916/D8XW4RS9
► This thesis develops deterministic heavy-traffic fluid approximations for many-server stochastic queueing models. The queueing models, with many homogeneous servers working independently in parallel, are intended…
(more)
▼ This thesis develops deterministic heavy-traffic fluid approximations for many-server stochastic queueing models. The queueing models, with many homogeneous servers working independently in parallel, are intended to model large-scale service systems such as call centers and health care systems. Such models also have been employed to study communication, computing and manufacturing systems. The heavy-traffic approximations yield relatively simple formulas for quantities describing system performance, such as the expected number of customers waiting in the queue. The new performance approximations are valuable because, in the generality considered, these complex systems are not amenable to exact mathematical analysis. Since the approximate performance measures can be computed quite rapidly, they usefully complement more cumbersome computer simulation. Thus these heavy-traffic approximations can be used to improve capacity planning and operational control. More specifically, the heavy-traffic approximations here are for large-scale service systems, having many servers and a high arrival rate. The main focus is on systems that have time-varying arrival rates and staffing functions. The system is considered under the assumption that there are alternating periods of overloading and underloading, which commonly occurs when service providers are unable to adjust the staffing frequently enough to economically meet demand at all times. The models also allow the realistic features of customer abandonment and non-exponential probability distributions for the service times and the times customers are willing to wait before abandoning. These features make the overall stochastic model non-Markovian and thus thus very difficult to analyze directly. This thesis provides effective algorithms to compute approximate performance descriptions for these complex systems. These algorithms are based on ordinary differential equations and fixed point equations associated with contraction operators. Simulation experiments are conducted to verify that the approximations are effective. This thesis consists of four pieces of work, each presented in one chapter. The first chapter (Chapter 2) develops the basic fluid approximation for a non-Markovian many-server queue with time-varying arrival rate and staffing. The second chapter (Chapter 3) extends the fluid approximation to systems with complex network structure and Markovian routing to other queues of customers after completing service from each queue. The extension to open networks of queues has important applications. For one example, in hospitals, patients usually move among different units such as emergency rooms, operating rooms, and intensive care units. For another example, in manufacturing systems, individual products visit different work stations one or more times. The open network fluid model has multiple queues each of which has a time-varying arrival rate and staffing function. The third chapter (Chapter 4) studies the large-time asymptotic dynamics of a single fluid queue. When the…
Subjects/Keywords: Operations research
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Liu, Y. (2011). Many-Server Queues with Time-Varying Arrivals, Customer Abandonment, and non-Exponential Distributions. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/D8XW4RS9
Chicago Manual of Style (16th Edition):
Liu, Yunan. “Many-Server Queues with Time-Varying Arrivals, Customer Abandonment, and non-Exponential Distributions.” 2011. Doctoral Dissertation, Columbia University. Accessed March 07, 2021.
https://doi.org/10.7916/D8XW4RS9.
MLA Handbook (7th Edition):
Liu, Yunan. “Many-Server Queues with Time-Varying Arrivals, Customer Abandonment, and non-Exponential Distributions.” 2011. Web. 07 Mar 2021.
Vancouver:
Liu Y. Many-Server Queues with Time-Varying Arrivals, Customer Abandonment, and non-Exponential Distributions. [Internet] [Doctoral dissertation]. Columbia University; 2011. [cited 2021 Mar 07].
Available from: https://doi.org/10.7916/D8XW4RS9.
Council of Science Editors:
Liu Y. Many-Server Queues with Time-Varying Arrivals, Customer Abandonment, and non-Exponential Distributions. [Doctoral Dissertation]. Columbia University; 2011. Available from: https://doi.org/10.7916/D8XW4RS9
Columbia University
26.
Ma, Shiqian.
Algorithms for Sparse and Low-Rank Optimization: Convergence, Complexity and Applications.
Degree: 2011, Columbia University
URL: https://doi.org/10.7916/D8PC38BZ
► Solving optimization problems with sparse or low-rank optimal solutions has been an important topic since the recent emergence of compressed sensing and its matrix extensions…
(more)
▼ Solving optimization problems with sparse or low-rank optimal solutions has been an important topic since the recent emergence of compressed sensing and its matrix extensions such as the matrix rank minimization and robust principal component analysis problems. Compressed sensing enables one to recover a signal or image with fewer observations than the "length" of the signal or image, and thus provides potential breakthroughs in applications where data acquisition is costly. However, the potential impact of compressed sensing cannot be realized without efficient optimization algorithms that can handle extremely large-scale and dense data from real applications. Although the convex relaxations of these problems can be reformulated as either linear programming, second-order cone programming or semidefinite programming problems, the standard methods for solving these relaxations are not applicable because the problems are usually of huge size and contain dense data. In this dissertation, we give efficient algorithms for solving these "sparse" optimization problems and analyze the convergence and iteration complexity properties of these algorithms. Chapter 2 presents algorithms for solving the linearly constrained matrix rank minimization problem. The tightest convex relaxation of this problem is the linearly constrained nuclear norm minimization. Although the latter can be cast and solved as a semidefinite programming problem, such an approach is computationally expensive when the matrices are large. In Chapter 2, we propose fixed-point and Bregman iterative algorithms for solving the nuclear norm minimization problem and prove convergence of the first of these algorithms. By using a homotopy approach together with an approximate singular value decomposition procedure, we get a very fast, robust and powerful algorithm, which we call FPCA (Fixed Point Continuation with Approximate SVD), that can solve very large matrix rank minimization problems. Our numerical results on randomly generated and real matrix completion problems demonstrate that this algorithm is much faster and provides much better recoverability than semidefinite programming solvers such as SDPT3. For example, our algorithm can recover 1000 × 1000 matrices of rank 50 with a relative error of 10-5 in about 3 minutes by sampling only 20 percent of the elements. We know of no other method that achieves as good recoverability. Numerical experiments on online recommendation, DNA microarray data set and image inpainting problems demonstrate the effectiveness of our algorithms. In Chapter 3, we study the convergence/recoverability properties of the fixed point continuation algorithm and its variants for matrix rank minimization. Heuristics for determining the rank of the matrix when its true rank is not known are also proposed. Some of these algorithms are closely related to greedy algorithms in compressed sensing. Numerical results for these algorithms for solving linearly constrained matrix rank minimization problems are reported. Chapters 4 and 5…
Subjects/Keywords: Operations research
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Ma, S. (2011). Algorithms for Sparse and Low-Rank Optimization: Convergence, Complexity and Applications. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/D8PC38BZ
Chicago Manual of Style (16th Edition):
Ma, Shiqian. “Algorithms for Sparse and Low-Rank Optimization: Convergence, Complexity and Applications.” 2011. Doctoral Dissertation, Columbia University. Accessed March 07, 2021.
https://doi.org/10.7916/D8PC38BZ.
MLA Handbook (7th Edition):
Ma, Shiqian. “Algorithms for Sparse and Low-Rank Optimization: Convergence, Complexity and Applications.” 2011. Web. 07 Mar 2021.
Vancouver:
Ma S. Algorithms for Sparse and Low-Rank Optimization: Convergence, Complexity and Applications. [Internet] [Doctoral dissertation]. Columbia University; 2011. [cited 2021 Mar 07].
Available from: https://doi.org/10.7916/D8PC38BZ.
Council of Science Editors:
Ma S. Algorithms for Sparse and Low-Rank Optimization: Convergence, Complexity and Applications. [Doctoral Dissertation]. Columbia University; 2011. Available from: https://doi.org/10.7916/D8PC38BZ
Columbia University
27.
Lee, Thiam Hui.
Essays on Inventory Management and Object Allocation.
Degree: 2012, Columbia University
URL: https://doi.org/10.7916/D8JM2HM7
► This dissertation consists of three essays. In the first, we establish a framework for proving equivalences between mechanisms that allocate indivisible objects to agents. In…
(more)
▼ This dissertation consists of three essays. In the first, we establish a framework for proving equivalences between mechanisms that allocate indivisible objects to agents. In the second, we study a newsvendor model where the inventory manager has access to two experts that provide advice, and examine how and when an optimal algorithm can be efficiently computed. In the third, we study classical single-resource capacity allocation problem and investigate the relationship between data availability and performance guarantees.
We first study mechanisms that solve the problem of allocating indivisible objects to agents. We consider the class of mechanisms that utilize the Top Trading Cycles (TTC) algorithm (these may differ based on how they prioritize agents), and show a general approach to proving equivalences between mechanisms from this class. This approach is used to show alternative and simpler proofs for two recent equivalence results for mechanisms with linear priority structures. We also use the same approach to show that these equivalence results can be generalized to mechanisms where the agent priority structure is described by a tree.
Second, we study the newsvendor model where the manager has recourse to advice, or decision recommendations, from two experts, and where the objective is to minimize worst-case regret from not following the advice of the better of the two agents. We show the model can be reduced to the class machine-learning problem of predicting binary sequences but with an asymmetric cost function, allowing us to obtain an optimal algorithm by modifying a well-known existing one. However, the algorithm we modify, and consequently the optimal algorithm we describe, is not known to be efficiently computable, because it requires evaluations of a function v which is the objective value of recursively defined optimization problems. We analyze v and show that when the two cost parameters of the newsvendor model are small multiples of a common factor, its evaluation is computationally efficient. We also provide a novel and direct asymptotic analysis of v that differs from previous approaches. Our asymptotic analysis gives us insight into the transient structure of v as its parameters scale, enabling us to formulate a heuristic for evaluating v generally. This, in turn, defines a heuristic for the optimal algorithm whose decisions we find in a numerical study to be close to optimal.
In our third essay, we study the classical single-resource capacity allocation problem. In particular, we analyze the relationship between data availability (in the form of demand samples) and performance guarantees for solutions derived from that data. This is done by describing a class of solutions called epsilon-backwards accurate policies and determining a suboptimality gap for this class of solutions. The suboptimality gap we find is in terms of epsilon and is also distribution-free. We then relate solutions generated by a Monte Carlo algorithm and epsilon-backwards accurate policies, showing a lower bound on the…
Subjects/Keywords: Operations research
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Lee, T. H. (2012). Essays on Inventory Management and Object Allocation. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/D8JM2HM7
Chicago Manual of Style (16th Edition):
Lee, Thiam Hui. “Essays on Inventory Management and Object Allocation.” 2012. Doctoral Dissertation, Columbia University. Accessed March 07, 2021.
https://doi.org/10.7916/D8JM2HM7.
MLA Handbook (7th Edition):
Lee, Thiam Hui. “Essays on Inventory Management and Object Allocation.” 2012. Web. 07 Mar 2021.
Vancouver:
Lee TH. Essays on Inventory Management and Object Allocation. [Internet] [Doctoral dissertation]. Columbia University; 2012. [cited 2021 Mar 07].
Available from: https://doi.org/10.7916/D8JM2HM7.
Council of Science Editors:
Lee TH. Essays on Inventory Management and Object Allocation. [Doctoral Dissertation]. Columbia University; 2012. Available from: https://doi.org/10.7916/D8JM2HM7
Columbia University
28.
Nur, Cavdaroglu.
Three Essays on Dynamic Pricing and Resource Allocation.
Degree: 2012, Columbia University
URL: https://doi.org/10.7916/D8W09D0G
► This thesis consists of three essays that focus on different aspects of pricing and resource allocation. We use techniques from supply chain and revenue management,…
(more)
▼ This thesis consists of three essays that focus on different aspects of pricing and resource allocation. We use techniques from supply chain and revenue management, scenario-based robust optimization and game theory to study the behavior of firms in different competitive and non-competitive settings. We develop dynamic programming models that account for pricing and resource allocation decisions of firms in such settings. In Chapter 2, we focus on the resource allocation problem of a service firm, particularly a health-care facility. We formulate a general model that is applicable to various resource allocation problems of a hospital. To this end, we consider a system with multiple customer classes that display different reactions to delays in service. By adopting a dynamic-programming approach, we show that the optimal policy is not simple but exhibits desirable monotonicity properties. Furthermore, we propose a simple threshold heuristic policy that performs well in our experiments. In Chapter 3, we study a dynamic pricing problem for a monopolist seller that operates in a setting where buyers have market power, and where each potential sale takes the form of a bilateral negotiation. We review the dynamic programming formulation of the negotiation problem, and propose a simple and tractable deterministic "fluid" analogue for this problem. The main emphasis of the chapter is in expanding the formulation to the dynamic setting where both the buyer and seller have limited prior information on their counterparty valuation and their negotiation skill. In Chapter 4, we consider the revenue maximization problem of a seller who operates in a market where there are two types of customers; namely the "investors" and "regular-buyers". In a two-period setting, we model and solve the pricing game between the seller and the investors in the latter period, and based on the solution of this game, we analyze the revenue maximization problem of the seller in the former period. Moreover, we study the effects on the total system profits when the seller and the investors cooperate through a contracting mechanism rather than competing with each other; and explore the contracting opportunities that lead to higher profits for both agents.
Subjects/Keywords: Operations research
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Nur, C. (2012). Three Essays on Dynamic Pricing and Resource Allocation. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/D8W09D0G
Chicago Manual of Style (16th Edition):
Nur, Cavdaroglu. “Three Essays on Dynamic Pricing and Resource Allocation.” 2012. Doctoral Dissertation, Columbia University. Accessed March 07, 2021.
https://doi.org/10.7916/D8W09D0G.
MLA Handbook (7th Edition):
Nur, Cavdaroglu. “Three Essays on Dynamic Pricing and Resource Allocation.” 2012. Web. 07 Mar 2021.
Vancouver:
Nur C. Three Essays on Dynamic Pricing and Resource Allocation. [Internet] [Doctoral dissertation]. Columbia University; 2012. [cited 2021 Mar 07].
Available from: https://doi.org/10.7916/D8W09D0G.
Council of Science Editors:
Nur C. Three Essays on Dynamic Pricing and Resource Allocation. [Doctoral Dissertation]. Columbia University; 2012. Available from: https://doi.org/10.7916/D8W09D0G
Columbia University
29.
Lu, Yina.
Data-driven System Design in Service Operations.
Degree: 2013, Columbia University
URL: https://doi.org/10.7916/D8WM1MSF
► The service industry has become an increasingly important component in the world's economy. Simultaneously, the data collected from service systems has grown rapidly in both…
(more)
▼ The service industry has become an increasingly important component in the world's economy. Simultaneously, the data collected from service systems has grown rapidly in both size and complexity due to the rapid spread of information technology, providing new opportunities and challenges for operations management researchers. This dissertation aims to explore methodologies to extract information from data and provide powerful insights to guide the design of service delivery systems. To do this, we analyze three applications in the retail, healthcare, and IT service industries. In the first application, we conduct an empirical study to analyze how waiting in queue in the context of a retail store affects customers' purchasing behavior. The methodology combines a novel dataset collected via video recognition technology with traditional point-of-sales data. We find that waiting in queue has a nonlinear impact on purchase incidence and that customers appear to focus mostly on the length of the queue, without adjusting enough for the speed at which the line moves. We also find that customers' sensitivity to waiting is heterogeneous and negatively correlated with price sensitivity. These findings have important implications for queueing system design and pricing management under congestion. The second application focuses on disaster planning in healthcare. According to a U.S. government mandate, in a catastrophic event, the New York City metropolitan areas need to be capable of caring for 400 burn-injured patients during a catastrophe, which far exceeds the current burn bed capacity. We develop a new system for prioritizing patients for transfer to burn beds as they become available and demonstrate its superiority over several other triage methods. Based on data from previous burn catastrophes, we study the feasibility of being able to admit the required number of patients to burn beds within the critical three-to-five-day time frame. We find that this is unlikely and that the ability to do so is highly dependent on the type of event and the demographics of the patient population. This work has implications for how disaster plans in other metropolitan areas should be developed. In the third application, we study workers' productivity in a global IT service delivery system, where service requests from possibly globally distributed customers are managed centrally and served by agents. Based on a novel dataset which tracks the detailed time intervals an agent spends on all business related activities, we develop a methodology to study the variation of productivity over time motivated by econometric tools from survival analysis. This approach can be used to identify different mechanisms by which workload affects productivity. The findings provide important insights for the design of the workload allocation policies which account for agents' workload management behavior.
Subjects/Keywords: Operations research
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Lu, Y. (2013). Data-driven System Design in Service Operations. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/D8WM1MSF
Chicago Manual of Style (16th Edition):
Lu, Yina. “Data-driven System Design in Service Operations.” 2013. Doctoral Dissertation, Columbia University. Accessed March 07, 2021.
https://doi.org/10.7916/D8WM1MSF.
MLA Handbook (7th Edition):
Lu, Yina. “Data-driven System Design in Service Operations.” 2013. Web. 07 Mar 2021.
Vancouver:
Lu Y. Data-driven System Design in Service Operations. [Internet] [Doctoral dissertation]. Columbia University; 2013. [cited 2021 Mar 07].
Available from: https://doi.org/10.7916/D8WM1MSF.
Council of Science Editors:
Lu Y. Data-driven System Design in Service Operations. [Doctoral Dissertation]. Columbia University; 2013. Available from: https://doi.org/10.7916/D8WM1MSF
Columbia University
30.
Chen, Xinyun.
Perfect Simulation, Sample-path Large Deviations, and Multiscale Modeling for Some Fundamental Queueing Systems.
Degree: 2014, Columbia University
URL: https://doi.org/10.7916/D8WH2MZ1
► As a primary branch of Operations Research, Queueing Theory models and analyzes engineering systems with random fluctuations. With the development of internet and computation techniques,…
(more)
▼ As a primary branch of Operations Research, Queueing Theory models and analyzes engineering systems with random fluctuations. With the development of internet and computation techniques, the engineering systems today are much bigger in scale and more complicated in structure than 20 years ago, which raises numerous new problems to researchers in the field of queueing theory. The aim of this thesis is to explore new methods and tools, from both algorithmic and analytical perspectives, that are useful to solve such problems.
In Chapter 1 and 2, we introduce some techniques of asymptotic analysis that are relatively new to queueing applications in order to give more accurate probabilistic characterization of queueing models with large scale and complicated structure. In particular, Chapter 1 gives the first functional large deviation result for infinite-server system with general inter-arrival and service times. The functional approach we use enables a nice description of the whole system over the entire time horizon of interest, which is important in real problems. In Chapter 2, we construct a queueing model for the so-called limit order book that is used in main financial markets worldwide. We use an asymptotic approach called multi-scale modeling to disentangle the complicated dependence among the elements in the trading system and to reduce the model dimensionality. The asymptotic regime we use is inspired by empirical observations and the resulting limit process explains and reproduces stylized features of real market data. Chapter 2 also provides a nice example of novel applications of queueing models in systems, such as the electronic trading system, that are traditionally outside the scope of queueing theory.
Chapter 3 and 4 focus on stochastic simulation methods for performance evaluation of queueing models where analytic approaches fail.
In Chapter 3, we develop a perfect sampling algorithm to generate exact samples from the stationary distribution of stochastic fluid networks in polynomial time. Our approach can be used for time-varying networks with general inter-arrival and service times, whose stationary distributions have no analytic expression. In Chapter 4, we focus on the stochastic systems with continuous random fluctuations, for instance, the workload arrives to the system in continuous flow like a Levy process. We develop a general framework of simulation algorithms featuring a deterministic error bound and an almost square root convergence rate. As an application, we apply this framework to estimate the stationary distributions of reflected Brownian motions and the performance of our algorithm is better than existing prevalent numeric methods.
Subjects/Keywords: Operations research
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Chen, X. (2014). Perfect Simulation, Sample-path Large Deviations, and Multiscale Modeling for Some Fundamental Queueing Systems. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/D8WH2MZ1
Chicago Manual of Style (16th Edition):
Chen, Xinyun. “Perfect Simulation, Sample-path Large Deviations, and Multiscale Modeling for Some Fundamental Queueing Systems.” 2014. Doctoral Dissertation, Columbia University. Accessed March 07, 2021.
https://doi.org/10.7916/D8WH2MZ1.
MLA Handbook (7th Edition):
Chen, Xinyun. “Perfect Simulation, Sample-path Large Deviations, and Multiscale Modeling for Some Fundamental Queueing Systems.” 2014. Web. 07 Mar 2021.
Vancouver:
Chen X. Perfect Simulation, Sample-path Large Deviations, and Multiscale Modeling for Some Fundamental Queueing Systems. [Internet] [Doctoral dissertation]. Columbia University; 2014. [cited 2021 Mar 07].
Available from: https://doi.org/10.7916/D8WH2MZ1.
Council of Science Editors:
Chen X. Perfect Simulation, Sample-path Large Deviations, and Multiscale Modeling for Some Fundamental Queueing Systems. [Doctoral Dissertation]. Columbia University; 2014. Available from: https://doi.org/10.7916/D8WH2MZ1
◁ [1] [2] [3] [4] [5] … [122] ▶
. 
Open Access Theses and Dissertations
