-
作者：Lin, Kyle Y.; Atkinson, Michael R.; Chung, Timothy H.; Glazebrook, Kevin D.
作者单位：United States Department of Defense; United States Navy; Naval Postgraduate School; United States Department of Defense; United States Navy; Naval Postgraduate School; Lancaster University
摘要：This paper presents a patrol problem, where a patroller traverses a graph through edges to detect potential attacks at nodes. To design a patrol policy, the patroller needs to take into account not only the graph structure, but also the different attack time distributions, as well as different costs incurred due to successful attacks, at different nodes. We consider both random attackers and strategic attackers. A random attacker chooses which node to attack according to a probability distribu...
-
作者：Kong, Qingxia; Lee, Chung-Yee; Teo, Chung-Piaw; Zheng, Zhichao
作者单位：Universidad Adolfo Ibanez; Hong Kong University of Science & Technology; National University of Singapore
摘要：In this paper we investigate a stochastic appointment-scheduling problem in an outpatient clinic with a single doctor. The number of patients and their sequence of arrivals are fixed, and the scheduling problem is to determine an appointment time for each patient. The service durations of the patients are stochastic, and only the mean and covariance estimates are known. We do not assume any exact distributional form of the service durations, and we solve for distributionally robust schedules t...
-
作者：Alpern, Steve; Lidbetter, Thomas
作者单位：University of Warwick; University of London; London School Economics & Political Science
摘要：We show how to optimize the search for a hidden object, terrorist, or simply Hider, located at a point H according to a known or unknown distribution v on a rooted network Q. We modify the traditional pathwise search approach to a more general notion of expanding search. When the Hider is restricted to the nodes of Q, an expanding search S consists of an ordering (a(1), a(2), ... ) of the arcs of a spanning subtree such that the root node is in a(1) and every arc a(i) is adjacent to a previous...
-
作者：Li, Hongmin; Zhang, Hao; Fine, Charles H.
作者单位：Arizona State University; Arizona State University-Tempe; University of British Columbia; Massachusetts Institute of Technology (MIT)
摘要：This paper studies a repeated game between a manufacturer and two competing suppliers with imperfect monitoring. We present a principal-agent model for managing long-term supplier relationships using a unique form of measurement and incentive scheme. We measure a supplier's overall performance with a rating equivalent to its continuation Utility (the expected total discounted utility of its future payoffs), and incentivize supplier effort with larger allocations of future business. We obtain t...
-
作者：Bartolini, Enrico; Cordeau, Jean-Francois; Laporte, Gilbert
作者单位：Universite de Montreal; HEC Montreal; Universite de Montreal
摘要：We study an extension of the capacitated arc routing problem (CARP) called the capacitated arc routing problem with deadheading demand (CARPDD). This problem extends the classical capacitated arc routing problem by introducing an additional capacity consumption incurred by a vehicle deadheading an edge. It can be used, e.g., to model time or distance constrained arc routing problems. We show that the strongest CARP lower bounds can be weak when directly applied to the CARPDD, and we introduce ...
-
作者：Luo, Jun; Zhang, Jiheng
作者单位：Hong Kong University of Science & Technology
摘要：In addition to traditional call centers, many companies have started building a new kind of customer contact center, in which agents communicate with customers via instant messaging (IM) over the Internet rather than phone calls. A distinctive feature of the service centers based on IM is that one agent can serve multiple customers in parallel. We choose to model such a center as a server pool consisting of many limited processor-sharing servers. We characterize the underlying stochastic proce...
-
作者：Ahn, Hyun-Soo; Lewis, Mark E.
作者单位：University of Michigan System; University of Michigan; Cornell University
摘要：We consider the question of how routing and allocation can be coordinated to meet the challenge of demand variability in a parallel queueing system serving two types of customers. A decision maker decides whether to keep customers at the station at which they arrived or to reroute them to the other station. At the same time, the decision maker has two servers and must decide where to allocate their effort. We analyze this joint decision-making scenario with both routing and station-dependent h...
-
作者：Abbas, Ali E.
作者单位：University of Illinois System; University of Illinois Urbana-Champaign
摘要：The construction of a multiattribute utility function is an important step in decision analysis and can be a challenging task unless some decomposition of the utility function is performed. When every attribute is utility independent of its complement, the utility elicitation task is significantly simplified because the functional form of the utility function requires only one conditional utility function for each attribute, and some normalizing constants. When utility independence conditions ...
-
作者：Wang, Chen; Bier, Vicki M.
作者单位：University of Wisconsin System; University of Wisconsin Madison
摘要：We introduce a simple elicitation process where subject-matter experts provide only ordinal judgments of the attractiveness of potential targets, and the adversary utility of each target is assumed to involve multiple attributes. Probability distributions over the various attribute weights are then mathematically derived (using either probabilistic inversion or Bayesian density estimation). This elicitation process reduces the burden of time-consuming orientation and training in traditional me...
-
作者：Mittal, Shashi; Schulz, Andreas S.
作者单位：Amazon.com; Massachusetts Institute of Technology (MIT); Massachusetts Institute of Technology (MIT)
摘要：In this paper, we present a general framework for designing approximation schemes for combinatorial optimization problems in which the objective function is a combination of more than one function. Examples of such problems include those in which the objective function is a product or ratio of two linear functions, parallel machine scheduling problems with the makespan objective, robust versions of weighted multiobjective optimization problems, and assortment optimization problems with logit c...
