Minimizing the sum of absolute lateness in single-machine and multimachine scheduling

Kanet addressed the problem of scheduling n jobs on one machine so as to minimize the sum of absolute lateness under a restrictive assumption on their common due date. This article extends the results to the problem of scheduling n jobs on m parallel identical processors in order to minimize the sum of absolute lateness. Also, a heuristic algorithm for a more general version with no restriction on the common due date, for the problem of n-job single-machine scheduling is presented and its performance is reported.     

Some branch-and-bound procedures for fixed-cost transportation problems

In this article we present three properties that will improve the performance of branch-and-bound algorithms for fixed-cost transportation problems. By applying Lagrangian relaxation we show that one can develop stronger up and down penalties than those traditionally used and also develop a strengthened penalty for nonbasic variables. We also show that it is possible to “look ahead” of a particular node and determine the solution at the next node without actually calculating it. We present computational evidence by comparing our developments with existing procedures.     

Simulation of nonhomogeneous poisson processes by thinning

A simple and relatively efficient method for simulating one-dimensional and two-dimensional nonhomogeneous Poisson processes is presented The method is applicable for any rate function and is based on controlled deletion of points in a Poisson process whose rate function dominates the given rate function In its simplest implementation, the method obviates the need for numerical integration of the rate function, for ordering of points, and for generation of Poisson variates.     

Design of a process control scheme for defects per 100 units based on aoql

A process control scheme is developed in which decisions as to the frequency of sampling are made based upon the choice of an Average Outgoing Quality Limit. The scheme utilizes plotted points on a U-control chart for defects and the theory of runs to determine when to switch among Reduced, Normal, Tightened, and 100 percent inspection. The scheme is formulated as a semi-Markov process to derive steady stale equations for the probabilities of being in Reduced, Normal, Tightened, or 100 percent inspection and for Average Outgoing Quality and Average Fraction Inspected. The resulting system and the computer programs used to derive it are discussed.     

Damage calculations for unreliable warheads

For large numbers of perfectly reliable, optimally targeted warheads the square-root law approximates the expected fraction damage achieved on an area target. In this paper a more exact expression is derived for this damage fraction which Holds for all numbers of warheads. This expression is shown to converge to the square-root law when a large number of warheads are fired. The more exact expression is used in a procedure to calculate expected damage when warheads are unreliable, and this procedure is shown to be superior to a modified square-root approximation which has been used previously.     

Optimal project compression with due-dated events

The paper proposes an algorithm for the determination of the solution of the activities to be shortened and the amount by which they are to be shortened in order to minimize the total cost of project completion. This cost involves a linear penalty for tardienss of a set of key events and a linear cost of activity compression from its normal duration. The procedure is a generalization of the work of Fulkerson.     

Steady state waiting time in a multicenter job shop

This paper analyzes the waiting-time distribution of a specific job as it moves through a job-shop with multiple centers and exponential service times. The movement of the job through the shop is governed by a Markovian transition matrix and ends with the job's exit from the shop.     

The optimum design of multivariate acceptance sampling plans

A model is developed which may be used to determine the expected total cost of quality control per inspection lot under acceptance sampling by variables where several characteristics are to be simultaneously controlled. Optimization of the model is accomplished through the application of a conventional search procedure. The sensitivity of the model and the optimum solution to the shape of the underlying probability distributions is discussed and associated analyses are presented through an example.     

A characterization of the value of zero-sum two-person games

For the family D, consisting of those zero-sum two-person games which have a value, the value-function on D is characterized by four properties called objectivity, monotony, symmetry and sufficiency.