## Search

Now showing items 1-10 of 89

#### Linear programming via a quadratic penalty function

(Physica - Verlag, 1996)

We use quadratic penalty functions along with some recent ideas from linear l1 estimation to arrive at a new characterization of primal optimal solutions in linear programs. The algorithmic implications of this analysis ...

#### Composite regions of feasibility for certain classes of distance constrained network location problems

(INFORMS, 1996)

Distance constrained network location involves locating m new facilities on a transport network G so as to satisfy upper bounds on distances between pairs of new facilities and pairs of new and existing facilities. The ...

#### An integrated process planning approach for CNC machine tools

(Springer-Verlag, 1996)

In view of the high investment and tooling cost of a CNC machining centre, the cutting and idle times should be optimised by considering the tool consumption and the non-machining time cost components. In this paper, we ...

#### A note on the within-cell layout problem based on operation sequences

(Taylor & Francis, 1996)

The existing studies in the literature usually ignore the within-cell layout problem while forming part families and manufacturing cells. A new approach is proposed to solve the part-family and machine-cell formation problem ...

#### On the consistency of a two-sample matching test

(Taylor & Francis, 1996)

Let {X k} and {Y k}, 1 ≤ k ≤n be the order statistics of independent random samples from continuous distribution function F and G respectively. To test the null hypothesis H 0 : G = F, known, against the alternative H 1 : ...

#### Tool allocation and machining conditions optimization for CNC machines

(Elsevier, 1996)

In the literature, there exist many variations of machining economics problem in terms of modelling approaches and solution methodologies. However most of the existing studies focus on the single machining operation which ...

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

#### Experimental investigation of an FMS due-date scheduling problem: Evaluation of machine and AGV scheduling rules

(Kluwer Academic Publishers, 1993)

Although extensive research has been conducted to solve design and operational problems of automated manufacturing systems, many of the problems still remain unsolved. This article investigates the scheduling problems of ...

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

#### New insights on the single machine total tardiness problem

(Palgrave Macmillan, 1997)

Virtually all algorithmic studies on the single machine total tardiness problem use Emmons' theorems that establish precedence relations between job pairs. In this paper, we investigate these theorems with a geometric ...