## Search

Now showing items 1-10 of 12

#### An analysis of heuristics in a dynamic job shop with weighted tardiness objectives

(Taylor & Francis, 1999)

Meeting due dates as a reflection of customer satisfaction is one of the scheduling criteria that is frequently encountered in today's manufacturing environments. The natural quantification of this qualitative goal involves ...

#### The robust spanning tree problem with interval data

(Elsevier, 2001)

Motivated by telecommunications applications we investigate the minimum spanning tree problem where edge costs are interval numbers. Since minimum spanning trees depend on the realization of the edge costs, we de5ne the ...

#### SIMARD: a simulated annealing based RNA design algorithm with quality pre-selection strategies

(IEEE, 2017-12)

Most of the biological processes including expression levels of genes and translation of DNA to produce proteins within cells depend on RNA sequences, and the structure of the RNA plays vital role for its function. RNA ...

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

#### Customer order scheduling problem: a comparative metaheuristics study

(Springer, 2007)

The customer order scheduling problem (COSP) is defined as to determine the sequence of tasks to satisfy the demand of customers who order several types of products produced on a single machine. A setup is required whenever ...

#### A saturated linear dynamical network for approximating maximum clique

(Institute of Electrical and Electronics Engineers, 1999-06)

We use a saturated linear gradient dynamical network for finding an approximate solution to the maximum clique problem. We show that for almost all initial conditions, any solution of the network defined on a closed hypercube ...

#### A problem space algorithm for single machine weighted tardiness problems

(Taylor & Francis Inc., 2003)

We propose a problem space genetic algorithm to solve single machine total weighted tardiness scheduling problems. The proposed algorithm utilizes global and time-dependent local dominance rules to improve the neighborhood ...

#### Scheduling to minimize the coefficient of variation

(Elsevier, 1996)

In this paper, we address the problem of uninterruptedly scheduling a set of independent jobs that are ready at time zero with the objective of minimizing the coefficient of variation (CV) of their completion times. We ...

#### A local search heuristic with self-tuning parameter for permutation flow-shop scheduling problem

(IEEE, 2009)

In this paper, a new local search metaheuristic is proposed for the permutation flow-shop scheduling problem. In general, metaheuristics are widely used to solve this problem due to its NP-completeness. Although these ...

#### An approximation algorithm for computing the visibility region of a point on a terrain and visibility testing

(IEEE, 2014-01)

Given a terrain and a query point p on or above it, we want to count the number of triangles of terrain that are visible from p. We present an approximation algorithm to solve this problem. We implement the algorithm and ...