Sunday, July 12

CP2
Scheduling

10:30 AM-12:30 PM
Chair: Ortrud R. Oellermann, The University of Winnipeg, Canada;
Room: Sidney Smith 1074

10:30 Non-Approximability Results for Scheduling Problems with Minsum Criteria

Han Hoogeveen and Petra Schuurman, Eindhoven University of Technology, The Netherlands; and Gerhard Woeginger, Technical Universität Graz, Austria

10:30 Total Weighted Completion Time Scheduling for Superblocks

Ivan Baev and Waleed Meleis, Northeastern University

10:50 Scheduling Equal-length Jobs on Identical Machines

Nodari Vakhania, Universidad Autonoma del Estado de Morelos, Mexico

11:10 The Average Connectivity of a Graph

Ortrud R. Oellermann, The University of Winnipeg, Canada; Lowell Beineke and Raymond Pippert, Indiana University - Purdue University, Fort Wayne

11:30 Priority Queues of M/G/1 Type with Exponentially-Bounded Waiting-Time

Mikhail Postan, Odessa State Maritime University, Ukraine