Publications with Fulltext
Permanent URI for this collectionhttps://hdl.handle.net/20.500.14288/6
Browse
19 results
Search Results
Publication Open Access Managing portfolio of elective surgical procedures: a multidimensional inverse newsvendor problem(The Institute for Operations Research and the Management Sciences (INFORMS), 2019) Bavafa, Hessam; Leys, Charles M.; Savin, Sergei; Department of Industrial Engineering; Örmeci, Lerzan; Faculty Member; Department of Industrial Engineering; College of Engineering; 32863We consider the problem of allocating daily hospital service capacity among several types of elective surgical procedures in the presence of random numbers of urgent procedures described by arbitrary finite support distributions. Our focus is on the interaction between two major constraining hospital resources: operating room (OR) and recovery bed capacity. In our model, each type of surgical procedure has an associated revenue, stochastic procedure duration, and stochastic length of stay (LOS). We consider arbitrary distributions of procedure and LOS durations and derive a two-moment approximation based on the Central Limit Theorem (CLT) for the total procedure duration and the daily number of occupied beds for a given portfolio of procedures. An important novel element of our model is accounting for correlation among the surgical and patient LOS durations for the procedures performed by the same surgical team. We treat the available OR and recovery bed capacity as nominal, allowing them to be exceeded at a cost. The resulting model is a novel, multidimensional variant of the inverse newsvendor problem, where multiple demand types compete for multiple types of service capacity. We characterize the optimal number of elective procedures for single-specialty hospitals and derive an optimality bound for a "front-end" capacity management approach that focuses exclusively on OR capacity. For a setting with two dominant procedure types, we provide an analytical characterization of the optimal portfolio composition under the condition that the revenue from each procedure is proportional to the expected use of hospital resources. We also derive a general analytical description of the optimal portfolio for an arbitrary number of procedure types. For the general case of an arbitrary number of procedure types in the presence of urgent procedures, we conduct a numerical study using data that we have collected at a medium-sized teaching hospital. Our numerical study illustrates the composition of the optimal portfolios of elective procedures in different practical settings, and it investigates the quality of the CLT-based approximation and the effectiveness of the front-end approach to hospital capacity management.Publication Open Access Hub location, routing, and route dimensioning: strategic and tactical intermodal transportation hub network design(The Institute for Operations Research and the Management Sciences (INFORMS), 2021) Yaman Hande; Karaşan Oya Ekin; Department of Industrial Engineering; Yıldız, Barış; Faculty Member; Department of Industrial Engineering; College of Engineering; 258791We propose a novel hub location model that jointly eliminates some of the traditional assumptions on the structure of the network and on the discount as a result of economies of scale in an effort to better reflect real-world logistics and transportation systems. Our model extends the hub literature in various facets: instead of connecting nonhub nodes directly to hub nodes, we consider routes with stopovers; instead of connecting pairs of hubs directly, we design routes that can visit several hub nodes; rather than dimensioning pairwise connections, we dimension routes of vehicles; and rather than working with a homogeneous fleet, we use intermodal transportation. Decisions pertinent to strategic and tactical hub location and transportation network design are concurrently made through the proposed optimization scheme. An effective branch-and-cut algorithm is developed to solve realistically sized problem instances and to provide managerial insights.Publication Open Access Regenerator location problem in flexible optical networks(Informs, 2017) Karasan, Oya Ekin; Department of Industrial Engineering; Yıldız, Barış; Faculty Member; Department of Industrial Engineering; College of Engineering; 258791In this study, we introduce the regenerator location problem in flexible optical networks. With a given traffic demand, the regenerator location problem in flexible optical networks considers the regenerator location, routing, bandwidth allocation, and modulation selection problems jointly to satisfy data transfer demands with the minimum cost regenerator deployment. We propose a novel branch-and-price algorithm for this challenging problem. Using real-world network topologies, we conduct extensive numerical experiments to both test the performance of the proposed solution methodology and evaluate the practical benefits of flexible optical networks. In particular, our results show that, making routing, bandwidth allocation, modulation selection, and regenerator placement decisions in a joint manner, it is possible to obtain drastic capacity enhancements when only a very modest portion of the nodes is endowed with the signal regeneration capability.Publication Open Access Joint transmit-and-receive antenna selection system for MIMO-NOMA with energy harvesting(Institute of Electrical and Electronics Engineers (IEEE), 2021) Department of Electrical and Electronics Engineering; Başar, Ertuğrul; Aldababsa, Mahmoud; Faculty Member; Department of Electrical and Electronics Engineering; College of Engineering; 149116; N/AIn this article, outage probability (OP) of a joint transmit-and-receive antenna selection (JTRAS) scheme is analyzed in multiple-input–multiple-output nonorthogonal multiple-access-based downlink energy harvesting (EH) relaying networks. In this dual-hop and amplify-and-forward relaying-based network, since the first and second hops are types of single-user and multiuser systems, respectively, the optimal JTRAS and suboptimal majority-based JTRAS schemes are employed in the first and second hops. The theoretical OP analysis is carried out over Nakagami-m fading channels in the cases of perfect and imperfect successive interference cancellation. An asymptotic OP expression is also obtained at a high signal-to-noise ratio regime. Finally, Monte Carlo simulations are performed to substantiate the accuracy of the theoretical analysis. It is shown that the optimal power splitting ratios at the EH relay are different for users and the users with good channel conditions have minimum optimal ratios.Publication Open Access Impact of delay announcements in call centers: an empirical approach(Informs, 2017) Ata, B.; Emadi, Sm.; Su, Cl.; Department of Business Administration; Karaesmen, Zeynep Akşin; Faculty Member; Department of Business Administration; College of Administrative Sciences and Economics; 4534We undertake an empirical study of the impact of delay announcements on callers' abandonment behavior and the performance of a call center with two priority classes. A Cox regression analysis reveals that in this call center, callers' abandonment behavior is affected by the announcement messages heard. To account for this, we formulate a structural estimation model of callers' (endogenous) abandonment decisions. In this model, callers are forward-looking utility maximizers and make their abandonment decisions by solving an optimal stopping problem. Each caller receives a reward from service and incurs a linear cost of waiting. The reward and per-period waiting cost constitute the structural parameters that we estimate from the data of callers' abandonment decisions as well as the announcement messages heard. The call center performance is modeled by a Markovian approximation. The main methodological contribution is the definition of an equilibrium in steady state as one where callers' expectation of their waiting time, which affects their (rational) abandonment behavior, matches their actual waiting time in the call center, as well as the characterization of such an equilibrium as the solution of a set of nonlinear equations. A counterfactual analysis shows that callers react to longer delay announcements by abandoning earlier, that less patient callers as characterized by their reward and cost parameters react more to delay announcements, and that congestion in the call center at the time of the call affects caller reactions to delay announcements.Publication Open Access Managing manufacturing risks by using capacity options(Springer, 2002) Department of Business Administration; Tan, Barış; Faculty Member; Department of Business Administration; College of Administrative Sciences and Economics; 28600In this study, we investigate the strategy of increasing production capacity temporarily through contingent contractual agreements with short-cycle manufacturers to manage the risks associated with demand volatility. We view all these agreements as capacity options. More specifically, we consider a manufacturing company that produces a replenishment product that is sold at a retailer. The demand for the product switches randomly between a high level and a low level. The production system has enough capacity to meet the demand in the long run. However, when the demand is high, it does not have enough capacity to meet the instantaneous demand and thus has to produce to stock in advance. Alternatively, a contractual agreement with a short-cycle manufacturer can be made. This option gives the right to receive additional production capacity when needed. There is a fixed cost to purchase this option for a period of time and, if the option is exercised, there is an additional per unit exercise price which corresponds to the cost of the goods produced at the short-cycle manufacturer. We formulate the problem as a stochastic optimal control problem and analyse it analytically. By comparing the costs between two cases where the contract with the short-cycle manufacturer is used or not, the value of this option is evaluated. Furthermore, the effect of demand variability on this contract is investigated.Publication Open Access Reconfigurable intelligent surface-empowered MIMO systems(Institute of Electrical and Electronics Engineers (IEEE), 2021) Department of Electrical and Electronics Engineering; Başar, Ertuğrul; Khaleel, Aymen; Faculty Member; Department of Electrical and Electronics Engineering; College of Engineering; Graduate School of Sciences and Engineering; 149116; N/AReconfigurable intelligent surface (RIS)-assisted communications appear as a promising candidate for future wireless systems due to its attractive advantages in terms of implementation cost and end-to-end system performance. In this article, two new multiple-input multiple-output (MIMO) system designs using RISs are presented to enhance the performance and boost the spectral efficiency of state-of-the-art MIMO communication systems. Vertical Bell Labs layered space-time (VBLAST) and Alamouti's schemes have been considered in this article and RIS-based simple transceiver architectures are proposed. For the VBLAST-based new system, an RIS is used to enhance the performance of the nulling and canceling-based suboptimal detection procedure as well as to noticeably boost the spectral efficiency by conveying extra bits through the adjustment of the phases of the RIS elements. In addition, RIS elements have been utilized in order to redesign Alamouti's scheme with a single radio frequency signal generator at the transmitter side and to enhance its bit error rate (BER) performance. Monte Carlo simulations are provided to show the effectiveness of our system designs and it has been shown that they outperform the reference schemes in terms of BER performance and spectral efficiency.Publication Open Access Stochastic cyclic scheduling problem in synchronous assembly and production lines(Taylor _ Francis, 1998) Department of Business Administration; Tan, Barış; Karabatı, Selçuk; Faculty Member; Faculty Member; Department of Business Administration; College of Administrative Sciences and Economics; 28600; 38819In this paper we address the stochastic cyclic scheduling problem in synchronous assembly and production lines. Synchronous lines are widely used in the production and assembly of various goods such as automobiles or household appliances. We consider cycle time minimisation (or throughput rate maximisation) as the objective of the scheduling problem with the assumption that the processing times are independent random variables. We first discuss the two-station case and present a lower bounding scheme and an approximate solution procedure for the scheduling problem. For the general case of the problem, two heuristic solution procedures are presented. An extension of the two-station lower bound to the general case of the problem is also discussed. The performance of the proposed heuristics on randomly generated problems is documented, and the impact of scheduling decisions on problems with different levels of variability in processing times are analysed. We also analyse the problem of sequence determination when the available information is limited to the expected values of individual processing times.Publication Open Access A multiperiod stochastic production planning and sourcing problem with service level constraints(Springer, 2005) Yıldırım, Işıl; Department of Business Administration; Department of Industrial Engineering; Tan, Barış; Karaesmen, Fikri; Faculty Member; Faculty Member; Department of Business Administration; Department of Industrial Engineering; College of Administrative Sciences and Economics; College of Engineering; 28600; 3579We study a stochastic multiperiod production planning and sourcing problem of a manufacturer with a number of plants and/or subcontractors. Each source, i.e. each plant and subcontractor, has a different production cost, capacity, and lead time. The manufacturer has to meet the demand for different products according to the service level requirements set by its customers. The demand for each product in each period is random. We present a methodology that a manufacturer can utilize to make its production and sourcing decisions, i.e., to decide how much to produce, when to produce, where to produce, how much inventory to carry, etc. This methodology is based on a mathematical programming approach. The randomness in demand and related probabilistic service level constraints are integrated in a deterministic mathematical program by adding a number of additional linear constraints. Using a rolling horizon approach that solves the deterministic equivalent problem based on the available data at each time period yields an approximate solution to the original dynamic problem. We show that this approach yields the same result as the base stock policy for a single plant with stationary demand. For a system with dual sources, we show that the results obtained from solving the deterministic equivalent model on a rolling horizon gives similar results to a threshold subcontracting policy.Publication Open Access The r-interdiction selective multi-depot vehicle routing problem(Wiley, 2019) Sadati, Mir Ehsan Hesam; Aras, Necati; Department of Business Administration; Aksen, Deniz; Faculty Member; Department of Business Administration; College of Administrative Sciences and Economics; 40308The protection of critical facilities has been attracting increasing attention in the past two decades. Critical facilities involve physical assets such as bridges, railways, power plants, hospitals, and transportation hubs among others. In this study we introduce a bilevel optimization problem for the determination of the most critical depots in a vehicle routing context. The problem is modeled as an attacker-defender game (Stackelberg game) from the perspective of an adversary agent (the attacker) who aims to inflict maximum disruption on a routing network. We refer to this problem as the r-interdiction selective multi-depot vehicle routing problem (RI-SMDVRP). The attacker is the decision maker in the upper level problem (ULP) who chooses r depots to interdict with certainty. The defender is the decision maker in the lower level problem (LLP) who optimizes the vehicle routes in the wake of the attack. The defender has to satisfy all customer demand either using the remaining depots or through outsourcing to a third party logistics service provider. The ULP is solved through exhaustive enumeration, which is viable when the cardinality of interdictions does not exceed five among nine depots. For the LLP we implement a tabu search heuristic adapted to the selective multi-depot VRP. Our results are obtained on a set of RI-SMDVRP instances synthetically constructed from standard MDVRP test instances.