Browsing OSU Theses by Author "Kamath, Manjunath"
Now showing items 1-13 of 13
-
Aggregation Approaches for Incorporating E-mail Processing History in Queueing Models of Customer Contact Centers
Chinnaswamy, Mohan Raj (Oklahoma State University, 2005-05-01)The operation of a customer contact center where the interface between the agents' and the customer happens through e-mail was modeled using a multi-class open queueing network model. A novel approach to model the dependence ... -
Analysis of Demographic and Clinical Data of Patients to Determine the Effective Markers of Bipolar Disorder
Tipnis, Uttara Vinay (2016-07-01)Bipolar disorder is also known as manic depression. Patients with this disease exhibit symptoms of depression and mania or hypomania in a cyclical manner. While depression symptoms are relatively easy to detect, manic and ... -
Analysis of Polca and Gpolca Material Control Strategies
Bhatewara, Vishal Gautamchand (Oklahoma State University, 2013-05-01)Scope and method of study: This research sheds new light on the performance of two relatively new material control strategies, known as Paired-cell Overlapping Loops of Cards with Authorization (POLCA) and Generic-POLCA ... -
Automatic Configuration of Queueing Network Models from Business Process Descriptions
Chalavadi, Uma Maheshwar (Oklahoma State University, 2004-12-01)The purpose of this study was to develop a transformation scheme for automatic configuration of queueing network models from business process descriptions. Such a transformation scheme would enable queueing analysis of ... -
Data-driven modeling and analysis for cardiovascular disease risk prediction and reduction
Dogan, Ayse (2021-05)In recent decades, cardiovascular disease (CVD) has become the leading cause of death in most countries of the world. Since many types of CVD could be preventable by modifying lifestyle behaviors, the objective of this ... -
Heuristic Approach to the Chance Constrained Minimum Spanning K-core Problem
Dhaygude, Ameya Abasaheb (Oklahoma State University, 2010-12-01)This thesis presents metaheuristic approaches to solve a novel network design problem under uncertainty. The problem is an extension of the classical k-core based network model called as the minimum spanning k-core problem. ... -
Impact of Replenishment Frequency Driven Product Allocation in a Retail Supply Chain
Narayanan, Bharath (2015-07-01)Distribution Centers (DC) perform a key role in the order fulfillment process by intermittently stocking products to be redistributed to different retail stores. An important strategic decision that has implications on ... -
Improvement of Hospital Emergency Department Operations Using Simulation-based Approach
Tamraparni, Vishal (Oklahoma State University, 2014-12-01)Scope and method of study: The study aimed at reducing the length of stay of patients in a hospital emergency department (ED) through systematic investigation using a simulation based approach. Literature review conducted ... -
Improving Dynamic Decision-Making Through RFID: A Partially Observable Markov Decision Process (POMDP) for RFID-Enhanced Warehouse Search Operations
Hariharan, Sharethram (Oklahoma State University, 2006-12-01)Misplaced items contribute significantly (2-10%) to the operational expense of a typical warehouse. In this work we develop a Partially Observable Markov Decision Process (POMDP) model for RFID directed search to detect ... -
Job Shop Scheduling: A Predictive Neural Network Modeling System for a Quantified Sequencing Rule
Salman, Sinan (2001-05-01) -
Modeling and analysis of mass casualty triage systems
Bonjour, Bailey Whitman (2020-05)In the aftermath of a mass casualty incident, a large number of patients are likely to arrive at a hospital for medical care. The large patient demand often overwhelms the capacity of the medical resources available in an ... -
Novel Stopping Criterion for Optimization
Padmanabhan, Venkatram Harihara (Oklahoma State University, 2005-07-01)A novel method for identification of steady state is demonstrated as the termination criterion for the optimization stage of modeling empirical data. The method was tested on a variety of applications. It is described, and ... -
Robust Shortest Paths under Uncertainty Using Conditional Value-at-Risk
Bright, Julie Anna (Oklahoma State University, 2011-12-01)Finding a shortest path in a network is a classical problem in discrete optimization. The systems underlying the network models are subjects to a variety of sources of uncertainty. The purpose of this thesis is to model ...