Scheduling in Computer and Manufacturing Systems

The objective of the seminar is to provide a forum for the discussion of current and proposed research in scheduling problems. The seminar will promote an exchange of ideas covering the entire spectrum from case studies of real applications to recent advances in mathematical foundations.

The seminar expects to address not only classical application areas such as distributed processing, operating systems, dependable systems, flexible manufacturing, etc. but also exciting new areas such as those in modern communications, examples being wireless networks, multimedia networks, and the internet.

The seminar will proceed along three broad fronts:

1. applications, which includes empirical studies of existing systems as well as numerical studies of the analyses or simulations of system models;
2. algorithmics, which includes the design and analysis of perhaps randomized algorithms ranging from simple and tractable on-line and greedy rules to methods based on semi-enumerative approaches, branch and bound, local neighborhood search, LP formulations, etc.;
3. theory, which includes recent results in complexity classification, approximability, approximation schemes, analysis of classical problems under novel (or multiple) criteria, etc.