List of Participants

List of participants

Evripidis Bampis
Université d'Évry
- Scheduling and algorithmic game theory
Nikhil Bansal
IBM Res. Center, New York
- Scheduling on unrelated parallel machines to maximize the minimum load
Philippe Baptiste
Ecole Polytechnique, Paris
- On minimizing the number of idle time intervals : An application to power management
Michael Bender
Stony Brook Univ., New York
- Scheduling Algorithms for Procrastinators
Florent Blachot
ST, France
- SCAN : a Heuristic for Near-Optimal Software Pipelining
Jacek Blazewicz
Poznan Univ. of Technology
- Quay crane allocation as a moldable task scheduling problem
Dirk Briskorn
Universität zu Kiel
- Round robin tournaments and three index assignment
David Bunde
University of Illinois
- Power-aware scheduling for makespan and flow
Edmond Burke
University of Nottingham
- Runway Scheduling at Heathrow Airport
Jacques Carlier
Université de Technologie de Compiègne
- New lower bounds for the two-dimensional bin-packing problem
Andrei Chernykh
Cicese, Ensenada
- Admissible Resource Selection Strategies in Two Level Job-Scheduling for a Computational Grid
Gennaro Cordasco
Universita di Salerno
- Advanced in a Dag-Scheduling Theory for Internet-Based Computing
Florian Diedrich
Universität zu Kiel
- Approximation algorithms for a three-dimensional orthogonal knapsack problem
Frank Drews
Ohio University
- QoS-based Management of Multiple Shared Resource in Dynamic Real-Time Systems
Maciej Drozdowski
Poznan Univ. of Technology
- Scheduling multiple divisible loads in star systems
Benoît Dupont de Dinechin
ST, France
- Scheduling monotone sub-chain orders on typed task systems
Pierre-François Dutot
Loria, Nancy
- Scheduling trees of tasks for parallel mutifrontal methods
Klaus Ecker
TU Clausthal
- QoS-based Management of Multiple Shared Resource in Dynamic Real-Time Systems
Adel Essafi
ESSTT, Tunis
Lionel Eyraud-Dubois
LIG, Grenoble
- Scheduling with reservations
Alain Girault
LIG, Grenoble
- Reliability versus performance for embedded real-time applications
Valery Gordon
UIIP, Belarus
- Cyclic Properties of Locally Connected Graphs with Bounded Vertex Degree
Abdou Guermouche
Labri, Bordeaux
- Scheduling trees of tasks for parallel mutifrontal methods
Mathilde Hurand
École Polytechnique
- Finding total unimodularity in optimization problems solved by linear programs
Andreas Jakoby
Universität zu Lübek
Graham Kendall
University of Nottingham
- Football Fixture Scheduling in England
Tamas Kis
MTA Sztaki, Budapest
- An auction mechanism for scheduling batches on uniform machines
Mikhail Y. Kovalyov
UIIP, Belarus
- Batching Deteriorating Items
Axel Krings
University of Idaho
- Primary-backup Link Scheduling for Wireless Networks Operating in Hostile Environments
Wieslaw Kubiak
Memorial Univ. of Newfoundland
- Characterization of just in time sequencing via apportionment
Vitus Leung
Sandia National Laboratories
- Fairness in Job Scheduling on Cplant
Feryal-Kamila Moulaï
LIG, Grenoble
- Scheduling with deployment
Alix Munier
Université Paris 12
- Cyclic Scheduling with Latencies
Ceyda Oguz
Koc University, Istanbul
- Minimizing Total Weighted Completion Time on Two Dedicated Processors with Preemptive Multiprocessor Tasks
Jonathan Pecero-Sanchez
LIG, Grenoble
- Scheduling applications with uncertainties on new computing platforms
Matthieu Pérotin
Université de Tours
Erwin Pesch
Universität Siegen
Cindy Phillips
Sandia National Laboratories
- Communication-Aware Processor Allocation for Supercomputers
Jean-François Pineau
LIP - ENS Lyon
Christopher Potts
University of Southampton
- Cyclic Properties of Locally Connected Graphs with Bounded Vertex Degree
Kirk Pruhs
University of Pittsburgh
- Speed Scaling for Weighted Flow
Rajmohan Rajaraman
Northeastern Univ., Boston
- Multiprocessing scheduling under uncertainty
Jean-Louis Roch
LIG, Grenoble
- Processor-oblivious parallel algorithms and scheduling: illustration on parallel prefix
Krzysztof Rzadca
PJIIT, Warsaw
- Prisoner's Dilemma in Heterogeneous Grids
Erik Saule
LIG, Grenoble
- Reliability versus performance for embedded real-time applications
Silke Schomann
TU Clausthal
Frits Spieksma
Katholieke Univ. Leuven
- Connectivity measures for internet topologies
Cliff Stein
Columbia University
- Proportional Share Scheduling
Malgorzata Sterna
ICS, Poznan
- Late Work Minimization in a small Flexible Manufacturing System
Vitaly Strusevich
University of Greenwich
- Scheduling Pairs of Jobs on Two Machines
Eric Torng
Michigan State University
- Mixed criterion scheduling
Denis Trystram
LIG, Grenoble
- Scheduling applications with uncertainties on new computing platforms
Steef van de Velde
Erasmus Univ. Rotterdam
Frédéric Vivien
LIP - ENS Lyon
- Minimizing the stretch when scheduling flows of divisible requests
Frédéric Wagner
Loria, Nancy
- Data Redistribution between Distant Clusters using both Local and Wide Area Networks
Jan Weglarz
Poznan Univ. of Technology
- Multicriteria scheduling on the Grid
Frank Werner
University of Magdeburg
- A Comparison of Heuristics for Mean Flow Time Open Shop Scheduling
Dominique de Werra
EPFL-SB-IMA, Lausanne
- A NP-complete problem
Guochuan Zhang
Zhejiang University, China
- Online scheduling with hard deadlines