Scheduling to minimize release-time resource consumption and tardiness penalties

We consider the problem of scheduling a set of jobs with a common due-date on a single-machine where the release time of a job is related to the amount of resource consumed. The objective is to minimize the total resource consumption and the total tardiness. While the problem is strongly NP-hard in general, we discuss two different special cases for which special properties are identified and used to develop efficient pseudo-polynomial time algorithms. © 1995 John Wiley & Sons, Inc.     

BOOK REVIEWS

This study examines how young people who have joined the South African National Defence Force (SANDF) on the two-year Military Skills Development System (MSDS) contract experience military service, and the effect this has on their ability to readapt to civilian life. The first part of the study examines the theoretical debates associated with military socialisation and reintegration into civilian life. Hereafter, the findings are presented in terms of the experiences of MSDS privates serving in the infantry, those that have left, and the perceptions of employment agencies in terms of the marketability of military skills. The conclusion is reached that MSDS members experience their two years in the SANDF as life-changing, that this affects their ability to reintegrate back into civilian society, and that the skills acquired during military training is of limited market value. The conclusion is reached that more needs to be done to assist these young military veterans to adapt to civilian life and to augment their military experience with more marketable skills to enable them to find gainful employment.     

Robust shortest path problems with two uncertain multiplicative cost coefficients

We consider a robust shortest path problem when the cost coefficient is the product of two uncertain factors. We first show that the robust problem can be solved in polynomial time by a dual‐variable enumeration with shortest path problems as subproblems. We also propose a path enumeration approach using a K ‐shortest paths finding algorithm that may be efficient in many real cases. An application in hazardous materials transportation is discussed, and the solution methods are illustrated by numerical examples. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

The economic effects of inspector error on attribute sampling plans

In this paper the effects of inspector error on a cost-based quality control system are investigated. The system examined is of a single sampling plan design involving several cost components. Both type I and type II inspector errors are considered. The model employs a process distribution, thus assuming that a stochastic process of some kind governs the quality of incoming lots. Optimal plan design is investigated under both error-free and error-prone inspection procedures and some comparisons are made.     

Least-absolute-value estimators for one-way and two-way tables

This paper concerns itself with the problem of estimating the parameters of one-way and two-way classification models by minimization of the sum of the absolute deviations of the regression function from the observed points. The one-way model reduces to obtaining a set of medians from which optimal parameters can be obtained by simple arithmetic manipulations. The two-way model is transformed into a specially structured linear programming problem, and two algorithms are presented to solve this problem. The occurrence of alternative optimal solutions in both models is discussed, and numerical examples are presented.