The Edmonds–Pruhs protocol is a strategy used in the context of online algorithms, particularly for the problem of online scheduling. It was introduced by David Pruhs and Edith Cohen and is designed to minimize the total completion time of jobs that arrive over time without prior knowledge of future jobs. In online scheduling, jobs are presented one by one, and decisions must be made immediately without knowing the characteristics of future jobs (like their processing times).
Articles by others on the same topic
There are currently no matching articles.