We study the problem of scheduling jobs with release times and tails on a single machine with the objective to minimize the makespan. This problem is strongly NP-hard, however it is known to beâ€¦ (More)

We give a direct combinatorial O(n logn) algorithm for minimizing the number of late jobs on a single machine when jobs have release times and preemptions are allowed. Our algorithm improves theâ€¦ (More)

We study the problem of computing a preemptive schedule of equal-length jobs with given release times and deadlines. Each job is assigned a weight, and our goal is to maximize the weightedâ€¦ (More)

We consider the problem of scheduling of n independent jobs on m unrelated machines to minimize the max(t1, t2, ..., tm), ti being the completion time of machine i. In [1] was suggested a polynomialâ€¦ (More)

We study inherent structural properties of a strongly NP-hard problem of scheduling n jobs with release times and due dates on a single machine to minimize the number of late jobs. Our study leads toâ€¦ (More)

We consider the problem of scheduling jobs with given release times and due dates on a single machine to minimize the maximum job lateness. It is NP-hard and remains such if the maximal jobâ€¦ (More)

The rate of convergence for an almost surely convergent series of Banach space valued random elements is studied in this paper. As special cases of the main result, known results are obtained for aâ€¦ (More)