We provide a monotone $O(m^{2/3})$-approximation algorithm for scheduling related machines with precedence constraints
This work presents an approximation algorithm for scheduling the tasks of a parallel application. Th...
AbstractWe present a polynomial time approximation algorithm for unit time precedence constrained sc...
We present an implementation of a very recent approximation algorithm for scheduling jobs on a singl...
We provide a monotone $O(m^{2/3})$-approximation algorithm for scheduling related machines with prec...
AbstractWe consider the problem of scheduling a set of jobs on a single machine with the objective o...
We give a (2+ϵ)-approximation algorithm for minimizing total weighted completion time on a single ma...
This work presents approximation algorithms for scheduling the tasks of a parallel application that ...
We obtain a new efficient approximation algorithm for scheduling precedence constrained jobs on mach...
Abstract. This paper investigates the relationship between the dimen-sion theory of partial orders a...
We consider the problem of designing monotone deterministic algorithms for scheduling tasks on relat...
We consider the scheduling problem of minimizing the average weighted job completion time on a singl...
AbstractWe study the problem of scheduling a single machine with the precedence relation on the set ...
We consider the single-machine scheduling problem to minimize the weighted sum of completion times u...
AbstractWe consider the problem of designing monotone deterministic algorithms for scheduling tasks ...
AbstractWe consider the scheduling problem of minimizing the average weighted job completion time on...
This work presents an approximation algorithm for scheduling the tasks of a parallel application. Th...
AbstractWe present a polynomial time approximation algorithm for unit time precedence constrained sc...
We present an implementation of a very recent approximation algorithm for scheduling jobs on a singl...
We provide a monotone $O(m^{2/3})$-approximation algorithm for scheduling related machines with prec...
AbstractWe consider the problem of scheduling a set of jobs on a single machine with the objective o...
We give a (2+ϵ)-approximation algorithm for minimizing total weighted completion time on a single ma...
This work presents approximation algorithms for scheduling the tasks of a parallel application that ...
We obtain a new efficient approximation algorithm for scheduling precedence constrained jobs on mach...
Abstract. This paper investigates the relationship between the dimen-sion theory of partial orders a...
We consider the problem of designing monotone deterministic algorithms for scheduling tasks on relat...
We consider the scheduling problem of minimizing the average weighted job completion time on a singl...
AbstractWe study the problem of scheduling a single machine with the precedence relation on the set ...
We consider the single-machine scheduling problem to minimize the weighted sum of completion times u...
AbstractWe consider the problem of designing monotone deterministic algorithms for scheduling tasks ...
AbstractWe consider the scheduling problem of minimizing the average weighted job completion time on...
This work presents an approximation algorithm for scheduling the tasks of a parallel application. Th...
AbstractWe present a polynomial time approximation algorithm for unit time precedence constrained sc...
We present an implementation of a very recent approximation algorithm for scheduling jobs on a singl...
DOI
Add to ORKG