International audienceFor five single machine total tardiness problems a fully polynomial-time approximation scheme (FPTAS) based on a graphical algorithm is presented. The FPTAS has the best running time among the known approximation schemes for these problems
15 pagesIn this paper, we study the single machine total completion time scheduling problem with ava...
Due to copyright restrictions, the access to the full text of this article is only available via sub...
Single-machine scheduling where jobs have a penalty for being late or for being rejected altogether ...
International audienceFor five single machine total tardiness problems a fully polynomial-time appro...
International audienceOften the problem of determining an optimal or approximate production schedule...
We develop a fully polynomial-time approximation scheme (FPTAS) for minimizing the weighted total ta...
Abstract. We study the classical NP-hard in the ordinary sense single-machine total tardiness schedu...
This paper addresses a new performance measure for scheduling problems, entitled “biased tardiness p...
International audienceThis paper deals with a common due date parallel machines scheduling problem i...
AbstractThis paper deals with the total weighted tardiness minimization with a common due date on a ...
This is a special issue for the papers presented in the Eighth International Workshop on Project Man...
We design a fully polynomial-time approximation scheme (FPTAS) for a single machine scheduling probl...
The weakly NP-hard single-machine total tardiness scheduling problem has been extensively studied in...
In a recent paper [Theoretical Computer Science 363, 257–265], He, Zhong and Gu considered the non-r...
http://deepblue.lib.umich.edu/bitstream/2027.42/8379/5/bam7880.0001.001.pdfhttp://deepblue.lib.umich...
15 pagesIn this paper, we study the single machine total completion time scheduling problem with ava...
Due to copyright restrictions, the access to the full text of this article is only available via sub...
Single-machine scheduling where jobs have a penalty for being late or for being rejected altogether ...
International audienceFor five single machine total tardiness problems a fully polynomial-time appro...
International audienceOften the problem of determining an optimal or approximate production schedule...
We develop a fully polynomial-time approximation scheme (FPTAS) for minimizing the weighted total ta...
Abstract. We study the classical NP-hard in the ordinary sense single-machine total tardiness schedu...
This paper addresses a new performance measure for scheduling problems, entitled “biased tardiness p...
International audienceThis paper deals with a common due date parallel machines scheduling problem i...
AbstractThis paper deals with the total weighted tardiness minimization with a common due date on a ...
This is a special issue for the papers presented in the Eighth International Workshop on Project Man...
We design a fully polynomial-time approximation scheme (FPTAS) for a single machine scheduling probl...
The weakly NP-hard single-machine total tardiness scheduling problem has been extensively studied in...
In a recent paper [Theoretical Computer Science 363, 257–265], He, Zhong and Gu considered the non-r...
http://deepblue.lib.umich.edu/bitstream/2027.42/8379/5/bam7880.0001.001.pdfhttp://deepblue.lib.umich...
15 pagesIn this paper, we study the single machine total completion time scheduling problem with ava...
Due to copyright restrictions, the access to the full text of this article is only available via sub...
Single-machine scheduling where jobs have a penalty for being late or for being rejected altogether ...
DOI
Add to ORKG