Informs Annual Meeting 2017

MB45

INFORMS Houston – 2017

MB46

3 - Characterizing Customer Choice from Sales Transaction Data for Introducing Niche Products Elham Nosratmirshekarlou, Wayne State University, 2200 Fuller Ct, Apt 809B, Ann Arbor, MI, 48105, United States, fo7573@wayne.edu, Ratna Chinnam, Evrim Dalikran, Satyendra Rana We exploit promising non-parametric customer choice modeling methods to identify major customer segments and subsequently rely on parametric models for identifying demand for promising niche products within segments. 4 - When Marketing Strategy Meets Capital Markets: Marketing Spending and Market Feedback from Securities Analysts Jacob Do-Hyung Cha, Seoul National University, Room 313, 58-dong, Seoul National University, Gwanak-gu, 150-742, Korea, Republic of, research.dohyung@gmail.com, Hye-Jin Cho This study examines the role of securities analysts in the context of marketing intensity, a largely neglected issue in the extant literature. The results of a large- scale, cross-industry research suggest that capital markets’ feedback - proxied by the earnings forecasts of financial analysts - leads to reduce marketing intensity. We propose that top managers tend to cut marketing spending when they are under pressure to meet analysts’ performance targets. We further argue that analyst coverage can serve as an external monitoring mechanism to help contain this agency problem. We test these hypotheses with data from a sample of U.S. manufacturing firms during the period of 1979 to 2014. 360D WORMS: Female Professional Development Sponsored: Women in OR, MS Sponsored Session Chair: Dorothee Honhon, University of Texas at Dallas, Richardson, TX, 75080, United States, dorothee.honhon@utdallas.edu 1 - Worms Panel Session on Professional Development for Women in OR/MS Dorothee Honhon, University of Texas at Dallas, 800 West Campbell Road, SM30, Richardson, TX, 75080, United States, dorothee.honhon@utdallas.edu In this panel session, successful male and female academics will discuss the topic of professional development for women in the OR/MS world. In particular they will address questions such as how women can make themselves heard in meetings, how to negotiate and apply for promotion, how to select the best service jobs and decline excessive requests, how to dress to succeed, etc. Panelists will also discuss what steps can be taken to make the OR/MS academic field more women-friendly and fair. Bring a male colleague along to attend the session and both of you get a free WORMS coffee mug! 2 - Panelist Rachel Rong Chen, University of California-Davis, 3208 Gallagher Hall, One Shields Avenue, Davis, CA, 95616, United States, rachen@ucdavis.edu 3 - Panelist Tava Olsen, University of Auckland, ISOM, Business School, University of Auckland, Auckland, 1142, New Zealand, t.olsen@auckland.ac.nz 4 - Panelist Aleda Roth, Clemson University, 606 Cross Creek Drive, Seneca, SC, 29678, United States, aroth@clemson.edu 5 - Panelist Rohit Verma, Cornell University, 338 Statler Hall, Ithaca, NY, 14853, United States, rv54@cornell.edu 6 - Panelist Vidya Mani, Pennsylvania State University, The Smeal College of Business, The Pennsylvania State University, State College, PA, 16802, United States, vmani@psu.edu 7 - Panelist Eric Johnson, Eric.Johnson@owen.vanderbilt.edu 8 - Panelist Anahita Khojandi, University of Tennessee, Knoxville, TN, United States, anahitakhojandi@gmail.com MB45

360E Scheduling VII Invited: Project Management and Scheduling Invited Session Chair: Alessandro Agnetis, Universita Di Siena, Siena, 53100, Italy, agnetis@dii.unisi.it Co-Chair: Federico Della Croce, Politecnico di Torino, Torino, 10129, Italy, federico.dellacroce@polito.it 1 - Exact Algorithms for the Equitable Traveling Salesman Problem Frits C.r. Spieksma, Catholic University of Leuven, Brussels, Belgium, frits.spieksma@kuleuven.be Given a weighted graph G = (V, E) , the Equitable Traveling Salesman Problem (ETSP) asks for two perfect matchings in G such that (1) the two matchings together form a Hamiltonian cycle in G and (2) the absolute difference in costs between the two matchings is minimized. The problem is shown to be NP-Hard, even when the graph G is complete. We present two integer programming models to solve the ETSP problem and compare the strength of these formulations. One model is solved through branch-and-cut, whereas the other model is solved through a branch-and-price framework. We conduct computational experiments on different types of instances, often derived from the TSPLib, and we report our findings. 2 - Scheduling with Variable Time-of-use Costs Bo Chen, University of Warwick, Coventry, United Kingdom, Bo.Chen@wbs.ac.uk We address a class of problems of scheduling a set of independent jobs onto a single machine that charges each job for its processing under variable time-of-use (ToU) tariffs. We consider a range of regular scheduling criteria as constraints with the objective of minimizing the total ToU cost. For each of the problems in the class, we establish its computational tractability. For those tractable we provide an efficient algorithm, while for those intractable we provide a pseudo-polynomial- Federico Della Croce, Politecnico di Torino, Corso Duca degli Abruzzi 24, Torino, 10129, Italy, federico.dellacroce@polito.it, Rosario Scatamacchia Consider the well known LPT rule for scheduling jobs on identical parallel machines. It requires to sort the jobs in non-ascending order and then to assign one job at a time to the machine whose load is smallest so far. We consider an alternative approach that splits the sorted jobset in tuples of m consecutive jobs (1,...,m - m+1,...,2m etc.) and sorts the tuples in nonincreasing order of the difference (slack) between the largest job and the smallest job of the tuple. Then a list scheduling is applied to the set of sorted tuples. This approach strongly outperforms LPT on benchmark literature instances. The approximation ratio of a procedure combining LPT and the proposed approach is also discussed. 4 - The Price of Fairness in a Two-agent Single-machine Scheduling Problem Alessandro Agnetis, Universita Di Siena, Dipartimento Ingegneria, Dell’Informazione Universita Di Siena, Siena, 53100, Italy, agnetis@dii.unisi.it In this talk we investigate the concept of price of fairness applied to scheduling problems. We consider two agents (players), each having a set of jobs to perform, that compete for using a single machine. We investigate the situation in which one agent aims at minimizing total completion time of his/her jobs, while the other is concerned with minimizing tardiness with respect to a common due date. We propose a definition of utility and discuss both max-min and proportionally fair solutions, giving bounds on the price of fairness. time algorithm or a polynomial-time approximation scheme. 3 - LPT Rule for Identical Parallel Machines Revisited

180