A single-machine scheduling problem with precedence delays is analyzed. A set of n tasks is to be scheduled on the machine in such a way that the makespan is minimized. The executions of the tasksâ€¦ (More)

The scheduling of task graphs on two identical processors is considered. It is assumed that tasks have unit-execution-time, and arcs are associated with unit-communication-time delays. The problem isâ€¦ (More)

The problem of scheduling a set of tasks on two parallel and identical processors is considered. The executions of tasks are constrained by precedence relations. The running times of the tasks areâ€¦ (More)

Consider a scheduling problem of parallel computations in multiproces-sor systems. Let a parallel program be represented by a task graph, where vertices represent tasks and arcs represent theâ€¦ (More)

The problem of scheduling partially ordered tasks on two identical processors is considered. It is assumed that tasks have unit execution time, and the arcs of the task graph are associated withâ€¦ (More)

Consider a scheduling problem of parallel computations in multipro-cessor systems. Let a parallel program be modeled by a task graph, where vertices represent tasks and arcs the communicationsâ€¦ (More)

Consider a scheduling problem of parallel computations in multiprocessor systems. Let a parallel program be modeled by a task graph, where vertices represent tasks and arcs the communications betweenâ€¦ (More)

This paper proposes a new method for solving the Machine Reassignment Problem in a very short computational time. The problem has been proposed by Google as subject of the Challenge ROADEF/EURO 2012.â€¦ (More)