This demo implements a greedy algorithm for composing a schedule for given unit length tasks. Each task is characterized by a deadline and penalty id if will be schedules after the deadline. The goal is to schedule tasks so that the total penalty is minimum.
By clicking the button a random number of tasks will be generated and scheduled. In the coarse of the algorithm the generated tasks are sorted by penalties in descending order.