51 search results - page 5 / 11 » jco 2006 |
JCO
1998
14 years 9 months ago
1998
We consider traveling salesman problems (TSPs) with a permuted Monge matrix as cost matrix where the associated patching graph has a specially simple structure: a multistar, a mult...
JCO
1998
14 years 9 months ago
1998
Consider the partition of a set of integers into parts. Various partition properties have been proposed in the literature to facilitate the restriction of the focus of attention to...
JCO
1998
14 years 9 months ago
1998
We consider the problem of scheduling n jobs with release dates on m identical parallel machines to minimize the average completion time of the jobs. We prove that the ratio of the...
JCO
2010
14 years 8 months ago
2010
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...
JCO
2010
14 years 8 months ago
2010
This paper considers an on-line scheduling problem occurred in a service system with two classes (normal and special) of customers and two types (dedicated and flexible) of serve...