-
Dynamic Scheduling of Parallel Computations
Structures of parallel programs are usually modeled by task graphs in the scheduling literature. Such graphs are sometimes obtained while compiling the parallel... -
Complexity of Task Graph Scheduling with Fixed Communication Capacity
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... -
On Unrelated Machine Scheduling with Precedence Constraints
In this paper, we consider the problem of scheduling tasks on unrelated parallel machines. Precedence constraints exist between the tasks, but their number is limited... -
Worst-Case Analysis of Scheduling Heuristics of Parallel Systems
It is well-known that most scheduling problems arising from parallel systems are NP-hard, even under very special assumptions. Thus various suboptimal algorithms, in... -
Scheduling UET-UCT Series-Parallel Graphs on Two Processors
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... -
Scheduling of Parallel Programs in Single-Bus Multiprocessor Systems
Consider a scheduling problem of parallel computations in multiprocessor systems. Let a parallel program be represented by a task graph, where vertices represent tasks... -
Single machine scheduling with chain structured precedence constraints and mi...
We consider a single machine scheduling problem. This problem has been solved for a medical laboratory. It comprises not only chain-structured precedence constraints,... -
Energy-aware scheduling : complexity and algorithms
In this thesis we have tackled a few scheduling problems under energy constraint, since the energy issue is becoming crucial, for both economical and environmental... -
Heuristic procedures for minimizing makespan and the number of required pallets
A heuristic procedure is developed for minimizing makespan in flow-shop scheduling problems. In comparison with current algorithms, our algorithm seems to result in an... -
Makespan minimisation on parallel batch processing machines with non-identica...
International audience -
Erratum to "Scheduling of a two-machine flowshop with availability constraint...
International audience -
Erratum to ''Johnson's algorithm : A key to solve optimally or approximately ...
International audience -
A Mathematical Model for HVLV Systems Scheduling and Optimization With Period...
International audience -
Optimizing performance and reliability on heterogeneous parallel systems: App...
International audience -
Approximations for the Two-Machine Cross-Docking Flow Shop Problem
International audience -
Smooth inequalities and equilibrium inefficiency in scheduling games
International audience -
On multiprocessor temperature-aware scheduling problems
International audience -
Scheduling trees with large communication delays on two identical processors
We consider the problem of scheduling trees on two identical processors in order to minimize the makespan. We assume that tasks have unit execution times, and arcs are... -
Scheduling the two-machine open shop problem under resource constraints for s...
International audience -
On the complexity of robotic flow shop with transportation constraints
International audience
