Scheduling problems are in the mainstream of operations research, industrial engineering, manufacturing systems and computer science. More particularly, scheduling theory deals with executing a set of constrained tasks on a set of machines/processors. In such context, scheduling problems concerns:
- job shop, flow shop, open shop,
- scheduling problems in presence of communication delay
In this context, we propose to study several scheduling problems in point of view in complexity and approximation according to various parameters and constraints (single machine and compatibility constraints between coupled-tasks, minimizing hole in multiprocessor model, robustness for example if the task-characteristic is uncertain ….).