Related papers: Pseudopolynomial algorithm for single machine sche…
This paper has been withdrawn by the author, due an error in the proof of Proposion 2.13.
This paper has been withdrawn by the author due to an error in Lemma 3, making the (bijective) proof of Theorem 4 and Corollary 5 invalid (symmetry of k-nonnesting and k-noncrossing set partitions).
We consider single-machine scheduling problems that are natural generalizations or variations of the min-sum set cover problem and the min-sum vertex cover problem. For each of these problems, we give new approximation algorithms. Some of…
This paper has been withdrawn since it contains some discrepancy with othe authers's recent result. We will not post this until this discrepancy is resolved.
An important objective in scheduling literature is to minimize the sum of weighted flow times. We are given a set of jobs where each job is characterized by a release time, a processing time, and a weight. Our goal is to find a preemptive…
In this paper we study a single machine scheduling problem with the objective of minimizing the sum of completion times. Each of the given jobs is either short or long. However the processing times are initially hidden to the algorithm, but…
This paper has been temporarily withdrawn for corrections.
This paper has been withdrawn by the author due to essential mistakes in some previous versions.
This paper has been withdrawn by the author due to an error.
Admin note: withdrawn by arXiv admin because of the use of a pseudonym, in violation of arXiv policy.
This paper has been withdrawn by the author, due to a crucial error in the proof of Lemma 3.1.
This paper has been withdrawn by the author. This draft is withdrawn for its poor quality in english, unfortunately produced by the author when he was just starting his science route. Look at the ICML version instead:…
There are several serious errors in this paper. I thought to have time to fix it, but it did not occur for years. So I withdraw this paper.
This paper has been withdrawn by the author due to an error in an inequality in the proof of Theorem 1.1.
The paper considers scheduling on parallel machines under the constraint that some pairs of jobs cannot be processed concurrently. Each job has an associated weight, and all jobs have the same deadline. The objective is to maximise the…
This paper has been withdrawn by the author due to similarity to the author's other paper
This paper has been withdrawn by the author due to an error in the proof of Theorem 6.
In the problem called single resource constraint scheduling, we are given $m$ identical machines and a set of jobs, each needing one machine to be processed as well as a share of a limited renewable resource $R$. A schedule of these jobs is…
This paper has been withdrawn due to a photometric calibration error.
withdrawn by the authors because of an error.