## Search

Now showing items 1-10 of 98

#### A comparison of hazard rate estimators for left truncated and right censored data

(1992)

SUMMARY: Left truncation and right censoring arise frequently in practice for life data. This paper is concerned with the estimation of the hazard rate function for such data. Two types of nonparametric estimators based ...

#### Dynamic dispatching algorithm for scheduling machines and automated guided vehicles in a flexible manufacturing system

(Taylor & Francis, 1992)

In this paper, an on-line dispatching algorithm is proposed for the FMS scheduling problem. The algorithm uses various priority schemes and relevant information concerning the load of the system and the status of jobs in ...

#### An integrated evaluation of facility location, capacity acquisition, and technology selection for designing global manufacturing strategies

(Elsevier BV, 1992)

Emergence of global markets enhanced the emergence of global firms which have plants in different countries and implement an integrated management style. Due to the intensive competition in global markets, manufacturing ...

#### Incorporating just-in-time into a decision support system environment

(Elsevier BV, 1991)

In this paper, a Decision Support System is proposed for a Just-In-Time production system. The Decision Support System includes three components: database, model base, and interface. The database contains the predefined ...

#### Separation and normalization in multi-attribute decision models for investment evaluation

(Taylor & Francis, 1991)

The separation of the evaluation attributes into two distinct subsets, objective and subjective measures, is discussed. The use of normalization over the alternatives for each subjective attribute is shown to lead to ...

#### Data dependent worst case bound improving techniques in zero-one programming

(Elsevier BV, 1991)

A simple perturbation of data is suggested for use in conjunction with approximation algorithms for the purpose of improving the available bounds (upper and lower), and the worst case bounds. The technique does not require ...

#### A genuinely polynomial primal simplex algorithm for the assignment problem

(Elsevier, 1993)

We present a primal simplex algorithm that solves the assignment problem in 1 2n(n+3)-4 pivots. Starting with a problem of size 1, we sequentially solve problems of size 2,3,4,...,n. The algorithm utilizes degeneracy by ...

#### An application of an optimal behaviour of the greedy solution in number theory

(Akademiai Kiado Rt., 1993)

Let a1, a2, ..., an be relative prime positive integers. The Frobenius problem is to determine the greatest integer not belonging to the set {Σj=1 najxj :x∈Z+ n}. The Frobenius problem belongs to the combinatorial number ...

#### Training an artificial neural network the pure pursuit maneuver

(Pergamon Press, 1991)

Artificial neural networks' ability to learn, categorize, generalize and self organize make them potentially very useful for a variety of application areas. This paper discusses some experiences in attempting to teach a ...

#### Move based heuristics for the unidirectional loop network layout problem

(Elsevier, 1998-07-01)

We consider the loop network layout problem in a manufacturing system where n machines must be placed in n available locations around a loop to minimize the total flow distance. The formulation of the problem results in a ...