Sciweavers

47 search results - page 3 / 10
» Parallel machine scheduling with precedence constraints and ...
Sort
View
APPROX
2006
Springer
162views Algorithms» more  APPROX 2006»
13 years 9 months ago
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
IPCO
2007
98views Optimization» more  IPCO 2007»
13 years 6 months ago
Scheduling with Precedence Constraints of Low Fractional Dimension
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...
Christoph Ambühl, Monaldo Mastrolilli, Nikola...
CLUSTER
2005
IEEE
13 years 11 months ago
Static scheduling of dependent parallel tasks on heterogeneous clusters
This paper addresses the problem of scheduling parallel tasks, represented by a direct acyclic graph (DAG) on heterogeneous clusters. Parallel tasks, also called malleable tasks, ...
Jorge G. Barbosa, C. N. Morais, R. Nobrega, A. P. ...
CPAIOR
2004
Springer
13 years 10 months ago
A New Exact Solution Algorithm for the Job Shop Problem with Sequence-Dependent Setup Times
Abstract. We propose a new solution approach for the Job Shop Problem with Sequence Dependent Setup Times (SDST-JSP). The problem consists in scheduling jobs, each job being a set ...
Christian Artigues, Sana Belmokhtar, Dominique Fei...
AIPS
2009
13 years 6 months ago
Just-In-Time Scheduling with Constraint Programming
This paper considers Just-In-Time Job-Shop Scheduling, in which each activity has an earliness and a tardiness cost with respect to a due date. It proposes a constraint programmin...
Jean-Noël Monette, Yves Deville, Pascal Van H...