2004-2005 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe
It is well known that for preemptive scheduling on uniform machines there exist polynomial time exac...
We study the preemptive scheduling problem of a set of n jobs with release times and equal processin...
International audienceWe consider the single machine dynamic total completion time scheduling proble...
Extensive research has been devoted to preemptive scheduling. However, little atten-tion has been pa...
Structural properties of optimal preemptive schedules have been studied in a number of recent papers...
This paper is devoted to basic scheduling problems in which the scheduling cost of a job is not a fu...
AbstractThis paper investigates the notion of preemption in scheduling, with earliness and tardiness...
It is known that the single machine preemptive scheduling problem of minimizing total completion tim...
AbstractIn this paper we study the problem of scheduling n deteriorating jobs with release dates on ...
It is well known that for preemptive scheduling on uniform machines there exist polynomial time exac...
It is well known that for preemptive scheduling on uniform machines there exist polynomial time exac...
Extensive research has been devoted to resource constrained project scheduling problem. However, lit...
It is well known that for preemptive scheduling on uniform machines there exist polynomial time exac...
It is well known that for preemptive scheduling on uniform machines there exist polynomial time exac...
It is well known that for preemptive scheduling on uniform machines there exist polynomial time exac...
It is well known that for preemptive scheduling on uniform machines there exist polynomial time exac...
We study the preemptive scheduling problem of a set of n jobs with release times and equal processin...
International audienceWe consider the single machine dynamic total completion time scheduling proble...
Extensive research has been devoted to preemptive scheduling. However, little atten-tion has been pa...
Structural properties of optimal preemptive schedules have been studied in a number of recent papers...
This paper is devoted to basic scheduling problems in which the scheduling cost of a job is not a fu...
AbstractThis paper investigates the notion of preemption in scheduling, with earliness and tardiness...
It is known that the single machine preemptive scheduling problem of minimizing total completion tim...
AbstractIn this paper we study the problem of scheduling n deteriorating jobs with release dates on ...
It is well known that for preemptive scheduling on uniform machines there exist polynomial time exac...
It is well known that for preemptive scheduling on uniform machines there exist polynomial time exac...
Extensive research has been devoted to resource constrained project scheduling problem. However, lit...
It is well known that for preemptive scheduling on uniform machines there exist polynomial time exac...
It is well known that for preemptive scheduling on uniform machines there exist polynomial time exac...
It is well known that for preemptive scheduling on uniform machines there exist polynomial time exac...
It is well known that for preemptive scheduling on uniform machines there exist polynomial time exac...
We study the preemptive scheduling problem of a set of n jobs with release times and equal processin...
International audienceWe consider the single machine dynamic total completion time scheduling proble...
DOI
Add to ORKG