which proposes a background utilities for easy develop (rapid prototyping) and implementation of scheduling algorithms. Basic algorithms which are frequently used or which can be implemented as a part of complex algorithms are prepared too. The background utilities are divided into two categories. First one provides routines for classical scheduling problems implementation. Second one is intended for graph theory algorithms support. Both parts are closely related. Classical scheduling problems utilities are described in . Briefly, we can mention that main utilities are objects representing tasks and set of tasks. Task is a basic term in scheduling and describes any unit of work that is scheduled and executed by the system. The task is described by the following parameters: Name, Processing time, Release time, Deadline, Due date, Weight and Processor. Set of task is represented by taskset object which collects individual tasks and some additional parameters for example precedence constrains, user parameters, graphics representation parameters and so on. Newly, you can create taskset directly, without tasks preparing previously. This is possible by implication “dot-parentheses” syntax implementation to the object properties access. This access method is implemented fo
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.