Informs Annual Meeting Phoenix 2018

INFORMS Phoenix – 2018

TE28

2 - Using Simulation Modeling to Examine Policy Effects on the Workforce Outcomes of Women in Academic Science Julie A. Maurer, Lead Research Manager, The Ohio State University, Columbus, OH, 43210, United States Despite gains made over the past 20 years toward gender pay equity for female scientists working in academic research in the U.S., a persistent gap suggests that existing policies have not gone far enough. Insights into how the workforce structure, institutional policies and employer preferences interact to impact the career development of female scientists using ABM and SD modeling will be shared. n TE26 North Bldg 132A Information in Queueing Systems Sponsored: Service Science Sponsored Session Chair: Ricky Roet-Green, Simon Business School, University of Rochester, Rochester, NY, 14627, United States 1 - The Benefit and Cost of Skipping the Line Yang Li, Chinese University of Hong Kong, 12 Chak Cheung Street, Cheng Yu Tung Building, Hong Kong, Opher Baron, Xiaole Chen If you do not have time to wait in a long line to get your morning caffeine fix or to grab your lunch, now you can skip the line and order online. Thanks to the advancing IT technology, more and more restaurants, e.g., Starbucks and McDonald’s, are offering online ordering without customer physical presence in the service line. We study the impacts of this novel business model with both online and in-store customers waiting to be served. We find that although the provider enjoys a revenue increase, both online and in-store customers endure longer delays and the social welfare may suffer. 2 - Efficient Inaccuracy: User-generated Information Sharing in a Queue Jianfu Wang, Nanyang Business School, Nanyang Technological University, Block S3-B2C-85, 50 Nanyang Avenue, Singapore, 639798, Singapore, Ming Hu We study a service system which does not have the capability of monitoring and disclosing its real-time congestion level. However, the customers can observe and post their observations online, and future arrivals can take into account such shared information when deciding whether to go to the facility. We compare the user-generated information structure, which requires no costly investment, with full and no information structures. Perhaps surprisingly, we show that shared information always generates higher social welfare than no information and than full information when the offered load is high or the service is very popular. 3 - The Armchair Decision: To Travel to a Queue or Not Ricky Roet-Green, Simon Business School, University of Rochester, C3-345 Carol Simon Hall, Rochester, NY, 14627, United States, Refael Hassin The availability of queue-length online information affects the way we model service systems. Models which assume customers have full information about the queue length (i.e., observable queues), also assume that if the customer decides to join the queue, joining is instantaneous. But in real-life settings, it is more natural to assume that customers who learn about the service current queue length have to travel to the service, and while they are on their way, the queue length may change: customers may complete their service and leave, others may arrive and join the queue. Our paper investigates the question how does information affects customers’ decision to travel to the queue. n TE27 North Bldg 132B Mass Customization and Applications Sponsored: Manufacturing & Service Oper Mgmt/Supply Chain Sponsored Session Chair: Ali Fattahi, University of California-Los Angeles, Los Angeles, CA, 90095, United States Co-Chair: Reza Ahmadi 1 - Supply Chain Geography and Product Quality Robert Louis Bray, Kellogg School of Management, Northwestern University, 830 Hinman Ave., 2s, Evanston, IL, 60202, United States We study the effect of supply chain proximity on product quality by merging four independent data sources from the automotive industry. We estimate that increasing the distance between an upstream component factory and a downstream plant by an order of magnitude increases the component’s expected

defect rate by 3.9%. 2 - Procurement Contracting Under Product Recall Risk Lauren Xiaoyuan Lu, University of North Carolina at Chapel Hill - Kenan Flagler, Kenan-Flagler Business School, CB #3490, McColl Building 4701, Chapel Hill, NC, 27599, United States, Jayashankar M. Swaminathan, Yue Zhang, Gang Wang We consider a model in which a manufacturer outsources to a supplier the production of a component, which is subject to potential quality failure leading to a product recall. The manufacturer acts as the Stackelberg leader offering a recall cost sharing contract to the supplier. We analyze two settings: a pull system in which the supplier makes the quantity decision and a push system in which the manufacturer makes the quantity decision. We find that the manufacturer achieves a higher production quantity and induces a higher quality effort of the supplier in the push system than in the pull system. 3 - Mass Customization and the Parts Capacity Planning Problem Ali Fattahi, University of California-Los Angeles, Anderson School of Management, B501, Los Angeles, CA, 90095, United States, Sriram Dasu, Reza Ahmadi We study a new parts capacity planning problem motivated by a global auto manufacturer that offers 100-500 car options. The set of end-products (producible configurations) is in the order of 1025-1040. Since it is impossible to forecast the demand for producible configurations, firms forecast demand for options. Parts’ requirement cannot be directly determined based on options’ forecast since a large number of parts’ requirements (up to 60%) is based on the combinations of options selected. The problem of determining parts’ requirement is a large-scale NP-Hard problem. We develop an effective approach for solving large industrial instances and compare our approach to that of the current practice. n TE28 North Bldg 221A Logistics Contributed Session Chair: Yulan Bai, SMU, Dallas TX, 75205, United States 1 - A New Methodology Combining JIT with Group Technology to Optimize Order Fulfillment Process for Online Supermarket Minfang Huang, North China Electric Power University, 2 Beinong Road, Beijing, 102206, China, Yanxin Wang, Xiangpei Hu Aiming at the difficulty of order processing in multi-variety, small-batch, cross- warehousing and consolidation of online supermarkets, a pull order processing model combining JIT and group technology was proposed. We use the similarity principle of the group technology to establish the flow process path and refer to the free type assembly line to set the takt time for batch orders, in which the order item is pulled to the right position at right time. The model achieves the goal of the shortest time for order processing by reducing the idle time of picking, sorting, and packaging and the waiting time of the order items in buffers. 2 - Sequencing Triple-spreader Crane Operations: Mathematical Formulation and Heuristic Algorithm Shabnam Lashkari, PhD Candidate, University of Wisconsin- Milwaukee, Milwaukee, WI, 53202, United States, Matthew Petering, Yong Wu This paper investigates the problem of scheduling a triple-spreader (i.e. tandem lift) crane when lifts are subject to a weight limit. We formulate the problem as an integer linear program and develop a fast method for computing a lower bound on the optimal objective value. In addition, we devise a genetic algorithm that produces high quality solutions for small, medium, large, and very large problem instances. 3 - An Exact Algorithm for an Assembly Routing Problem Masoud Chitsaz, CIRRELT, Pavillon Andre-Aisenstadt, 2920 chemin de la Tour, Montreal, QC, H3T 1J4, Canada, Jean-François Cordeau, Raf Jans We consider an integrated planning problem that combines production, inventory and inbound transportation decisions. We provide a mixed integer programming formulation of the problem and propose several types of valid inequalities to strengthen the linear programming relaxation. We propose new algorithms to separate the subtour elimination constraints with fractional node visits. The inequalities and separation procedures are used in a branch-and-cut algorithm. Computational experiments on a large test bed show the performance of the valid inequalities as well as the separation procedures.

389