| Variable Expansion Techniques for Decomposable Optimization Problems |
05 Mar 2011 |
15 pages |
| Authors:
Jonathan C Smith; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
 | The research supported by the AFOSR considered large-scale mathematical programming problems that can be split into two stages. These problems are of particular interest in setting involving substantial data uncertainty. In this case, a first-stage set of decisions may determine long-term strategic decisions, while a second-stage set of tactical-level decisions are made in response to both the first-stage decisions and the observation of random data. This may involve, for instance, ... |
|
| Detecting and Jamming Dynamic Communication Networks in Anti-Access Environments |
Mar 2011 |
44 pages |
| Authors:
Stanislav Uryasev; Panos Pardalos; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| Three chapters present methods for handling various optimization problems related to sensors networks. The first chapter investigates mathematical programming techniques for solving a class of multi-sensor scheduling problems. We conducted several case studies and investigated the performance of robust optimization solvers for considered 0-1 linear programming problems. The second chapter presents a survey describing recent developments in the area of mathematical programming techniques for various types of sensor network applications. ... |
|
| Robust Decision Making: Addressing Uncertainties in Distributions |
10 MAR 2004 |
98 pages |
| Authors:
Stanislav Uryasev; Panos Pardalos; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| The project was concentrated on development of new methodologies for decision making in uncertain environment and relevant applications. The first part of the project was focused on analytical and discrete optimization approaches for routing an aircraft in threat environment. The model considered aircraft trajectory in three-dimensional space. Several threats were studied, including risk of aircraft detection by radars, sensors, and the risk of being killed by surface to air missiles. ... |
|
| A Demyanov-Type Modification for Generalized Linear Programming |
DEC 87 |
|
| Authors:
Siriphong Lawphongpanich; Donald W. Hearn; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
 | The properties were studied of the direction formed by taking the difference of two successive dual iterates of generalized linear programming (GLP), and pointed out that this direction is also solution to an associated direction finding problem. This study shows that this direction finding problem belongs to a new class of direction finding problems and propose a modification of GLP in which its original direction finding problems is replaced by ... |
|
| Variability of Measures of Weapons Effectiveness. Volume 1. Methodology and Application to Fragment Sensitive Targets in the Absence of Delivery Error |
FEB 85 |
|
| Authors:
B. D. Sivazlian; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| The problem of computing the uncertainty with the probability of kill when using the two-parameter Carleton damage function is considered. It is assumed that the input parameters are not exactly, and that the measure of uncertainty in these parameters is given. Two types of estimation procedures are used: the Taylor's series estimation procedure and a subjective estimation procedure. Two inferential estimation procedures are also discussed. |
|
| Variability of Measures of Weapons Effectiveness. Volume 2. Application to Blast Sensitive Targets in the Absence of Delivery Error |
FEB 85 |
|
| Authors:
B. D. Sivazlian; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| The problem of computing the uncertainty associated with the probability of kill due to blast in the absence of weapon fragmentation and aiming error is considered. The damage function due to blast is assumed to be piecewise linear function of the distance between the blast point and the target point. Under the assumption that the input parameters are uniformly distributed, explict expressions are obtained for the expectation and variance of ... |
|
| Variability of Measures of Weapons Effectiveness. Volume 3. Application to Fragment Sensitive Targets in the Presence of Delivery Error |
FEB 85 |
|
| Authors:
B. D. Sivazlian; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| The problem of computing the uncertainty associated with the probability of kill due to fragmentation in the presence of aiming error and in the presence of blast is considered. It is assumed that the damage due to fragmentation can be approximated by two-parameter Carleton damage function. The aiming error in the delivery of the weapon is assumed to be Gaussian and independent in each of the range and deflection directions. ... |
|
| Variability of Measures of Weapons Effectiveness. Volume 4. Application to Blast Sensitive Targets in the Presence of Delivery Error |
FEB 85 |
|
| Authors:
B. D. Sivazlian; J. F. Mahoney; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| An expression for the probability of kill, of stationary ground point-target is derived subject to the following assumptions: the target is killed solely because of blast; the aiming errors of the air-delivered weapon in both range and defection are independently and normally distributed; the extent of damage to the target is given by a piecewise linear function of the distance between the target and the point of impact. An expression ... |
|
| Variability of Measures of Weapons Effectiveness. Volume 5. Techniques of the Methodology of Volumes 1, 2, 3, and 4 |
FEB 85 |
28 pages |
| Authors:
J. F. Mahoney; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| This report consists of a collection of the relevant equations which are developed in Volumes I, II, III, and IV ''Variability of Measures of Weapons Effectiveness''. The equations presented are for the estimation of the weapon probability of kill and for the variance of the probability of kill for ground targets which are either sensitive to blast or to fragmentation when delivery error is present and when it is not. ... |
|
| Variability of Measures of Weapons Effectiveness. Volume 6. Estimation of the Weapons Parameters and Their Variances in the Carleton Damage Function |
FEB 85 |
77 pages |
| Authors:
A. Black; J. F. Mahoney; B. D. Sivazlian; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| For the three-parameter Carleton damage function, the techniques of linear and non-linear regression are used to estimate the three parameters as well as their variance - covariance matrix. The computational aspect of the estimation is discussed, including language, program and subroutine. 13 weapon/ target situations, numerical results are provided. |
|
| Variability of Measures of Weapons Effectiveness. Volume 7. Effectiveness Indices in Stick Delivery of Weapons |
FEB 85 |
76 pages |
| Authors:
B. D. Sivazlian; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| The probability of kill of a fragment sensitive target due to the stick delivery of multiple weapons subject to ballistic and aiming error is computed. It is assumed that the probability of kill associated with each weapon can be approximated by the Carleton damage function. Both the ballistic errors and the aiming errors are assumed to have a Gaussian distribution in each of the range and deflection direction. Each weapon ... |
|
| Variability of Measures of Weapons Effectiveness. Volume 8. Effectiveness Indices in Multiple and Guided Weapons |
FEB 1985 |
59 pages |
| Authors:
B. D. Sivazlian; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| Mathematical models are developed for obtaining expressions for the probability of kill for multiple weapons under stick delivery, for laser guided bombs, and for guided weapons. It is assumed that the damage function can be approximated by the Carleton damage function and that delivery errors are present having predefined distributions. The variability in probability kill is computed. |
|
| A Program to Produce Standard Shewhart Control Charts for the Statistics X-Bar and R or S, P, NP, C, or U |
SEP 1984 |
|
| Authors:
J. E. King; R. S. Leavenworth; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| This report presents an interactive Fortran 77 computer program to developing and plotting standard Shewhart control charts for X-bar and R or s, p, np, c or u. It was developed on a VAX 11/750 computer using the VMS operating system. Central lines and control limits may be based on the input data, modifications of input data, or standard values. Input data is stored in separate named files so that ... |
|
| Developing Double Sampling Plans for Attributes to Meet Sample Size Criteria |
SEP 1984 |
|
| Authors:
R. W. Rangarajan; K. B. Beitler; R. S. Leavenworth; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| This study reports on the development of a FORTRAN IV program to produce double sampling acceptance plans for attributes data. The plans must satisfy two points on an operating characteristic curve, the acceptable quality level point (p1, 1-alpha) and the rejectable quality level (p2, beta). Two models are given. Model I has an additional constraint that the maximum value of the ASN must be less than or equal to the ... |
|
| A Computer System for Generating Single and Double Sampling Plans for Attributes Data |
AUG 1984 |
|
| Authors:
K. W. Beitler; R. S. Leavenworth; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| This study brings together the programs developed in three previous reports into a unified sampling system. One segment contains the single and double sampling plans of MIL-STD-105D along with subroutines that evaluate the normal, tightened and reduced plans including switching rules. Output includes system OC curves, and Average Sample Number (ASN), AOQ, and Average Fraction Inspected (AFI), curves in either graphical or tabular form. Another segment derives single and double ... |
|
| An Interactive Computerized Approach for Tabulating and Evaluating MIL- STD-105D |
MAY 1984 |
|
| Authors:
A. H. Siddiqi; R. S. Leavenworth; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| This report presents a user-friendly interactive computer program, written in Fortran IV, that tabulates and evaluates the single and double sampling plans contained in MIL-STD-105D. The program also provides the user an option to plot curves for the associated operating characteristics when the switching rules are applied. The sampling scheme is described in terms of a Markov chain to obtain steady-state probabilities of being in the various states of normal, ... |
|
| Designing Optimal AOQL Sampling Plans a Computerized Approach |
JAN 1984 |
|
| Authors:
J. E. Walker; R. S. Leavenworth; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| This study provides an algorithm and computer program, coded in Fortran IV, to develop double sampling acceptance plans for attributes which satisfy a specified Average Outgoing Quality Limit (AOQL) and minimize the Average Fraction Inspected at a specified quality level, P sub 1. An analysis of the steps in the algorithm is provided and comparison is made among the results of program runs and Dodge-Romig AOQL and MIL-STD-105D plans. ... |
|
| A Note on a Combined Approach to the Pallet Loading Problem |
FEB 1983 |
|
| Authors:
Thom J. Hodgson; Diana Swift Hughes; Louis A. Martin-Vega; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| Hodgson developed a dynamic programming based heuristic for the two- dimensional pallet loading problem. In the course of evaluating the computational results for the procedure, it was noted that the quality of solutions obtained by the procedure (percent coverage of the pallet area) was very good. The CPU seconds required to compute solutions were larger than would be desireable for application in a real-time environment. It was observed that there ... |
|
| Acceptance Control Charts Based on the Exact and Normal Approximations to the Binomial Distribution |
DEC 1982 |
|
| Authors:
Carlos Amado; Richard S. Leavenworth; Richard L. Scheaffer; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| Procedures are developed for finding the sample size and control limit for Acceptance Control Charts for proportion of nonconforming units using the exact binomial distribution, the standard normal approximation to the binomial, and a normalized arcsin transformation of the data. The user must select an Acceptable Process Level and a Rejectable Process Level and the associated risks for each. The approximation methods are compared to the exact method over a ... |
|
| Production Lot Sizing and the Power of 2 |
JUN 1982 |
|
| Authors:
Thom J. Hodgson; Marc Lambrecht; Jacques Vander Eecken; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| In this paper the concept of power of two lot sizing is presented. A model (one of many possible) of a simple production system is formulated illustrating the use of the concept. The model has the form of a 0-1 integer linear program. A numerical example is presented and, finally, an extension to include more complex production systems is presented. (Author) |
|
| A combined Approach to the Pallet Loading Problem |
MAY 1982 |
|
| Authors:
Thom J. Hodgson; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| The two-dimensional pallet loading problem is considered: that is, the problem of loading a rectangular pallet of size 'L' by 'W', drawing from a set of 'n' rectangular boxes. The objective is to maximize the area covered on the pallet by the boxes loaded. The problem is approached using a combination of Dynamic programming and heuristics. The structured solutions resulting from the application of the 'dynamic program' have two serendipitous ... |
|
| On the Pallet Loading Problem |
AUG 1981 |
|
| Authors:
Thom J. Hodgson; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| In this paper the two-dimensional pallet loading problem is considered: that is, the problem of loading a rectangular pallet of size 'L' by 'W', drawing from a set of 'n' rectangular boxes. The objective is to maximize the area covered on the pallet by the boxes loaded. The problem is approached using a combination of Dynamic Programming and heuristics. The structured solutions resulting from the application of the 'dynamic program' ... |
|
| An Interactive Production Control Training Model for a NARF Shop |
JUN 1981 |
|
| Authors:
John C. Gilmour; Thom J. Hodgson; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| This paper reports on an interactive production control training model for a Naval Air Rework Facility (NARF) Shop. The system is an interactive shop simulator which allows production control decisions to be made by the user. The objective is to provide a training vehicle for production control decision making. The report includes a users' manual and program listing. |
|
| IPLS: Interactive Pallet Loading System |
JUN 1981 |
|
| Authors:
Thom J. Hodgson; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| The USAF Interactive Pallet Loading System (IPLS) is a real-time system for the planning of loading pallets. The system used a combination of dynamic programming and heuristics, along with user interaction to accomplish the pallet loading task. The system is designed to be interfaced with the Base Automated Mobility System (BAMS). Examples are given. (Author) |
|
| Heuristic Algorithms for Solving Two Dimensional Loading Problems |
MAR 1981 |
|
| Authors:
M. A. White; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| The loading problem involves the allocation of 'n' boxes, each having a specific length, width and height, to a pallet of specific dimensions. Much work has been done on solving the many special cases of this problem where all boxes are of the same rectangular size and/or with the restriction that the edge of the rectangles follow a 'Guillotine cut' from one edge of the pallet to the other; the ... |
|
| Evolutionary Development of an Interactive Scheduling System for a Generalized Flowshop. |
AUG 1980 |
|
| Authors:
Gerald Wayne McDonald; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| The application of interactive computer techniques to the scheduling of industrial production operations has long seemed to e a potential way to break through the many problems that are encountered in this area, however, most attempts to apply such techniques have ended in failure. The author reports on a successful application created for an aircraft overhaul facility operated by the U.S. Navy. The major emphases are in the evolutionary method ... |
|
| Research in Group Replacement of a Multicomponent System Subject to Deterioration. The Discounted Problem and Some Extensions. |
25 JUN 1980 |
|
| Authors:
Boghos D. Sivazlian; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| Research was conducted on problems of life cycle cost analysis, replacement problems and partial fraction expansion. The report contains summaries describing the research and the principal results in each of these areas. This information is supplemented by a list of publications. (Author) |
|
| An Efficient Method for Performing Partial Fraction Expansion. |
FEB 1980 |
|
| Authors:
John F. Mahoney; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| An escalation method for performing partial fraction expansions is presented for the case that the complete list of zeros of the denominator of the proper rational function is known. Expressions for the number of divisions and multiplications required are developed. The new method requires fewer such arithmetic operations than does the method of Henrici. A numerical example is provided. (Author) |
|
| Production Lot Sizing with Material Handling Cost Considerations. |
DEC 1979 |
|
| Authors:
T. J. Hodgson; T. J. Lowe; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| The determination of production lot sizes and the assignment of storage space in a warehouse for the produced items are usually treated as two separate problems: The former providing input (space needed) to the latter. In this paper, we treat the decision problems as one with the objective of minimizing total setup, inventory carrying, and warehouse material handling cost. We treat the minimum material handling cost as a continuous function ... |
|
| A Multi-Product, 2-Stage, Multi-Machine Scheduling Problem: Conditions for Optimality. |
APR 1979 |
|
| Authors:
C. Stafford Loveland; Thom J. Hodgson; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| In this paper we examine a multi-product, multi-machine, 2-echelon scheduling problem. First, a heuristic approach to solving the problem is developed then a series of parameter conditions are specified which, if met, result in the heuristic providing a feasible solution if one exists and an optimal solution if one exists. Several extensions of the problem are discussed. Finally, solution approaches for other parameter conditions are discussed. (Author) |
|
| A Research Program in Logistics Systems. |
24 OCT 1978 |
|
| Authors:
Richard L. Francis; Donald W. Hearn; Timothy J. Lowe; Eginhard J. Muth; H. Donald Ratliff; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| Research was conducted on problems in facility layout, location theory, conveyor systems, scheduling and routing, inventory theory, and replacement theory. The report contains separate summaries describing the research and the principal results in each of these areas. This information is supplemented by a list of journal publications, a list of technical reports, and a list of Ph.D. degrees supported by the contract. (Author) |
|
| A Feasible Direction Subgradient Algorithm for a Class of Nondifferentiable Optimization Problems. |
OCT 1978 |
|
| Authors:
Jacques Chatelon; Donald Hearn; Timothy J. Lowe; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| An implementable feasible direction subgradient algorithm is presented for minimizing the maximum of a finite collection of functions subject to constraints. It is assumed that each function involved in defining the objective function is the sum of a finite collection of basic convex functions and that the number of different subgradient sets associated with nondifferentiable points of each basic function is finite on any bounded set. It is demonstrated that ... |
|
| A Note on the Value of Interchange Methods in Scheduling Problems. |
SEP 1978 |
|
| Authors:
Thom J. Hodgson; C. Stafford Loveland; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| Consider a multi-machine scheduling problem in which the jobs (of unit duration) may have non-zero release times, monotonic increasing deferral costs, and general precedence relationships between them. In general, efficient optimal solution techniques do not exist for problems of this type, and, typically realistically sized problems must be solved using heuristics. An efficient mehtod for implementing job interchange techniques is presented for improving heuristically derived schedules. The method is tested ... |
|
| Binding Inequalities for Tree Network Location Problems with Distance Constraints. |
AUG 1978 |
|
| Authors:
Richard L. Francis; Barbaros C. Tansel ; Timothy J. Lowe; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| This paper considers the problem of finding locations of several new facilities in an imbedded tree network with respect to existing facilities at known locations so as to satisfy distance constraints, which impose upper bounds on distances between pairs of facilities. It is known that the existence of a feasible solution to the distance constraints is related to shortest paths through an auxiliary network, which has as arc lengths the ... |
|
| Efficiency in Integral Facility Design Problems. |
AUG 1978 |
|
| Authors:
Luc G. Chalmet; Richard L. Francis; James F. Lawrence; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| An example of a design might be a warehouse floor, represented by a set S, of area A, but unspecified shape. Given m warehouse users, suppose user i has a known disutility function fi such that Hi(S), the integral of fi over the set S (for example, a total travel distance), defines the disutility of the design S to user i. For vector H(S) with entries Hi(S), we study the ... |
|
| On Characterizing Supremum-Efficient Facility Designs. |
AUG 1978 |
|
| Authors:
Luc G. Chalmet; Richard L. Francis; James F. Lawrence; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| Define a design to be any planar set S of known area A, but unknown shape and location; more generally, a design can be any set in R superscript n of measure A. For example, a design might be one floor of a warehouse, or a sports arena of known seating capacity. Suppose the design to have, say, m users, or evaluators, with user/evaluator i having a design disutility function ... |
|
| An AQL-AOQL Process Control System for Fraction Defective. |
JUN 1978 |
|
| Authors:
Richard S. Leavenworth; Richard L. Scheaffer; Zoran Lekic; Henri Lorberbaum; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| This research reports on an acceptance control chart system based on a combination of AQL AOQL. It is designed to augment and parallel ISE TR 76-4 'Procedure for Maintenance and Rework Process Quality Control Based on Random Sampling' in Those situations in which large numbers of essentially identical items are produced. (Author) |
|
| The Autocovariance Function Determined Via the Z-Transform, with Application to Box Jenkins Forecasting Models. |
MAY 1978 |
|
| Authors:
Eginhard J. Muth; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| A Method is presented which yields the autocovariance function of a stationary discrete-time stochastic process in closed form. Special reference is made to the Box Jenkins forecasting methodology in which the underlying process is generated by passing white noise through a linear filter. The impulse response of the filter and its Z-transform, the transfer function, are obtained from the equation which defines the filter. The bilateral Z-transform of the autocovariance ... |
|
| Optimal Control of Multi-Shop Systems. Part I: Parallel Shops. Part II: Series Shops. |
APR 1978 |
|
| Authors:
Christopher Brooks Haas; Thom J. Hodgson; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| This paper considers the optimal control structure for multi-shop (Part I: Parallel, Part II: Series) systems, where the input to the shop system is random and the shop output is determined by the number of workers in the shop. The number of workers available to the system is held constant, while control is exercised in discrete time by adjusting the allocation of workers to the various shops in the system. ... |
|
| Computation Techniques for Large Scale Undiscounted Markov Decision Processes. |
MAR 1978 |
|
| Authors:
Thom J. Hodgson; Gary J. Koehler; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| This paper considers computation techniques associated with the optimization of large scale Markov decision processes. Markov decision processes and successive approximation procedures are described. Then a procedure for scaling continuous time and renewal processes so that they are amenable to the second procedure is discussed. The effect of the scale factor value on the convergence rate of the procedure and insights into proper scale factor selection are given. Finally, various ... |
|
| A Cut Approach to a Class of Quadratic Integer Programming Problems. |
JAN 1978 |
|
| Authors:
Jean-Claude Picard; H. Donald Ratliff; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| This paper presents an efficient algorithm for solving a class of quadratic integer programming problems. These problems include discrete versions of the quadratic placement problem and the squared Euclidean distance problem. The algorithm solves a finite sequence of minimum cut problems, or equivalently maximum flow problems, on a graph with n + 2 vertices where n is the number of variables in the problem. (Author) |
|
| The Reversibility Property of Production Lines. |
JAN 1978 |
|
| Authors:
Eginhard J. Muth; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| A production line is treated as a series arrangement of k work stations. An unlimited supply of raw production items is available at the first station, and each item passes through all of the stations in sequence. The service time for a single item at station j is assumed to be a random variable with a probability distribution peculiar to that station. In this mode of operation any station will ... |
|
| A Greedy Algorithm for a Warehouse Leasing Problem. |
OCT 1977 |
|
| Authors:
Timothy J. Lowe; Eric W. Reinhardt; Richard L. Francis; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| This paper considers the problem of a firm which must lease warehouse space over a finite planning horizon. Demand for space in each time period is a random variable with known density function. The firm contracts for warehouse space for each time period at the beginning of the planning horizon via a primary contract. If demand exceeds space in any period, additional space can be obtained via a secondary contract. ... |
|
| An Efficient Computational Alternative to 'Using Linear Programming to Design Oil Pollution Detection Schedules'. |
OCT 1977 |
|
| Authors:
Lee E. Daniel Jr.; Sandal Hart; Thom J. Hodgson; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| In Olson, Wright, and McKell's recent paper on the design of oil pollution detection schedules, an interesting and inventive development and application of a Markov Decision Process was presented. Optimal schedules for patrol flights of surveillance aircraft were found using linear programming. In this paper the model has been reformulated as a discrete time semi-Markov process. Significant computational advantages accrue from this alternative approach. (Author) |
|
| A Field Guide to Identifying Network Flow and Matching Problems. |
SEP 1977 |
|
| Authors:
John J. Bartholdi III; H. Donald Ratliff; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| In an important but apparently little-known result, M. Iri has given necessary and sufficient conditions for a linear program to be solvable as a network flow problem. For tutorial purposes we recapitulate his result, though from a different perspective. Then in the same spirit we characterize linear programs that are solvable by the matching algorithm. (Author) |
|
| Circular 1's and Cyclic Staffing. |
SEP 1977 |
|
| Authors:
John J. Bartholdi III; James B. Orlin; H. Donald Ratliff; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| A commonly encountered integer linear program, basic to cyclic staffing and scheduling, has a constraint matrix possessing the property of circular 1's in columns. In general, such a matrix is not unimodular, balanced, or perfect. Nevertheless, many such problems may be efficiently solved for integer answers. A change of variable transforms them to comfortably finite and reassuringly predictable series of minimum cost network flow problems. (Author) |
|
| An Interactive Heuristic Approach for Scheduling a Multi Resource Constrained System. |
SEP 1977 |
|
| Authors:
Per-Olof Carlson; Thom J. Hodgson; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| The solution to a multi resource, multi project scheduling problem is approached in a way that combines human interaction, heuristics and optimality seeking procedures. A tree search algorithm is employed to perform the search. By use of heuristics, the tree can be 'pruned' so as to limit its branches, i.e., the problem is simplified and computational times for optimality seeking procedures can be drastically reduced. By man-computer interaction, data and ... |
|
| Rectangular Layout Problems with Worst-Case Distance Measures. |
AUG 1977 |
|
| Authors:
V. Darryl Thornton; Richard L. Francis; Timothy J. Lowe; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| This paper considers two separate, but related problems involving the design of rectangular layouts of m activities. In each of the problems, costs are incurred which are non-decreasing in distance between activities. The distance between two activities is either the worst-cast rectilinear distance, or the worst-case Tchebyshev distance. Minisum and minimzx layout problems are then considered and solution techniques are provided. (Author) |
|
| Condensed Operating Manual for NARF Sampling System. |
AUG 1977 |
|
| Authors:
Richard S. Leavenworth; Zoran Lekic; Henri Lorberbaum; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| This report contains an abbreviated set of plans and procedures from 'Procedure for Maintenance and Rework Process Quality Control Based on Random Sampling'. It is intended as a shop floor operating manual for quality assurance inspection personnel. Procedures have been abbreviated from the above mentioned source document. This report is intended to supplement the source document, not to replace it. |
|
| A Dyadic Age-Replacement Policy for a Periodically Inspected Equipment Item Subject to Random Deterioration |
JUL 1977 |
30 pages |
| Authors:
Srinivas N. Iyer; Boghos D. Sivazlian; FLORIDA UNIV GAINESVILLE DEPT OF INDUSTRIAL AND SYSTEMS ENGINEERING
|
| A periodic review replacement system is considered. The amount of deterioration over successive periods form a sequence of i.i.d. random variables. A replacement policy of the dyadic type is in effect whereby the used equipment item is discarded and immediately replaced by a new identical equipment item if at the end of a period the old equipment has service aged by an amount in excess of S or has been ... |
|
Reports by Corporate Author
