-
作者：Powell, WB; Marar, A; Gelfand, J; Bowers, S
作者单位：Princeton University; Princeton University
摘要：Online models for real-time operations planning face a host of implementation issues that do not a-rise in more strategic arenas. We use the seemingly simple problem of assigning drivers to loads in the truckload motor carrier industry as an instance to study the issues that arise in the process of implementing a real-time dispatch system. Although the project was moderately successful, our focus is not on documenting the benefits, but rather on summarizing the challenges that arose, The most ...
-
作者：Baker, SF; Morton, DP; Rosenthal, RE; Williams, LM
作者单位：United States Department of Defense; United States Air Force; United States Air Force Academy; University of Texas System; University of Texas Austin; United States Department of Defense; United States Navy; Naval Postgraduate School; United States Department of Defense; United States Navy; Naval Postgraduate School
摘要：We describe a large-scale linear programming model for optimizing strategic (intercontinental) airlift capability. The model routes cargo and passengers through a specified transportation network with a given fleet of aircraft subject to many physical and policy Constraints. The time-dynamic model captures a significant number of the important aspects of an airlift system in a large-scale military deployment, including aerial refueling, tactical (intracontinental) aircraft shuttles, and constr...
-
作者：Thomas, P; Teneketzis, D; Mackie-Mason, JK
作者单位：University of Michigan System; University of Michigan; University of Michigan System; University of Michigan; University of Michigan System; University of Michigan
摘要：We present an approach to the admission control and resource allocation problem in connection-oriented networks that offer multiple services to users. Users' preferences are summarized by means of their utility functions, and each user is allowed to request more than one type of service. Multiple types of resources are allocated at each link along the path of a connection. We assume that the relation between Quality of Service (QoS) and resource allocation is given, and we incorporate it as a ...
-
作者：Balakrishnan, A; Magnanti, TL; Sokol, JS; Wang, Y
作者单位：University of Texas System; University of Texas Austin; Massachusetts Institute of Technology (MIT); University System of Georgia; Georgia Institute of Technology
摘要：The network, restoration problem is a specialized capacitated network design problem requiring the installation of spare capacity to fully restore disrupted network flows if any edge in a telecommunications network fails. We present a new mixed-integer programming formulation for a line restoration version of the problem using a single type of capacitated facility. We examine two different models, for distinct and integrated spare-capacity systems, reflecting technologies used in synchronous t...
-
作者：Mulligan, AE; Ahlfeld, DP
作者单位：Woods Hole Oceanographic Institution; University of Massachusetts System; University of Massachusetts Amherst
摘要：A new interior-point algorithm for solving the groundwater-pollution-control design problem is presented. The algorithm requires that the objective function is differentiable in the interior region. Fur minimization problems with nonlinear constraint, and a concave objective function, the technique is shown to be similar to an active set gradient-projection method, where the tangent of the boundary between feasible and infeasible solutions is used to determine a search direction. In this new m...
-
作者：Post, T; Cherchye, L; Kuosmanen, T
作者单位：Erasmus University Rotterdam; Erasmus University Rotterdam - Excl Erasmus MC; KU Leuven
摘要：This paper develops a new nonparametric model for efficiency estimation. In contrast to Data Envelopment Analysis (DEA), it does not impose debatable production assumptions like free disposability and convexity, and it does not assume that the data are measured without error. The estimators are asymptotically unbiased and have an asymptotic variance that is comparable to that of stochastic frontier estimators (provided the latter use a correct specification of the functional form for the produ...
-
作者：Sherali, HD; Driscoll, PJ
作者单位：Virginia Polytechnic Institute & State University; United States Department of Defense; United States Army; United States Military Academy
摘要：This paper is concerned with applying the Reformulation-Linearization Technique (RLT) to derive tighter relaxations for the Asymmetric Traveling Salesman Problem (ATSP) formulation that is based on the Miller-Tucker-Zemlin (MTZ) subtour elimination constraints. The MTZ constraints yield a compact representation for the Traveling Salesman Problem (TSP), and their use is particularly attractive in various routing and scheduling contexts that have an embedded ATSP structure. However, it is well r...
-
作者：Klamroth, K; Wiecek, MM
作者单位：University of Erlangen Nuremberg; University of Copenhagen; Clemson University
摘要：The multiple objective median problem (MOMP) involves locating a new facility with respect to a given set of existing facilities so that a vector of performance criteria is optimized. A variation of this problem is obtained if the existing facilities are situated on two sides of a linear barrier, Such barriers, like rivers. highways, borders. or mountain ranges, are frequently encountered in practice, In this paper, theory of an MOMP with line barriers is developed. As this problem is nonconve...
-
作者：Rajaram, K; Karmarkar, US
作者单位：University of California System; University of California Los Angeles
摘要：We formulate the dynamic product-cycling problem with yield uncertainty and buffer limits to determine how much product to produce at what time to minimize total expected switching, production, inventory storage. and backorder costs, A restricted Lagrangian technique is used to develop a lower bound and a model-based Lagrangian heuristic. We also develop an operational heuristic and a greedy heuristic. The operational heuristic has been implemented at seven refineries at Cerestar, Europe's lea...
-
作者：Dai, JG; Weiss, G
作者单位：University System of Georgia; Georgia Institute of Technology; University System of Georgia; Georgia Institute of Technology; University of Haifa
摘要：We describe a simple online heuristic for scheduling job shops, We assume there is a fixed set of routes for the jobs, and many jobs, say N, on each route. The heuristic uses safety stocks and keeps the bottleneck machine buoy at almost all times, while the other machines are paced by the bottleneck machine. We perforin a probabilistic analysis of the heuristic, under some assumptions on the distributions, of the processing times. We show that our heuristic produces makespan, which exceeds the...
