Dynamic priority scheduling

This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Dynamic priority scheduling" – news · newspapers · books · scholar · JSTOR (May 2016) (Learn how and when to remove this message)

Dynamic priority scheduling is a type of scheduling algorithm in which the priorities are calculated during the execution of the system. The goal of dynamic priority scheduling is to adapt to dynamically changing progress and to form an optimal configuration in a self-sustained manner. It can be very hard to produce well-defined policies to achieve the goal depending on the difficulty of a given problem.

Earliest deadline first scheduling and Least slack time scheduling are examples of Dynamic priority scheduling algorithms.