Let a, b and n be nonnegative integers (b a, b > 0, n 1), Gn(a, b) be a multigraph on n vertices in which any pair of vertices is connected with at least a and at most b edges ...
This paper presents a completeness result for a first-order interval temporal logic, called Neighbourhood Logic (NL) which has two neighbourhood modalities. NL can support the spe...
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...