Bampis Evripidis

Evripidis Bampis

Information about the author Evripidis Bampis will soon be added to the site.
Found 14 papers in total
The complexity of short schedulesfor uet bipartite graphs
The complexity of short schedulesfor uet bipartite graphs
1999
We show that the problem of deciding if there is a schedule of length three for the...
On truthfulness and approximation for scheduling selfish tasks
On truthfulness and approximation for scheduling selfish tasks
2009
We consider the problem of designing truthful mechanisms for scheduling n tasks on a...
How good are shortest processing time (SPT) schedules for fair optimality criteria?
How good are shortest processing time (SPT) schedules for fair optimality criteria?
2008
We consider the following scheduling setting: a set of n tasks have to be executed on...
Bicriteria scheduling for contiguous and non-contiguous parallel tasks
Bicriteria scheduling for contiguous and non-contiguous parallel tasks
2008
We study the problem of scheduling on k identical machines a set of parallel tasks...
An exponential (matching based) neighborhood for the vehicle routing problem
An exponential (matching based) neighborhood for the vehicle routing problem
2008
We introduce an exponential neighborhood for the Vehicle Routing Problem with unit...
Scheduling trees with large communication delays on two identical processors
Scheduling trees with large communication delays on two identical processors
2005
We consider the problem of scheduling trees on two identical processors in order to...
Bicriteria approximation algorithms for scheduling problems with communications delays
Bicriteria approximation algorithms for scheduling problems with communications delays
2005
We study the problem of simultaneously minimizing the makespan and the average...
A note on scheduling to meet two min-sum objectives
A note on scheduling to meet two min-sum objectives
2007
We consider a single machine scheduling problem with two min-sum objective functions:...
On the parallel complexity of the alternating Hamiltonian cycle problem
On the parallel complexity of the alternating Hamiltonian cycle problem
1999
Given a graph with colored edges, a Hamiltonian cycle is called alternating if its...
The complexity of short schedules for unit execution time bipartite graphs
The complexity of short schedules for unit execution time bipartite graphs
1999
We show that the problem of deciding is there is a schedule of length three for the...
On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications
On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications
2002
We consider the unit execution time unit communication time (UET-UCT) scheduling model...
A polynomial time approximation scheme for the average weighted completion time problem on unrelated machines
A polynomial time approximation scheme for the average weighted completion time problem on unrelated machines
2000
We study the problem of scheduling n independent weighted jobs on a constant number of...
On the complexity of scheduling with large communication delays
On the complexity of scheduling with large communication delays
1996
Given a directed acyclic graph (DAG) with unit execution time tasks and constant...
Minimizing the overhead for some tree-scheduling problems
Minimizing the overhead for some tree-scheduling problems
1996
This paper is devoted to the study of tree-scheduling problems within the execution...
Papers per page: