This is a preview. Log in through your library . Abstract We introduce a combinatorial approach for studying multiple-processor scheduling problems that involve the preemptive scheduling of ...
The proposed algorithm combines variational scheduling with post-processing to achieve near-optimal solutions to combinatorial optimization problems with constraints within the operation time of ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results