This paper is concerned with scheduling when the data are not fully known before the execution. In that case computing a complete schedule off-line with estimated data may lead to poor performances. Some flexibility must be added to the scheduling process. We propose to start from a partial schedule and to postpone the complete scheduling until execution, thus introducing what we call a stabilization scheme. This is applied to the m machine problem with communication delays: in our model an estimation...
We deal here with a scheduling problem () which is an extension of both the well-known and the . We first propose a reformulation of : according to it, solving means finding a vertex of the of an . Next, we state several theoretical results related to this reformulation process and to structural properties of this specific (connectivity, ...). We end by focusing on the preemptive case of and by identifying specific instances of which are such that any vertex of the related may be projected...
This paper is concerned with scheduling when the data are not fully known
before the execution. In that case computing a complete schedule off-line
with estimated data may lead to poor performances. Some flexibility must be
added to the scheduling process. We propose to start from a partial schedule and to postpone the complete scheduling until execution, thus introducing what we call a stabilization
scheme. This is applied to the m machine problem with communication
delays: in our model an estimation...
Download Results (CSV)