Showing papers in "Operations Research Letters in 1986"

TL;DR: This work gives efficient algorithms to find a feasible schedule, if any, which minimizes the final completion time under the assumption such that for r"i > r"j, d"i >= d"j.

TL;DR: The Hungarian linear assignment algorithm is now less sensitive to the range of the cost coefficients, and it is shown that the algorithm is essentially equivalent to assignment algorithms based on shortest augmenting paths.

TL;DR: In this article, an overall measure of efficiency is also obtained for each DMU from the observed values of its multiple inputs and outputs without requiring uses of a priori weights using parametric forms relating inputs to outputs.

TL;DR: In this paper, a special case of the Stable Roommates problem is studied, where preferences are derived from a psychological model common in social choice literature. And when preferences are "single-peaked" and "narcissistic", there exists a unique stable matching, and it can be constructed in O(n) time.

TL;DR: An M^x/G/1 queueing system in which the server takes a vacation each time that the system, becomes empty is considered, and the general queue length distribution at an arbitrary time is derived.

TL;DR: In this article, a polynomial time implementation of Melzak's construction of Steiner trees is presented, which can be implemented in linear time and is shown to run in linear space.

TL;DR: In this article, the authors proved the convexity of the analytic continuation of the classical Erlang loss function as a function of x, x >= 0 and the uniqueness of the solution of the basic set of equations associated with the equivalent random method.

TL;DR: In this paper, equivalencies between the most commonly used blocking mechanisms considered in the literature in connection with queueing networks with blocking are obtained.

TL;DR: It is shown that in a static model the stocks of product-specific components always increase when other components are combined, and optimal policy for the dynamic version is shown to be myopic.

TL;DR: This paper presents a fast and flexible heuristic for the multi item capacitated lotsizing problem that requires only O(NT) computations which is at least an order of magnitude faster than other well-known heuristics.

TL;DR: In this paper, a mathematical programming formulation for the statistical classification problem is presented, which maximizes the number of observations that are properly categorized, and can be easily modified for any number of categories of classification.

TL;DR: Ion channels were found in the basolateral membrane and in the cuticular region of the hair cells, which could play an important role in transducing sound-induced sterociliary motion into membrane depolarizations, thereby regulating the contractile state of the outer hair cells and in turn the resonance properties of the cochlear amplifier.

TL;DR: Dyazide was found to have no significant effect on hearing or tinnitus, however, the vestibular complaints decreased significantly during the Dyazide treatment.

TL;DR: An MG1 queueing system where each customer can purchase the priority with which he will be served is considered, and the payment policy from which no customer will deviate as long as the others use it is determined.

TL;DR: Ginger root reduced the induced vertigo significantly better than did placebo and there was no statistically significant action upon the duration or the maximum slow phase velocity of nystagmus.

TL;DR: Two very rare tumors, a monomorphic salivary duct adenoma and an embryonal carcinoma, were studied by electron microscopy and immunohistochemistry and have been analyzed histologically.

TL;DR: A lexicographic minimax algorithm that solves successive problems by A minimax optimizer is developed that is extremely fast and can readily solve large-scale problems that may be encountered in applications, e.g., in production planning.

TL;DR: In this paper, it was shown that unless P = NP, no polynomial heuristic can have a bounded performance ratio for the Koopman's-Beckmann version of the quadratic assignment problem.

TL;DR: In this paper, the authors present an algorithm which can generate all the ideals of a partial order on n elements in O(n) time per ideal, where n is the number of elements in the set.

TL;DR: 60 patients, aged 15-51 years, with chronic allergic or bacterial maxillary sinusitis, were entered in a controlled, double-blind study comparing the efficacy of endonasal irrigations of tixocortol pivalate (Pivalone)-neomycin and neomycin.

TL;DR: In this article, it was shown that it is NP-hard to decide whether the rounding holds or not for an instance of the cutting stock problem for which the rounding property does not hold.

TL;DR: A multi-step hypothesis of aminoglycoside ototoxicity is presented which is consistent with the data elaborated by the laboratory and others and based on competition with divalent cations or polyamines or on binding to negatively charged compounds.

TL;DR: In this paper, a new form of the optimality equation is derived for the case in which every stationary policy gives rise to an ergodic Markov chain, and conditions are given under which an unbounded solution to the average cost optimalality equation exists and yields an optimal stationary policy.

TL;DR: The presence of intermediate Filaments in the inner ear of the newborn mouse was analyzed with immunofluorescence techniques using antibodies against the five classes of intermediate filaments: cytokeratins, vimentin, desmin, neurofilaments and glial fibrillary acid protein (GFA).

TL;DR: In this article, the problem of finding a job sequence that minimizes the expected weighted number of tardy jobs was studied for a single machine and a flow shop consisting of an arbitrary number of machines.

TL;DR: In this article, the authors simulate long-run averages of time integrals of a recurrent semi-Markov process and compute the conditional expectations of everything else needed given the sequence of studies visited.

TL;DR: Evidence is presented that, in contrast to the traditional view, a large proportion of the proteins of the tectorial membrane consists of collagen, primarily type II.

TL;DR: An algorithm for identifying and disposing of duplicate rows in an LP matrix - that is, rows which are identical except for a scalar multiplier is presented.

TL;DR: This paper describes methods of cerebrospinal fluid (CSF) leakage diagnosis which have been used in the post-war period and a direct comparison made between the fluorescein method and the use of beta 2-transferrin.

TL;DR: Diseases reported by the habitual bleeders were few, and the blood routine tests revealed only few diseases that could be related to the recurrent nose-bleeds.