In this paper we deal with multiprocessor task scheduling with ready times and prespecified processor allocation. In the studied problem tasks are not initially all available in the scheduler and can be executed only by a given ready time. Moreover, a task can be examined in order to be processed only when it enters the scheduler. For this class of problems we developed some algorithms which schedule tasks in the attempt to minimize the makespan. We provide experiments on various scenarios, computing also the mean flow time spent by each task in the system.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.