-
作者：KENT, B; BARE, BB; FIELD, RC; BRADLEY, GA
作者单位：University of Washington; University of Washington Seattle; University of Washington; University of Washington Seattle; University System of Georgia; University of Georgia
摘要：FORPLAN (FORest PLANning) is a large-scale linear programming system used to support national forest land management planning. It is available in two versions, and is used extensively to help interdisciplinary planning teams develop forest-wide plans as dictated by the National Forest Management Act of 1976. Nine years of experience clearly show that while the system is working in a technical sense, troublesome issues remain. This paper begins with an overview of how USDA Forest Service planni...
-
作者：KEEFER, DL; SMITH, FB; BACK, HB
作者单位：Alcoa
摘要：Bidding at U.S. offshore oil and gas lease sales is characterized by high stakes, enormous uncertainties, and many interrelated decisions. The Lease Bidding Strategy System combined techniques from decision analysis, statistics, and nonlinear optimization to provide information and insights to management responsible for bidding at Gulf Oil Corporation. It was used prior to every major federal lease sale from September 1980 until Gulf was acquired in 1984, during which time Gulf's bids exceeded...
-
作者：AHMADI, RH; MATSUO, H
作者单位：University of Texas System; University of Texas Austin
摘要：This paper describes a line segmentation problem in a multistage, multimachine production system. The production facility can concurrently produce several types of circuit boards because each production stage consists of multiple machines. The items produced are categorized into families, and items belonging to the same family share the common major setup, while switching over from one family to another requires a major setup. The line segmentation problem determines an allocation of machines ...
-
作者：ZIPKIN, PH
摘要：This paper treats a version of the Economic Lot Scheduling Problem (ELSP) in which items may be produced several times in different amounts during a cycle. We show how to compute the optimal lot sizes and cycle length, given the sequence of items in a cycle. This requires solving a parametric quadratic program, plus a few EOQ calculations. Our procedure is designed to be used along with a heuristic for selecting the sequence of items in a cycle, such as the one proposed in 1987 by G. Dobson. T...
-
作者：ARKIN, EM; ROUNDY, RO
摘要：In this paper, we address the problem of scheduling a number of jobs on a bank of parallel machines to minimize the total weighted tardiness, under the assumption that the weight of each job is proportional to its processing time. The version of the problem that has general weights has been shown to be strongly NP-complete. We prove this version of the problem to be NP-complete, and give a pseudopolynomial time algorithm for solving it. We study a family of simple sequencing rules in which the...
-
作者：KRAAY, D; HARKER, PT; CHEN, BT
摘要：Recent developments in location systems technology for railroads provide a train dispatcher with the capability to improve the operations of a rail line by pacing trains over a territory; i.e., to permit trains to travel at less than maximum velocity to minimize fuel consumption while maintaining a given level of performance. Traditional railroad dispatching models assume that the velocities of the trains moving over a dispatcher's territory are fixed at their maximum value and, thus, are inca...
-
作者：HOOKER, JN; GARFINKEL, RS; CHEN, CK
作者单位：University of Connecticut
摘要：A research theme involving location on networks, since its inception, has been the identification of a finite dominating set (FDS), or a finite set of points to which an optimal solution must belong. We attempt to unify and generalize results of this sort. We survey the literature and then prove some theorems that subsume most previous results and that are, at the same time, more genral than previous results. The paper is aimed primarily at investigators who wish to know whether an FDS exists ...
-
作者：PREKOPA, A; BOROS, E
摘要：Many transportation networks, e.g., networks of cooperating power systems, and hydrological networks involve a real-valued demand function, defined on the set of nodes, and it is said to be feasible if there exists a flow such that at each node the sum of the incoming flow values is greater than or equal to the demand assigned to this node. By the theorem of D. Gale and A. Hoffman, a system of linear inequalities involving the demand and the arc capacity functions, gives necessary and sufficie...
-
作者：ANILY, S; FEDERGRUEN, A
作者单位：Tel Aviv University; Columbia University
摘要：In many important combinatorial optimization problems, such as bin packing, allocating customer classes to queueing facilities, vehicle routing, multi-item inventory replenishment and combined routing/inventory control, an optimal partition into groups needs to be determined for a finite collection of objects; each is characterized by a single attribute. The cost is often separable in the groups and the group cost often depends on the cardinality and some aggregate measure of the attributes, s...
-
作者：BALAS, E; SALTZMAN, MJ
作者单位：Clemson University
摘要：We describe a branch-and-bound algorithm for solving the axial three-index assignment problem. The main features of the algorithm include a Lagrangian relaxation that incorporates a class of facet inequalities and is solved by a modified subgradient procedure to find good lower bounds, a primal heuristic based on the principle of minimizing maximum regret plus a variable depth interchange phase for finding good upper bounds, and a novel branching strategy that exploits problem structure to fix...
