## Search

Now showing items 1-10 of 37

#### A data-level parallel linear-quadratic penalty algorithm for multicommodity network flows

(Association for Computing Machinery, 1994)

We describe the development of a data-level, massively parallel software system for the solution of multicommodity network flow problems. Using a smooth linear-quadratic penalty (LQP) algorithm we transform the multicommodity ...

#### Beam search based algorithm for scheduling machines and AGVs in an FMS

(Institute for Industrial Engineers, 1993)

This paper presents a beam search based scheduling algorithm for a random FMS. The proposed algorithm considers finite buffer capacity, routing and sequence flexibilities and generates machine and AGV schedules in varying ...

#### Integrated lot sizing and tool management in automated manufacturing systems

(IIE, 1997)

We propose a new algorithm to solve lot sizing, tool allocation and machining conditions optimization problems simultaneously to minimize total production cost in a CNC environment. Most of the existing lot sizing and tool ...

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

#### Scheduling with tool changes to minimize total completion time: a study of heuristics and their performance

(John Wiley & Sons, Inc., 2003)

The machine scheduling literature does not consider the issue of tool change. The
parallel literature on tool management addresses this issue but assumes that the change is due
only to part mix. In practice, however, a ...

#### A neural network model for scheduling problems

(Elsevier, 1996)

Artificial neural networks (ANNs) have been successfully applied to solve a variety of problems. This paper proposes a new neural network approach to solve the single machine mean tardiness scheduling problem and the minimum ...

#### A hierarchical model for the cell loading problem of cellular manufacturing systems

(Taylor & Francis, 1998)

A hierarchical cell loading approach is proposed to solve the production planning problem in cellular manufacturing systems. Our aim is to minimize the variable cost of production subject to production and inventory balance ...

#### Distance-based classification methods

(Taylor & Francis, 1999)

Given a set of points in a Euclidean space, and a partitioning of this 'training set' into two or more subsets ('classes'), we consider the problem of identifying a 'reasonable' assignment of another point in the Euclidean ...

#### Wiener disorder problem with observations at fixed discrete time epochs

(Institute for Operations Research and the Management Sciences (I N F O R M S), 2010)

Suppose that a Wiener process gains a known drift rate at some unobservable disorder time with some zero-modified exponential distribution. The process is observed only at known fixed discrete time epochs, which may not ...

#### Generalized column generation for linear programming

(Institute for Operations Research and the Management Sciences (INFORMS), 2002)

Column generation is a well-known and widely practiced technique for solving linear programs with too many variables or constraints to include in the initial formulation explicitly. Instead, the required column information ...