textabstractWe give a (2+ϵ)-approximation algorithm for minimizing total weighted completion time on a single machine under release time and precedence constraints. This settles a recent conjecture on the approximability of this scheduling problem (Skutella, 2016)
This work reviews the most important results regarding the use of the α-point in Scheduling Theory. ...
We consider parallel, identical machine scheduling problems, where the jobs are subject to precedenc...
There has been recent success in using polyhedral formulations of scheduling problems not only to ob...
We give a (2+ϵ)-approximation algorithm for minimizing total weighted completion time on a single ma...
AbstractWe consider the problem of scheduling a set of jobs on a single machine with the objective o...
We consider the scheduling problem of minimizing the average weighted job completion time on a singl...
AbstractWe consider the scheduling problem of minimizing the average weighted job completion time on...
AbstractWe consider the scheduling problem in which jobs with release times and delivery times are t...
We consider the single-machine scheduling problem to minimize the weighted sum of completion times u...
A natural and basic problem in scheduling theory is to provide good average quality of service to a ...
We study a single-machine scheduling problem that is a generalization of a number of problems for wh...
AbstractWe study the problem of scheduling a single machine with the precedence relation on the set ...
A well studied and difficult class of scheduling problems concerns parallel machines and precedence ...
We consider the scheduling problem of minimizing the average weighted completion time of n jobs with...
Abstract. In this paper we study the problem of minimizing the weighted sum of completion times of j...
This work reviews the most important results regarding the use of the α-point in Scheduling Theory. ...
We consider parallel, identical machine scheduling problems, where the jobs are subject to precedenc...
There has been recent success in using polyhedral formulations of scheduling problems not only to ob...
We give a (2+ϵ)-approximation algorithm for minimizing total weighted completion time on a single ma...
AbstractWe consider the problem of scheduling a set of jobs on a single machine with the objective o...
We consider the scheduling problem of minimizing the average weighted job completion time on a singl...
AbstractWe consider the scheduling problem of minimizing the average weighted job completion time on...
AbstractWe consider the scheduling problem in which jobs with release times and delivery times are t...
We consider the single-machine scheduling problem to minimize the weighted sum of completion times u...
A natural and basic problem in scheduling theory is to provide good average quality of service to a ...
We study a single-machine scheduling problem that is a generalization of a number of problems for wh...
AbstractWe study the problem of scheduling a single machine with the precedence relation on the set ...
A well studied and difficult class of scheduling problems concerns parallel machines and precedence ...
We consider the scheduling problem of minimizing the average weighted completion time of n jobs with...
Abstract. In this paper we study the problem of minimizing the weighted sum of completion times of j...
This work reviews the most important results regarding the use of the α-point in Scheduling Theory. ...
We consider parallel, identical machine scheduling problems, where the jobs are subject to precedenc...
There has been recent success in using polyhedral formulations of scheduling problems not only to ob...
DOI
Add to ORKG