Informs Annual Meeting 2017

WC36

INFORMS Houston – 2017

2 - Optimal Production and Collection Strategies for Hybrid Remanufacturing with Technology Licensing Yanting Huang, Phd Candidate, Huazhong University of Science and Technology, 1037 Luoyu Road, Wuhan, 430074, China, ythuang4028@hust.edu.cn This paper investigates a closed-loop supply chain where the manufacturer cooperates with the distributor and the third party under technology licensing to collect and remanufacture used products. We adopt the Stackelberg game to obtain the equilibrium strategies and discuss the impact of remanufacturing ability on chain members’ decisions and environmental sustainability. We find that, each chain member can reach the largest profit in the case where remanufacturing activities is undertaken by himself. And a higher remanufacturing ability is beneficial for the environment. 3 - Effects of Modular Designs: A Closed-loop Supply Chain Perspective Thomas Nowak, Postdoctoral Researcher, Vienna University of Economics and Business, Welthandelsplatz 1, Vienna, 1020, Austria, thomas.nowak@wu.ac.at, Fuminori Toyasaki, Tina B. Wakolbinger This study analyzes effects of product modularity from a closed-loop supply chain perspective. Based on two optimization models, we explore the effects of supply chain strategies and consumers’ attitude towards new or refurbished as well as integral or modular products on a manufacturer’s production decision problem. While the first optimization problem considers a company following a reactive strategy with no demand uncertainty but high production costs, the second optimization problem considers a company following an anticipatory strategy with demand uncertainty but lower production costs. Chair: Yuncheol Kang, Hongik University, Seoul, yckang@hongik.ac.kr 1 - Designing Lean Systems to Improve Government Agencies’ Performance Elizabeth Ayala-Medina, Graduate Student, University of Puerto Rico-Mayagÿez, Mayagüez, Puerto Rico, elizabeth.ayala@upr.edu, Betzabé Rodríguez Driven by a strong social commitment our institution has evaluated areas of opportunity to collaborate with highly influential sectors such as government agencies. One of the proposed methods for improving agency performance is implementing lean systems that will provide for more efficient services, more satisfied customers, and a sustainable improvement. 2 - Single-commodity Flow-based Formulations and Accelerated Benders Algorithms for the High-multiplicity Asymmetric Traveling Salesman Problem and its Extensions Maichel M. Aguayo, Universidad de Concepcion, Concepcion, 4030000, Chile, maichelaguayo@udec.cl, Subhash C. Sarin, Hanif Dostmahomed Sherali We present a single-commodity flow-based formulation for the high-multiplicity asymmetric traveling salesman problem, which is an extension of the asymmetric traveling salesman problem (ATSP) wherein a city can be visited multiple times. We show that even though this formulation is not as tight as the best known formulation for the HMATSP, it is faster and easier to use for direct solution by CPLEX, and can be used to model several variants or extensions of the HMATSP that have not been studied in the literature. Furthermore, we propose effective accelerated Benders algorithms that are demonstrated to solve instances of the HMATSP and its extensions involve up to 1001 cities within an hour of CPU time. 3 - Enabling Online Staff Scheduling Applications: Algorithms and Deployment Strategies for Online Courier Scheduling to Deliver Perishable Foods We address the less developed area of online algorithms for staff scheduling applications by solving the courier resource planning and real-time management problems required to deliver perishable foods. Our solution involves online estimation to predict near-future courier supply requirements. In addition, we adopt fine-grained schedule adjustment algorithms, automated selection and incentives, and online control algorithms to efficiently adjust courier resources to meet supply requirements, while maximizing financial benefits and convenience for individual couriers. Henry Tominaga, Senior Decision Scientist, Grubhub Inc, 1300 Southampton Rd. Apt 186, Benicia, CA, 94510, United States, htominaga@grubhub.com, Dan Wigrizer WC36 351F Service Science Contributed Session

4 - A Joint Production and Delivery Schedule for a Single-vendor Single-buyer System Over Finite Horizon Fangzhou Sun, Virginia Tech, 1740 Donlee Dr, Blacksburg, VA, 24060, United States, fangzhou@vt.edu, Subhash Sarin We address a joint production and delivery scheduling problem in which a single vendor supplies goods to a single buyer over a finite horizon. Vendor’s production rate and buyer’s demand rate are dynamic and are known in advance. The objective is to determine a production/shipment schedule that minimizes the total cost incurred due to production setup, shipment, and inventory holding (both at vendor and buyer). We first develop an approach to solve the single-period problem with prescribed starting and ending inventory. We, then, embed this approach into a dynamic programming framework for the multi-period problem, and also propose two fast and effective heuristic methods. 5 - Optimizing the Pipeline Scheduling System for Fuels at ENAP Martin Quinteros, Empresa Nacional del Petroleo, San Jose de la Sierra 50 depto 1202, Lo Barnechea, Santiago, 7710088, Chile, martinq46@gmail.com Martin Quinteros, University of Chile, Santiago, Chile, martinq46@gmail.com, Andres P. Weintraub, Monique Guignard-Spielberg In the oil & gas industry the distribution of refined oil products is critical. This work addresses the problem of optimizing the schedule of a multi product pipeline that transports 6 products from the refinery to demand points. The size and contents of each batch injected should consider the arrival times at the demand points and volumes required. Having no physical separation between consecutive batches, in their contact surface they mix and these mixes are collected for reprocessing. In order to minimize the overall operating and reprocessing cost a MIP model decides the scheduling for the ENAP’s pipeline achieving successful economical and operational results for Chilean company. 6 - A Futuristic Logistics Service System using Reinforcement Learning and Real-time Route Scheduling Yuncheol Kang, Assistant Professor, Hongik University, T904 Wausanro-94, Mapo-gu, Seoul, 04066, Korea, Republic of, yckang@hongik.ac.kr, Seokgi Lee The purpose of this study is to develop a framework for a futuristic logistics service system in which large-scale, on-demand, real-time and just-in-time logistics services are required. For this, we integrate service request control planning using reinforcement learning, and real-time service scheduling algorithm using continuous variable feedback control. Additionally, this logistics service system aims at a green transportation paradigm by minimizing gas emissions of delivery vehicles. 352B Retail and Service Analytics Sponsored: Service Science Sponsored Session Chair: Paul R. Messinger, University of Alberta, Edmonton, AB, T6G 2R6, Canada, paul.messinger@ualberta.ca 1 - The Analytics of Product Return Episodes in Retailing Paul R. Messinger, University of Alberta, Faculty of Business, 3- 20e Faculty Of Business Bldg, Edmonton, AB, T6G 2R6, Canada, paul.messinger@ualberta.ca, Michele Samorani, Aydin Alptekinoglu We analyze product returns as part of a search process: Upon returning a product, customers may immediately purchase an alternative one, which they may later replace with another product, and so on, until they either ultimately keep their last purchase (Keep outcome) or not (No-keep outcome). We call such a sequence of transactions a product return episode. In this work, we study customer keep and return abuse behavior using episodic metrics. We show that analysis of product returns with episodic metrics provides insights that differ from, and go beyond, analyses with transactional metrics. 2 - Efficiency and Risk in Airport Security Processes – A Queueing Analysis Approach Mehmet Aydemir, Carnegie Mellon University, Pittsburgh, PA, United States, maydemir@andrew.cmu.edu, Alexandre Jacquillat As recently as last year, waiting times at security queues in airports hit record high of 3 hours, causing many flights to be missed. Due to budget constraints quick and safe response to this tumult was not possible for the authorities. In this study, we aim to look for design and operational improvements of airport security queues. WC37

516