-
作者：Kalagnanam, JR; Dawande, MW; Trumbo, M; Lee, HS
摘要：We introduce a new problem that arises from operations planning in the process industry, This problem involves matching an order book against surplus inventory before production planning. It can be formulated by generalizing the multiple knapsack problem along three dimensions: (i) adding assignment restrictions on items that can be assigned to a knapsack, (ii) adding a new attribute (called color in this paper) to an item and then adding the associated color constraints that restrict the numb...
-
作者：Dawson, CS; McCallum, CJ; Murphy, RB; Wolman, E
作者单位：George Mason University
摘要：This historical account of operations research at Bell Laboratories was drafted in the late 1970s when the authors were part of the Operations Research Center within Bell Laboratories at AT&T; it has not previously appeared in the open literature. We have added a few references to later publications that describe particular aspects of the period covered. Discussions of technological practices and organizational arrangements expressed in the present tense represent a viewpoint of about 1980, be...
-
作者：Ormerod, R; Delibassi, P; Morris, C
作者单位：University of Warwick
摘要：Reisman and Kirschnick (1995) have defined seven process categories among OR/MS research strategies and analysed the contents of U.S. flagship OR/MS journals in 1992 to examine how often OR/MS workers use these processes. We have applied their method of analysis to the 1994 contents of the U.K. flagship journal, the Journal of the Operational Research Society. As well as providing some insight into the nature of OR/MS research in the United Kingdom, the results enable a comparison to be made w...
-
作者：Courcoubetis, C; Kelly, F; Weber, R
作者单位：University of Cambridge
摘要：We study usage-sensitive charging schemes for broadband communications networks. We argue that a connection's effective bandwidth is a good proxy for the quantity of network resource that the connection consumes and can be the basis for a usage charge. The determination of effective bandwidth can be problematic, however, since it involves the moment-generating function of the cell arrival process, which may be difficult to modeler measure. This article describes methods of computing usage char...
-
作者：Zenios, SAA; Chertow, GM; Wein, LM
作者单位：Stanford University; University of California System; University of California San Francisco; Massachusetts Institute of Technology (MIT)
摘要：The crux of the kidney allocation problem is the trade-off between clinical efficiency and equity. We consider a dynamic resource allocation problem with the tri-criteria objective of maximizing the quality-adjusted life expectancy of transplant candidates (clinical efficiency) and minimizing two measures of inequity: a linear function of the likelihood of transplantation of the various types of patients, and a quadratic function that quantities the differences in mean waiting times across pat...
-
作者：Bramel, J; Goyal, S; Zipkin, P
作者单位：Columbia University; Duke University
摘要：We investigate multiproduct, multilocation production root distribution networks with deterministic, stationary demands. Most research on such systems assumes zero leadtimes. Methods using fixed reorder intervals that are power-of-two multiples of a base planning period have proved to be very successful for such systems. The same methods apply to networks with positive leadtimes, provided the leadtimes are balanced in a specific sense. We explore networks with general, unbalanced leadtimes. A ...
-
作者：Hoffman, R; Ball, MO
作者单位：University System of Maryland; University of Maryland College Park; University System of Maryland; University of Maryland College Park
摘要：Both the single-airport ground-holding problem (GH) and the multi-airport ground-holding problem can be extended by the addition of banking constraints to accommodate the hubbing operations of major airlines. These constraints enforce the desire of airlines to land certain groups of flights, called banks, within fixed time windows, thus preventing the propagation of delays throughout their entire operation. GH can be formulated as a transportation problem and readily solved. But in the presenc...
-
作者：Amiouny, SV; Bartholdi, JJ; Vate, JH
作者单位：University System of Georgia; Georgia Institute of Technology
摘要：We develop heuristics for problem that models the static balancing of turbine fans: load point masses at regularly spaced positions on the periphery of a circle so that the residual unbalance about the center-which corresponds to the axis of rotation of the fan-is as small as possible. We give worst-case guarantees for our heuristics in terms of residual unbalance. For the case of an even number of blades, we show that one of our heuristics provides the same worst-case guarantee (with respect ...
-
作者：Barnhart, C; Jin, H; Vance, PH
作者单位：Massachusetts Institute of Technology (MIT); Emory University
摘要：In this study, we formulate the railroad blocking problems as a network design problem with maximum degree and flow constraints on the nodes and propose a heuristic Lagrangian relaxation approach to solve the problem. The new approach decomposes the complicated mixed integer programming problem into two simple subproblems so that the storage requirement and computational effort are greatly reduced. A set of inequalities are added to one subproblem to tighten the lower bounds and facilitate gen...
-
作者：Xia, CH; Shanthikumar, JG; Glynn, PW
作者单位：International Business Machines (IBM); IBM USA; University of California System; University of California Berkeley; University of California System; University of California Berkeley; Stanford University
摘要：Consider a flow shop with M machines in series, through which a set of jobs are to be processed. All jobs have the same routing, and they have to be processed in the same order on each of the machines. The objective is to determine such an order of the jobs, often referred to as a permutation schedule, so as to minimize the total completion time of all jobs on the final machine. We show that when the processing times are statistically exchangeable across machines and independent across jobs, t...
