-
作者：Baldacci, Roberto; Bartolini, Enrico; Mingozzi, Aristide; Valletta, Andrea
作者单位：University of Bologna; University of Bologna; University of Bologna
摘要：This paper presents an exact algorithm for solving strategic and tactical multiperiod vehicle routing problems that can be modeled as period vehicle routing problems (PVRPs). The PVRP is defined on a time horizon of several days and consists of assigning appropriate combinations of delivery to customers and designing a set of delivery routes for every day of the planning period. The objective is to service all customers assigned to each day minimizing the overall routing cost. This paper descr...
-
作者：Jiang, Houyuan; Netessine, Serguei; Savin, Sergei
作者单位：University of Cambridge; INSEAD Business School; University of Pennsylvania
摘要：We generalize analysis of competition among newsvendors to a setting in which competitors possess asymmetric information about future demand realizations, and this information is limited to knowledge of the support of demand distribution. In such a setting, traditional expectation-based optimization criteria are not adequate, and therefore we focus on the alternative criterion used in the robust optimization literature: the absolute regret minimization. We show existence and derive closed-form...
-
作者：Koeppe, Matthias; Ryan, Christopher Thomas; Queyranne, Maurice
作者单位：University of California System; University of California Davis; University of Chicago; University of British Columbia
摘要：We explore the computational complexity of computing pure Nash equilibria for a new class of strategic games called integer programming games, with differences of piecewise-linear convex functions as payoffs. Integer programming games are games where players' action sets are integer points inside of polytopes. Using recent results from the study of short rational generating functions for encoding sets of integer points pioneered by Alexander Barvinok, we present efficient algorithms for enumer...
-
作者：Koole, Ger; Pot, Auke
作者单位：Vrije Universiteit Amsterdam
摘要：We consider an inbound call center with a fixed reward per call and communication and agent costs. By controlling the number of lines and the number of agents, we can maximize the profit. Abandonments are included in our performance model. Monotonicity results for the maximization problem are obtained, which lead to an efficient optimization procedure. We give a counterexample to the concavity in the number of agents, which is equivalent to saying that the law of diminishing returns does not h...
-
作者：Perry, Ohad; Whitt, Ward
作者单位：Northwestern University; Columbia University
摘要：In a recent paper we considered two networked service systems, each having its own customers and designated service pool with many agents, where all agents are able to serve the other customers, although they may do so inefficiently. Usually the agents should serve only their own customers, but we want an automatic control that activates serving some of the other customers when an unexpected overload occurs. Assuming that the identity of the class that will experience the overload or the timin...
-
作者：Farias, Vivek F.; Madan, Ritesh
作者单位：Massachusetts Institute of Technology (MIT); Qualcomm
摘要：This paper considers the multiarmed bandit problem with multiple simultaneous arm pulls and the additional restriction that we do not allow recourse to arms that were pulled at some point in the past but then discarded. This additional restriction is highly desirable from an operational perspective, and we refer to this problem as the irrevocable multiarmed bandit problem. We observe that natural modifications to well-known heuristics for multiarmed bandit problems that satisfy this irrevocabi...
-
作者：Rajapakshe, Tharanga; Dawande, Milind; Sriskandarajah, Chelliah
作者单位：University of Texas System; University of Texas Dallas
摘要：Although the impact of layout on the productivity of manufacturing systems is well recognized, a quantification of this impact is an issue that is often ignored or crudely approximated in practice. When evaluating competing layouts for a manufacturing system, the trade-off between their relative benefits and their relative costs underlines the need for a reasonably accurate comparison of the productivity offered by these potential layouts. In this paper, we argue for this approach by comparing...
-
作者：Xu, Yanyi; Bisi, Arnab; Dada, Maqbool
作者单位：Shanghai University; Purdue University System; Purdue University; Johns Hopkins University
摘要：We consider a system in which an order is placed every T periods to bring the inventory position up to the base stock S. We accept demand until the inventory position reaches a sales rejection threshold M. Our objective is to find the optimal values of S and M that minimize the long-run average cost per period. We establish the stationary distribution of our system and develop structural properties of the optimal solution that facilitate computation. In particular, we show that in an optimal s...
-
作者：Bertsimas, Dimitris; Farias, Vivek F.; Trichakis, Nikolaos
作者单位：Massachusetts Institute of Technology (MIT)
摘要：In this paper we study resource allocation problems that involve multiple self-interested parties or players and a central decision maker. We introduce and study the price of fairness, which is the relative system efficiency loss under a fair allocation assuming that a fully efficient allocation is one that maximizes the sum of player utilities. We focus on two well-accepted, axiomatically justified notions of fairness, viz., proportional fairness and max-min fairness. For these notions we pro...
-
作者：Chen, Jie; Jackson, Peter L.; Muckstadt, John A.
作者单位：Cornell University
摘要：We investigate the (S - 1, S) inventory policy under stuttering Poisson demand and generally distributed lead time when the excess demand is lost. We correct results presented in Feeney and Sherbrooke's seminal paper [Feeney, G. J., C. C. Sherbrooke. 1966. The (S - 1, S) inventory policy under compound Poisson demand. Management Sci. 12(5) 391-411] and note that the stationary distribution of units on order for the general compound Poisson demand case is still an open question.
