Machine Scheduling Problems
from 03:00 PM to 04:00 PM
In order to manufacture cars, books, or cell phones, it is typically necessary to carry out a complex collection of tasks in some specific order. It is often necessary that before certain tasks can be done, other tasks first have to be completed. A typical goal is to determine the earliest possible completion time for the tasks given information about the number of machines available to do the work. Mathematics offers a variety of tools ranging from integer programming methods to graph theory methods to solve such scheduling problems. These same methods can often be applied to scheduling airplane takeoffs, scheduling operations in an operating theater, or getting through your daily chores in a more efficient manner.
This will be a self-contained presentation. No prior knowledge is required.
Refreshments will be served.