10 May 2012
An Efficient Algorithm for Finding Ideal Schedules
Free Event • Registration Required
In this talk we address the problem of scheduling UET jobs with release dates and precedence constraints on two identical processors.
We say that a schedule is ideal if it minimises both maximum and total completion time simultaneously. We give an instance of the problem showing that ideal schedules do not exist in general when preemptions are allowed. If preemptions are not allowed, then ideal schedules do exist for general precedence constraints, and we describe an algorithm for finding ideal schedules in O(n^3) time, where n is the number of jobs. (joint work with Ed Coffman and Darek Dereniowski)
See all our tweets »
Follow @warwickbschool on TwitterExplore our company information and connect with students, staff and WBS alumni on business network site LinkedIn.
We run an active group with over 12,000 members for current students, staff and alumni. If that's you, join the WBS LinkedIn group now.
We also maintain a group catering to prospective students - if you're thinking of joining us at WBS in the future, why not join the group now?
MSc Finance: Gary Ewen describes his time on the MSc Finance at WBS. He discusses the programme, the flexible electives, his real world placement and the job he is going onto.
MSc Finance with Behavioural Science: Nataliia Lipikhina describes the study programme on MSc Finance with Behavioural Science and provides an overview of the dissertation process and the careers support available.
Browse our videos on YouTube »
Join us, or see our latest posts:
Find us on Google+