-
作者：INMAN, RR; JONES, PC
作者单位：Northwestern University
摘要：In some flexible manufacturing systems, tool magazine capacity naturally divides parts into families so that substantial setups occur only when switching production between families. For this situation (positive setup times and costs only between families), we show that the production planning problem decomposes into two simpler problems: an aggregate scheduling problem, and a disaggregation. First, we derive a disaggreption that determines the optimal intrafamily product schedules correspondi...
-
作者：MURPHY, FH
摘要：While building complex models is an important part of operations research practice, OR workers have focused too often on modeling's technical aspects instead of making the models manageable, that is, designing them around the ways people will operate them. The issues raised for complex models are different from those most widely discussed for decision support systems because the focus is on models that require a staff to maintain and operate them and on how the staff functions. Operations mana...
-
作者：FAALAND, B; SCHMITT, T
摘要：Many manufacturing firms that use Material Requirements Planning (MRP) cannot deliver products on schedule and within budget. Faced with bewildering bottlenecks, erratic process flows. and unrealistic due dates, they are unable to develop accurate schedules for their raw material acquisitions, workforce, and equipment. Their MRP plans must be translated into a workable schedule, one which determines when individual tasks will be performed by workers at work centers. There is a clear need for s...
-
作者：FRANZ, LS; MILLER, JL
作者单位：Clemson University; Clemson University
摘要：The resident scheduling problem is a specific case of the multiperiod staff assignment problem where individuals are assigned to a variety of tasks over multiple time periods. As in many staffing and training situations, numerous limitations and requirements may be placed on those assignments. This paper presents a procedure for addressing two major problems inherent in the determination of a solution to this type of problem: infeasibilities that naturally occur in the scheduling environment b...
-
作者：SMITH, JE; HOLTZMAN, S; MATHESON, JE
作者单位：Stanford University
摘要：An influence diagram is a graphical representation of a decision problem that is at once a formal description of a decision problem that can be treated by computers and a representation that is easily understood by decision makers who may be unskilled in the art of complex probabilistic modeling. The power of an influence diagram, both as an analysis tool and a communication tool, lies in its ability to concisely summarize the structure of a decision problem. However, when confronted with high...
-
作者：WOODBURY, MA; MANTON, KG; VERTREES, JC
作者单位：Duke University
摘要：This paper presents a quadratic programming model for allocating a global budget to individual hospitals. In the model, allocation weights are estimated for Diagnosis Related Groups (DRGs) which reflect the average historical costs of treating an additional case in each of nine DRG systems. The model is illustrated using data from the Department of Defense (DoD). Allocated budgets and DoD specific DRG marginal cost weights are estimated using information on three factors; the facility designat...
-
作者：KALBAUGH, DV
摘要：This paper considers rational methods for the design of search densities when the intended target is stationary among stationary, Poisson-distributed false contacts. Attention is restricted to situations in which the searcher must immediately decide, based on sensed information, whether a contact is the intended target and, if the answer is yes, end the search and commit to the contact. Discrimination of false contact from target is modeled as reliable only with given probabilities. We seek to...
-
作者：NIELSEN, SS; ZENIOS, SA
作者单位：University of Pennsylvania
摘要：We develop an algorithm for solving nonlinear, two-stage stochastic problems with netWork recourse. The algorithm is based on the framework of row-action methods. The problem is formulated by replicating the first-stage variables and then adding nonanticipativity side constraints. A series of (independent) deterministic network problems are solved at each step of the algorithm, followed by an iterative step over the nonanticipativity constraints. The solution point of the iterates over the non...
-
作者：ORLIN, JB
摘要：In this paper, we present a new strongly polynomial time algorithm for the minimum cost flow problem, based on a refinement of the Edmonds-Karp scaling technique. Our algorithm solves the uncapacitated minimum cost flow problem as a sequence of O(n log n) shortest path problems on networks with n nodes and m arcs and runs in O(n log n (m + n log n)) time. Using a standard transformation, this approach yields an O(m log n (m + n log n)) algorithm for the capacitated minimum cost flow problem. T...
-
作者：SONG, JS; ZIPKIN, P
作者单位：Columbia University
摘要：We present an inventory model, where the demand rate varies with an underlying state-of-the-world variable. This variable can represent economic fluctuations, or stages in the product life-cycle, for example. We derive some basic characteristics of optimal policies and develop algorithms for computing them. In addition, we show that certain monotonicity patterns in the problem data are reflected in the optimal policies.
