Related papers: Pseudopolynomial algorithm for single machine sche…

The objective of this paper is to take some aspects of disk scheduling and scheduling algorithms. The disk scheduling is discussed with a sneak peak in general and selection of algorithm in particular.

This paper is withdrawn due to some gaps in the proof

This paper has been withdrawn by the author, due to a crucial error in the proof of Thm.1

This paper is wrong and is therefore withdrawn.

Withdrawn since -order- was overlooked. First order reductions without order are much too weak to separate.

We claimed that there is a polynomial algorithm to test if two graphs are isomorphic. But the algorithm is wrong. It only tests if the adjacency matrices of two graphs have the same eigenvalues. There is a counterexample of two…

In this paper we challenge the widely accepted premise that, in order to carry out a distributed computation, say on the cloud, users have to inform, along with all the inputs that the algorithm in use requires, the number of processors to…

The paper has benn withdrawn because the computation of the external virial contains an error which invalidate the main result.

We consider a natural generalization of classical scheduling problems in which using a time unit for processing a job causes some time-dependent cost which must be paid in addition to the standard scheduling cost. We study the scheduling…

We introduce a parallel machine scheduling problem in which the processing times of jobs are not given in advance but are determined by a system of linear constraints. The objective is to minimize the makespan, i.e., the maximum job…

This paper has been withdrawn by the author due to an error in the derivation.

Due to a computational mistake this paper has been withdrawn.

Admin note: withdrawn by arXiv admin because of the use of a pseudonym, in violation of arXiv policy.

There is a serious flaw in the proposal [arXiv:1603.06857] for the achievement of unity efficiency in SPDC. This is a replacement due to mistakes in the table of probabilities. Numbers have been corrected.

This submission has been withdrawn by arXiv administrators because it is intentionally incomplete, which is in violation of our policies.

This paper has been withdrawn by the author due to a crucial error.

In this paper, we consider an NP-hard problem of scheduling a set of jobs of equal processing time on two machines, given a partial precedence order on the set of jobs, with an objective to minimize the makespan. An approximation algorithm…

This paper has been withdrawn by the author due to an error in section 7. There is a new version: arXiv:1011.3352.

This paper has been withdrawn by the author due to a crucial sign error in equation 1.

This paper is withdrawn due to some errors, which are corrected in arXiv:0912.0071v4 [cs.LG].