Monday, July 13

Efficient Scheduling Algorithms (Part I of II)

10:30 AM-12:30 PM
Room: Sidney Smith 2110

The main aim of this minisymposium is to discuss new algorithmic ideas for solving classical and new scheduling problems arising in manufacturing and communications systems. Among the traditional scheduling problems presented at the minisymposium will be the traveling salesman problem, m-machine flowshop, unit-time flowshop and parallel-machine flowshop. Some new, non-standard scheduling problems arising in real-life technological systems will be considered. For example, the speakers will discuss cyclic scheduling of robots, scheduling of bottlenecks in communications systems, and cyclic scheduling of replacements in multi-level systems. The focus will be on the design of efficient numerical algorithms.

For Part II, see MS10.

Organizers: Eugene Levner
Hebrew University of Jerusalem and Holon Center for Tech Education, Israel
Jeffrey Sidney
University of Ottawa, Canada
10:30 Optimal Flowshop Scheduling and Its Extensions
Hiroshi Kise, Kyoto Institute of Technology, Japan; Jinliang Chen, Applied Technology Co., Ltd., Japan; and Yoshiyuki Karuno, Kyoto Institute of Technology, Japan
11:00 Scheduling Precedence Constrained Unit-Time Operation Jobs on Identical Parallel Machines and in a Flow Shop
Vadim G. Timkovsky, Star Data Systems, Inc. and McMaster University, Canada
11:30 Scheduling Heuristics for Minimizing the Makespan
Jean-Marie Proth and Fabrice Chauvet, INRIA-Lorraine, France
12:00 Data-Correcting Combinatorial Algorithms with Applications to TSP
Boris Goldengorin, Mark Ebben, Gerard Sierksma, and Gert Tijssen, University of Groningen, The Netherlands
Program Program Overview Program-at-a-Glance Program Updates Speaker Index Registration Hotel Transportation

MMD, 5/29/98