2期

最新文章

• Safe at home? An experiment in domestic airline security AI翻译
  作者：Barnett, A; Shumsky, R; Hansen, M; Odoni, A; Gosling, G
  作者单位：Massachusetts Institute of Technology (MIT); University of Rochester; University of California System; University of California Berkeley; Massachusetts Institute of Technology (MIT)
  摘要：The paper describes a scientific experiment about a contentious policy issue: What costs and disruptions might arise if U.S. domestic airlines adopted positive passenger bag-match (PPBM) an antiterrorist measure aimed at preventing baggage unaccompanied by passengers from traveling in aircraft luggage compartments? The heart of the effort was a two-week live test of domestic bag-match that involved I I airlines, 8,000 Eights, and nearly 750,000 passengers. working with the Federal Aviation Adm...
• Capital budgeting under uncertainty - An integrated approach using contingent claims analysis and integer programming AI翻译
  作者：Meier, H; Christofides, N; Salkin, G
  作者单位：University of Bonn; Imperial College London
  摘要：Recently the application of contingent claims analysis and dynamic programming to project evaluation has attracted a let of attention. These techniques are required, for example! if the value of a project develops stochastically over time and the decision to invest into this project can be postponed. Yet. so far there are no considerations regarding how this perception of projects reflects on a capital budgeting situation. We propose two approaches that integrate these methods with traditional...
• Octane: A new heuristic for pure 0-1 programs AI翻译
  作者：Balas, E; Ceria, S; Dawande, M; Margot, F; Pataki, G
  作者单位：Carnegie Mellon University; Columbia University; University of Texas System; University of Texas Dallas; University of Kentucky; University of North Carolina; University of North Carolina Chapel Hill
  摘要：We propose a new heuristic for pure 0-1 programs, which finds feasible integer points by enumerating extended facets of the octahedron, the outer polar of the unit hypercube. We give efficient algorithms to carry out the enumeration, and rye explain how our heuristic can be embedded in a branch-and-cut framework. Finally, we present computational results on a set of pure 0-1 programs taken from MILPLIB and other sources.
• Optimal policies for multiechelon inventory problems with Markov-modulated demand AI翻译
  作者：Chen, FR; Song, JS
  作者单位：Columbia University; University of California System; University of California Irvine
  摘要：This paper considers a multistage serial inventory system with Markov-modulated demand. Random demand arises at Stage II Stage I orders from Stage 2, etc., and Stage N orders from an outside supplier with unlimited stock. The demand distribution in each period is determined by the current state of an exogenous Markov chain. Excess demand is backlogged. Linear holding costs are incurred st every stage? and linear backorder costs are incurred at Stage 1. The ordering casts are also linear. The o...
• Solving large nonconvex water resources management models using generalized benders decomposition AI翻译
  作者：Cai, XM; McKinney, DC; Lasdon, LS; Watkins, DW
  作者单位：CGIAR; International Food Policy Research Institute (IFPRI); University of Texas System; University of Texas Austin; University of Texas System; University of Texas Austin; Michigan Technological University
  摘要：Nonconvex nonlinear programming (NLP) problems arise frequently in water resources management, e.g., reservoir operations, groundwater remediation, and integrated water quantity and quality! management. Such problems are usually large and sparse. Existing software for global optimization cannot cope with problems of this size, while current local sparse NLP solvers, e.g., MINOS (Murtagh and Saunders 1987), or CONOPT (Drud 1994) cannot guarantee a global solution. In this paper, we apply the Ge...
• Heavy traffic analysis of dynamic cyclic policies: A unified treatment of the single machine scheduling problem AI翻译
  作者：Markowitz, DM; Wein, LM
  作者单位：Massachusetts Institute of Technology (MIT)
  摘要：This paper examines how; setups, due dates, and the mis of standardized and customized products affect the scheduling of a single machine operating in a dynamic and stochastic environment. We restrict ourselves to the class of dynamic cyclic policies, where the machine busy/idle policy and lot-sizing decisions are controlled in a dynamic fashion, but different products must be produced in a fixed sequence.. As in earlier work, we conjecture that an averaging principle holds for this queueing s...
• Grade selection and blending to optimize cost and quality AI翻译
  作者：Karmarkar, US; Rajaram, K
  作者单位：University of California System; University of California Los Angeles
  摘要：In many chemical process applications, a large mix of products is produced by blending them from a much smaller set of basic grades. The basic grades themselves are typically produced on the same process equipment and inventoried in batches. Decisions that arise in this process include selecting the set of basic grades, determining how much of each basic grade to produce, and how to blend basic grades to meet final product demand. We model this problem as a nonlinear mixed-integer program, whi...
• Performance evaluation in stochastic environments using mean-variance data envelopment analysis AI翻译
  作者：Post, T
  作者单位：Erasmus University Rotterdam - Excl Erasmus MC; Erasmus University Rotterdam
  摘要：Traditional Data Envelope Analysis (DEA) neglects uncertainty for the input-output variables by treating the observations as if they were the true input-output variables to select reference units far efficiency estimation and performance benchmarking. In stochastic environments, the traditional framework may include stochastically dominated reference units and exclude stochastically undominated ones. To incorporate uncertainty for the input-output variables in DEA, we propose a mean-variance f...
• The asymptotic optimality of the SPT rule for the flow shop mean completion time problem AI翻译
  作者：Kaminsky, F; Simchi-Levi, D
  作者单位：University of California System; University of California Berkeley; Massachusetts Institute of Technology (MIT)
  摘要：In the flow: shop mean completion time problem. a set of jobs has to be processed on IH-machines. Every machine has to process each one of the jobs, and every jab has the same routing through the machines. The objective is to determine a sequence of the jobs on the machines so as to minimize the sum of the completion times of ail jobs on the final machine. In this paper, we prove the asymptotic optimality of the Shortest Processing Time al,algorithm for ally continuous, independent, and identi...
• Dynamic scheduling for a flexible processing network AI翻译
  作者：Nam, IC
  作者单位：Seoul National University (SNU)
  摘要：We study flexible processing systems where there are multiple paths for a certain type of customer to follow through the system. This paper analyzes an open processing network model with discretionary routing. The underlying methodology is the heavy traffic approximation, which has been well publicized by many researchers. Allowing priority sequencing in addition to dynamic routing as our control policy we show that the balanced workload routing rule does not necessarily give us an optimal sol...