Informs Annual Meeting Phoenix 2018

INFORMS Phoenix – 2018

WC53

environment (FFSSE). The process analyzed in this research is the rolling, welding and assembling of steel sheets required to manufacture the four sections of a wind mill tower. In this process, the utilization of the welding workstations is the most important measure of performance while keeping the throughput above a lower limit defined by the management of the company. Computational experiments were performed in order to define the group of best dispatching rules that maximizes the resources utilization. n WC52 North Bldg 231C Practice- Transportation Freight 1 Contributed Session Chair: Juvvala Rambabur, Indian Institute of Technology Kharagpur, Kharagpur, India 1 - Intermodal Freight Network Design Problem: Consideration of the Product Perishability Maxim A. Dulebenets, Florida A&M University-Florida State University, Tallahassee, FL, 32311, United States, Eren Erman Ozguven, Ren Moses, Thobias Sando, Mehmet Ulak A significant amount of products, transported via the existing freight transportation networks, are perishable in their nature. This study presents an optimization model for design of freight transportation networks with perishable products, aiming to minimize the total transportation cost, including the cost associated with decay of perishable products. A set of piecewise functions are adopted to linearize the original model. The linearized model is solved using CPLEX. Numerical experiments are performed for the seafood perishable products to draw a number of important managerial insights. 2 - Recovery Optimization for Truckload Freight: Evidence from Practice Roger D. Lederman, Amazon, Seattle, WA, United States Our network of truckload freight carriers is critical to the promise of fast and reliable delivery. To achieve high standards of customer service, the network must respond efficiently to both internal and external disruptions. The talk will discuss our work in recovery optimization, which optimally allocates available trucks to maintain service, while minimizing the cost of disruption. Our solution is forward-looking, including proactive mechanisms to keep supply and demand in balance. The tools have improved network performance in the form of lower cancellation rates and decreased reliance on costly spot market capacity. 3 - Investigating the Waiting Time & Carbon Emission Reduction Potential of the Urban Consolidation Centre Juvvala Rambabu, Research Scholar, Indian Institute of Technology Kharagpur, ND 105 VSRC IIT Kharagpur, 721302, India, S. P. Sarmah The purpose of this study is to examine the feasibility of the Urban Consolidation Centre (UCC) as a measure to minimize the negative impacts of freight transportation in the city such as congestion and carbon emission. We have employed the established meta-heuristic technique to the NP-hard natureof the mathematical model formulation n WC53 North Bldg 232A Behavioral Operations I Contributed Session Chair: Samuel Nathan Kirshner, UNSW Business School, Level 2, West Wing, Quadrangle Building, Sydney, 2052, Australia 1 - Social Stress and the Newsvendor Problem George Kurian, The University of Texas at Arlington, Arlington, TX, 76013, United States This paper investigates the effect of social stress on individual performances in the newsvendor problem. From our experiments and analyses, we did not find sufficient evidence for the impact of social stress on performance. However, subjects showed less demand chasing and better learning under social stress. The results show that not all types of stress are detrimental. 2 - An Experimental Study: Does the Influence of Leaderboard and Dynamic Ranking on Performance Depend Upon Task Type? Sina Zare, University of Texas-Arlington, Arlington, TX, 76013, United States, Kay-Yut Chen, Sridhar P. Nerur We investigated the effect of Leaderboard and dynamic ranking on the decision makers’ performance in two different contest games. The first experiment is a Newsvendor task which requires subjects’ cognitive skills to perform well in the experiment. In the second experiment, subjects are engaged in a real effort task where we study how their level of effort and efficiency change upon cost setting.

n WC51 North Bldg 231B Practice-Scheduling Contributed Session Chair: Leonardo Bedoya-Valencia, Colorado State University-Pueblo, 4702 Desert Candle Drive, Pueblo, CO, 81001, United States 1 - A New Extension of the MSRCPSP in a Resource Reallocation Context Zhentao Hu, Huazhong University of Science & Technology, School of Management, HUST, Hongshan District, Wuhan City, Wuhan, 430074, China, Nanfang Cui In this research, we proposed a new strategy to optimize MSRCPSP, which expands the problem into a new one named RP- MSRCPSP. For solving the new problem, a heuristic, which is a PSS procedure consisting of activity priority rule, dynamic weight-based resource priority rule, Hungarian method and 0- 1programming, is developed. The results of experiment on 1440 instances show that the new strategy is effective and the heuristic is efficient and robust in solving both the new and the previous scheduling problems. 2 - Aircraft Maintenance Planning: Moving A-check Tasks to Line Maintenance Qichen Deng, PhD Student, Delft University of Technology, Kluyverweg 1, Delft, 2629 HS, Netherlands, Bruno F. Santos, Daniel Coolen In this study, we present a two-stage optimization model to minimize the total delay of maintenance tasks. It is for the first time to propose to move the A-check tasks from hangar to line maintenance. The model of first-stage is task planning, which groups the A-check tasks into packages and shifts them to line maintenance. The model of second-stage is task scheduling. It minimizes the total amount of delay given a task package. The proposed model is evaluated on a fleet of 30 aircraft. The results show that by task planning and scheduling, it can save up to 18% of aircraft downtime per A-check. Allowing performing tasks 4-14 days earlier than the desired dates can reduce the total delay of tasks up to 66%. 3 - Stochastic Single-machine Scheduling with Learning Haitao Li, Associate Professor, Univ. of Missouri-St Louis, College of Business Administration, 208 Express Script Hall, St Louis, MO, 63121-4400, United States Learning is ubiquitous in the modern scheduling environment. While deterministic scheduling with known processing time and learning rate have been extensively studied, limited work exists to address the problems with both learning effect and uncertainty. In this talk, I introduce the single-machine scheduling problem with random nominal processing time and/or random job- based learning rate with both theoretical and computational results. 4 - A Sequential Stochastic Mixed Integer Programming Model for Tactical Master Surgery Scheduling Ashwani Kumar, PhD Candidate, The University of Melbourne, Peter Hall Building, Parkville Campus, Melbourne, 3010, Australia, Alysson M. Costa, Mark Fackrell, Peter G. Taylor In this talk, we present a MIP model to optimise master surgery schedule (MSS) under downstream capacity constraints. We optimised the process over several scheduling periods, and we used various scenario realisations to model the uncertainty. Our model had novalty that it used scenarios in chronologically sequential manner, not parallel. We positioned patients randomly in a queue and constrained the model to schedule patients in queuing order. This simple approach enhanced the model’s non-anticipative feature. Finally, we developed robust MSSs to maximise throughput while keeping cancellations within limits. The simulation results indicated that the schedules obtained were promising. 5 - Truck Driver Friendly Scheduling Problem a Constraint Programming Approach Fereydoun Adbesh, J.B. Hunt Transport Inc, 615 J. B. Hunt Corporate Dr, Lowell, AR, 72745, United States, Brain Moore, Douglas Mettenburg As a transportation company, development of quality work schedules is critical to the retention of drivers. Feasible driver schedules must strictly adhere to delivery appointments and Department of Transportation rules, while also considering soft constraints, such as schedules that start at roughly the same time each day. Several commercial software packages address the former but neglect important human factors. A constraint programming approach is developed to minimize the number of total drivers while increasing the driver-friendliness of the solution. The performance of the model is compared with results from a commercially available routing software over a set of real-world problems. 6 - Developing Dispatching Rules for a Flexible Flow Shop Scheduling Environment at a Wind Mill Tower Assembly Facility Leonardo Bedoya-Valencia, Colorado State University-Pueblo, 4702 Desert Candle Drive, Pueblo, CO, 81001, United States, Micah Mitchell This research work proposes the developing of a simulation model used to evaluate different dispatching rules in a multi-stage flexible flow shop scheduling

487