Open Problems in Throughput Scheduling

author: Jiří Sgall, Computer Science Institute (CSI), Charles University Prague
published: Oct. 2, 2012,   recorded: September 2012,   views: 2721


Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.


In this talk we survey the area of scheduling with the objective to maximize the throughput, i.e., the (weighted) number of completed jobs. We focus on several open problems.

See Also:

Download slides icon Download slides: algo2012_sgall_throughput_scheduling_01.pdf (799.7 KB)

Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: