## Search

Now showing items 1-10 of 20

#### 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 ...

#### Optimal streaming of a single job in a two-stage flow shop

(Elsevier, 1998-10-01)

Lot streaming is moving some portion of a process batch ahead to begin a downstream operation. The problem to be
considered in this paper is the following: a single job consisting of U units is to be processed on two ...

#### Lot streaming in open shops

(Elsevier, 1998-10)

We study lot streaming in shops in which the order the jobs are to be processed is immaterial. For a single job case, the
properties of the optimal routing is determined. For the multi job case, two machine shops are ...

#### Scheduling with neural networks: A review of the literature and new research directtions

(Taylor & Francis, 1998)

Artificial neural networks ( ANNs) attempt to emulate the massively parallel and distributed processing of the human brain. They are being examined for a variety of problems that have been di cult to solve with current ...

#### Restoration of space-variant global blurs caused by severe camera movements and coordinate distortions

(IOP Science, 1998)

We show that a broad class of image recovery problems where an object undergoing an arbitrary two-dimensional, time- and space-variant, non-separable, nonlinear global coordinate distortion, is imaged for a certain duration, ...

#### Asymptotic analysis of nonhomogenous hierarchical Markov processes and applications in models of the consolidation of queueing systems

(American Mathematical Society, 1998)

Limit theorems for nonhomogenous in time hierarchical Markov processes admitting the consolidation of states are studied. Noiton of quasi-Markov processes is introduced. The theorem on asymptotic consolidation in the class ...

#### Newton's method for linear inequality systems

(Elsevier, 1998)

We describe a modified Newton type algorithm for the solution of linear inequality systems in the sense of minimizing the ℓ2 norm of infeasibilities. Finite termination is proved, and numerical results are given. © 1998 ...

#### A penalty continuation method for the ℓ∞ solution of overdetermined linear systems

(Springer Netherlands, 1998)

A new algorithm for the ℓ∞ solution of overdetermined linear systems is given. The algorithm is based on the application of quadratic penalty functions to a primal linear programming formulation of the ℓ∞ problem. The ...

#### A spanning tree approach to the absolute p-center problem

(Elsevier, 1998)

We consider the absolute p-center problem on a general network and propose a spanning tree approach which is motivated by the fact that the problem is NP-hard on general networks but solvable in polynomial time on trees. ...