New algorithms that learn from related problems may generalize well, finding near-optimal schedules in a shorter, more practical amount of runtime. Traditional schedulers typically suffer from one of two drawbacks: high computational load or poor performance. An example schedule is shown below.Ī variety of classic schedulers are provided in the algorithms subpackage: To be valid (as assessed using util.check_schedule), the execution times, execution channels, and task durations must be such that no two tasks on the same channel are executing at the same time.Įach algorithm is a Python callable implementing the same API it takes two leading positional arguments tasks and ch_avail and returns the schedule array sch. c, execution channels ( int, in range(len(ch_avail))).
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |