In this note we investigate the NP-complete problem of minimizing the makespan in a preemptive two machine job shop. We present a polynomial time approximation algorithm with worst case ratio 3/2 for this problem, and we also argue that this is the best possible result that can be derived via our line of approach
In this paper, we demonstrate the existence of a polynomial time approximation scheme for makespan m...
Abstract: This article addresses the job-shop scheduling problem of minimizing the length of a sched...
It is well known that for preemptive scheduling on uniform machines there exist polynomial time exac...
In this note we investigate the NP-complete problem of minimizing the makespan in a preemptive two m...
This paper considers a variant of the classical problem of minimizing makespan in a two-machine flow...
In this paper we present a polynomial time approximation scheme for the job shop scheduling problem ...
We study the problem of scheduling a chain-reentrant shop, in which each job goes for its processing...
In this paper, we study polynomial time approximation schemes (PTASes) for the no-wait job shop sche...
In 1954, Johnson gave an efficient algorithm for minimizing makespan in a two-machine flow shop; the...
In this paper, we demonstrate the existence of a polynomial time approximation scheme for makespan m...
Abstract: This article addresses the job-shop scheduling problem of minimizing the length of a sched...
It is well known that for preemptive scheduling on uniform machines there exist polynomial time exac...
In this note we investigate the NP-complete problem of minimizing the makespan in a preemptive two m...
This paper considers a variant of the classical problem of minimizing makespan in a two-machine flow...
In this paper we present a polynomial time approximation scheme for the job shop scheduling problem ...
We study the problem of scheduling a chain-reentrant shop, in which each job goes for its processing...
In this paper, we study polynomial time approximation schemes (PTASes) for the no-wait job shop sche...
In 1954, Johnson gave an efficient algorithm for minimizing makespan in a two-machine flow shop; the...
In this paper, we demonstrate the existence of a polynomial time approximation scheme for makespan m...
Abstract: This article addresses the job-shop scheduling problem of minimizing the length of a sched...
It is well known that for preemptive scheduling on uniform machines there exist polynomial time exac...
DOI
Add to ORKG