This Plugin schedules jobs using the earliest due date (EDD) policy to sort them in a queue and then applies the greedy list scheduling Graham algorithm. Jobs $J_i$ from the queue are assigned to one of clusters  $\mathcal{M}$ using a greedy list-scheduling algorithm based on ~\cite{graham1969bmt,mounie07}. To this end, the Grid scheduler queries each organization $O_k$ about a list of free slots $\psi_{ki} \in \Psi_k, \psi_{ki}=(t',t'',m_{ki}) , i=1..|\Psi|$. Parameters $t'$ and $t''$ denote start and time of a slot, respectively. $m_{ki}$ is a number of processors available within the slot $i$ at organization $O_k$. Slots are time periods within which a number of available processors is constant. The Grid scheduler sorts collected slots by increasing start time. The schedule is constructed by assigning jobs in the Grid scheduler's queue to processors in given slots in a greedy manner. For each slot $\psi_{kI}$ (starting from the earliest one) the scheduler chooses from its queue the first job $J_j$ requiring no more than $m_{ki}$ processors in all subsequent slots $i \geq I$ such as $t''_{ki} \geq t'_{kI} + p_j$. If such a job was find the scheduler schedules it to be started at $t'_{kI}$, and removes it from the queue. If there is no such a job, the scheduler apply the same procedure to the next free slot whose number of available processors is larger than the current one.