We consider the problem of minimizing the number of airplanes needed to fly a fixed daily repeating schedule of flights. We use deficit functions (DF) to decompose an aviation schedule of aircraft flights into aircraft chains (routes) called a chain decomposition. Each chain visits periodically...

This paper describes how to plan an "optimal" life testing experiment when the lifetime is assumed to have an exponential distribution. We further assume that the mean lifetime is equal to exp([beta]1x1 + ... + [beta]kxk) where the covariates xi form an orthogonal Hademard-type matrix reflecting...

The paper presents some results on the Fisher information for type-I censored data and for quantal response data. It is shown that for one-parameter family, the Fisher information for type-I censoring is always greater or equal than the Fisher information for quantal response, for equal...

The structure of chains in the optimal chain decomposition of a periodic schedule S is investigated. A finite oriented graph termed the Linis Graph (LG) is defined which serves as the key for this investigation. The edges of the LG are trip-types of S and the vertices of the LG represent...