Main page

Registration details

Schedule

Participants

List of Abstracts

CIRM website

Schedule

Monday

9h00 - 10h30: Manufacturing problems

• Characterization of just in time sequencing via apportionment
  Wieslaw Kubiak
• Quay crane allocation as a moldable task scheduling problem
  Jacek Blazewicz
• Late Work Minimization in a small Flexible Manufacturing System
  Malgorzata Sterna

11h - 12h: Batch problems

• Scheduling Pairs of Jobs on Two Machines
  Vitaly Strusevich
• Batching Deteriorating Items
  Mikhail Y. Kovalyov

12h30 - 13h30: Lunch

16h - 17h30: Game theory for Scheduling

• An auction mechanism for scheduling batches on uniform machines
  Tamas Kis
• Prisoner's Dilemma in Heterogeneous Grids
  Krzysztof Rzadca
• Scheduling and algorithmic game theory
  Evripidis Bampis

18h - 19h: Bicriteria optimization

• Scheduling with deployment
  Feryal-Kamila Moulaï
• Mixed criterion scheduling
  Eric Torng

Tuesday

9h - 10h40: Task and Communication Scheduling

• Scheduling on unrelated parallel machines to maximize the minimum load
  Nikhil Bansal
• Data Redistribution between Distant Clusters using both Local and Wide Area Networks
  Frédéric Wagner
• Scheduling with reservations
  Lionel Eyraud-Dubois
• Processor-oblivious parallel algorithms and scheduling: illustration on parallel prefix
  Jean-Louis Roch

11h - 12h15: Divisible Scheduling

• Scheduling multiple divisible loads in star systems
  Maciej Drozdowski
• Minimizing the stretch when scheduling flows of divisible requests
  Frédéric Vivien
• Primary-backup Link Scheduling for Wireless Networks Operating in Hostile Environments
  Axel Krings

12h30 - 13h30: Lunch

17h - 17h50: Grid and Internet Computing 1

• Multicriteria scheduling on the Grid
  Jan Weglarz
• Advanced in a Dag-Scheduling Theory for Internet-Based Computing
  Gennaro Cordasco

18h10 - 19h: Grid and Internet Computing 2

• Admissible Resource Selection Strategies in Two Level Job-Scheduling for a Computational Grid
  Andrei Chernykh
• Connectivity measures for internet topologies
  Frits Spieksma

Wednesday

9h - 10h40: Applications 1

• Scheduling trees of tasks for parallel mutifrontal methods
  Abdou Guermouche
• Minimizing Total Weighted Completion Time on Two Dedicated Processors with Preemptive Multiprocessor Tasks
  Ceyda Oguz
• Fairness in Job Scheduling on Cplant
  Vitus Leung
• Proportional Share Scheduling
  Cliff Stein

11h - 12h15: Scheduling with Uncertainties

• Scheduling applications with uncertainties on new computing platforms
  Denis Trystram
• Multiprocessing scheduling under uncertainty
  Rajmohan Rajaraman
• A NP-complete problem
  Dominique de Werra

Thursday

9h - 10h40: Packing problems

• New lower bounds for the two-dimensional bin-packing problem
  Jacques Carlier
• Approximation algorithms for a three-dimensional orthogonal knapsack problem
  Florian Diedrich
• Runway Scheduling at Heathrow Airport
  Edmond Burke
• On minimizing the number of idle time intervals : An application to power management
  Philippe Baptiste

11h - 12h15: Scheduling for embedded systems

• Reliability versus performance for embedded real-time applications
  Erik Saule
• Speed Scaling for Weighted Flow
  Kirk Pruhs
• Scheduling monotone sub-chain orders on typed task systems
  Benoît Dupont de Dinechin

12h30 - 13h30: Lunch

16h50 - 18h05: Cyclic Scheduling

• Cyclic Scheduling with Latencies
  Alix Munier
• SCAN : a Heuristic for Near-Optimal Software Pipelining
  Florent Blachot
• Power-aware scheduling for makespan and flow
  David Bunde

18h25 - 19h15: Applications 2

• Football Fixture Scheduling in England
  Graham Kendall
• Round robin tournaments and three index assignment
  Dirk Briskorn

Friday

9h - 10h40: Miscellaneous

• Cyclic Properties of Locally Connected Graphs with Bounded Vertex Degree
  Valery Gordon
• A Comparison of Heuristics for Mean Flow Time Open Shop Scheduling
  Frank Werner
• Finding total unimodularity in optimization problems solved by linear programs
  Mathilde Hurand
• QoS-based Management of Multiple Shared Resource in Dynamic Real-Time Systems
  Klaus Ecker

11h - 12h15: Variations on parallel processing scheduling

• Online scheduling with hard deadlines
  Guochuan Zhang
• Scheduling Algorithms for Procrastinators
  Michael Bender
• Communication-Aware Processor Allocation for Supercomputers
  Cindy Phillips