## Search

Now showing items 11-20 of 25

#### Cyclic scheduling of a 2-machine robotic cell with tooling constraints

(Elsevier, 2006)

In this study, we deal with the robotic cell scheduling problem with two machines and identical parts. In an ideal FMS, CNC machines are capable of performing all the required operations as long as the required tools are ...

#### An exact algorithm for the capacitated vertex p-center problem

(Elsevier, 2006)

We develop a simple and practical exact algorithm for the problem of locating p facilities and assigning clients to them within capacity restrictions in order to minimize the maximum distance between a client and the ...

#### Polyhedral analysis for concentrator location problems

(Springer, 2006)

The concentrator location problem is to choose a subset of a given terminal set to install concentrators and to assign each remaining terminal node to a concentrator to minimize the cost of installation and assignment. The ...

#### On the minimum volume covering ellipsoid of ellipsoids

(Society for Industrial and Applied Mathematics, 2006)

Let S denote the convex hull of m full-dimensional ellipsoids in ℝn. Given ε > 0 and δ > 0, we study the problems of computing a (1 + ε)-approximation to the minimum volume covering ellipsoid of S and a (1 + δ)n-rounding ...

#### Modelling imperfect advance demand information and analysis of optimal inventory policies

(Elsevier, 2006)

We consider an inventory control problem where it is possible to collect some imperfect information on future demand. We refer to such information as imperfect Advance Demand Information (ADI), which may occur in different ...

#### A note on a polynomial time solvable case of the quadratic assignment problem

(Elsevier, 2006)

We identify a class of instances of the Koopmans-Beckmann form of the Quadratic Assignment Problem that are solvable in polynomial time. This class is characterized by a path structure in the flow data and a grid structure ...

#### On semidefinite bounds for maximization of a non-convex quadratic objective over the ℓ1 unit ball

(E D P Sciences, 2006)

We consider the non-convex quadratic maximization problem subject to the ℓ1 unit ball constraint. The nature of the l1 norm structure makes this problem extremely hard to analyze, and as a consequence, the same difficulties ...

#### On extracting maximum stable sets in perfect graphs using Lovász's theta function

(Springer, 2006)

We study the maximum stable set problem. For a given graph, we establish several transformations among feasible solutions of different formulations of Lovász's theta function. We propose reductions from feasible solutions ...

#### An EOQ model with multiple suppliers and random capacity

(2006)

We consider an EOQ model with multiple suppliers that have random capacities, which leads to uncertain yield in orders. A given order is fully received from a supplier if the order quantity is less than the supplier's ...

#### The stochastic joint replenishment problem: a new policy, analysis, and insights

(John Wiley & Sons, 2006)

In this study, we propose a new parsimonious policy for the stochastic joint replenishment problem in a single-location, N-item setting. The replenishment decisions are based on both group reorder point-group order quantity ...