MAPSP

2009

Program & Invited Speakers

Conference Schedule
 
Sunday June 28   Arrival
Monday June 29 8:50-18:20 Scientific program
    19:00 Welcome reception
Tuesday June 30 9:00-18:20 Scientific program
Wednesday July 1 9:00-12:00 Scientific program
    14:00 Social event
    18:30 Conference dinner
Thursday July 2 9:00-18:20 Scientific program
Friday July 3 9:30-12:20 Scientific program
    14:30 Closing

Invited Speakers

Sanjoy K.
Baruah
University of North Carolina
Chandra Chekuri University of Illinois
Friedrich Eisenbrand École Polytechnique Fédérale de Lausanne
Tim Roughgarden Stanford University
Frits C.R. Spieksma Katholieke Universiteit Leuven

A printable version of the program can be found here
 

Detailed Program per Day

Monday Tuesday Wednesday Thursday Friday

Program Thursday

9:00 Invited Speaker: Tim Roughgarden.
Scheduling in Algorithmic Game Theory
9:50 Plenary:
Nikhil Bansal and Subhash Khot.
On hardness of minimizing weighted completion time with precedence constraints
10:20  Coffee Break
11:00 Parallel Sessions
  Session A Session B
  Monaldo Mastrolilli, Nikolaus Mutsanas and Ola Svensson.
Approximating Single Machine Scheduling with Scenarios
Lucio Bianco and Massimiliano Caramia.
The Resource Constraints Project Scheduling Problem with Feeding Precedence Relations: A Lower Bound
  Philippe Baptiste.
Scheduling Identical Coupled Tasks in Constant Time (almost)
Tomáš Ebenlendr and Jiří Sgall.
A lower bound for scheduling of unit jobs with immediate decision on parallel machines
  Ondřej Zajíček, Jiri Sgall and Tomáš Ebenlendr.
Scheduling Parallel Jobs on Hypercubes
Cédric Pessan, Mohamed Haouari and Emmanuel Néron.
Energetic reasoning and production resetting optimization
  Marjan van den Akker, Han Hoogeveen and Guido Diepen.
More Efficient Algorithms for Resource Constrained Project Scheduling Problems
Dirk Briskorn, Byung-Cheon Choi, Kangbok Lee, Joseph Leung and Michael Pinedo.
Single machine scheduling with regard to inventory constraints
12:30 Lunch
14:30 Parallel Sessions
  Session A Session B
  Christoph Dürr and Nguyen Kim Thang.
Non-Clairvoyant Scheduling Games
Mikhail Y. Kovalyov and Erwin Pesch.
A generic approach to proving NP-hardness of partition type scheduling and other combinatorial problems
  Alberto Marchetti-Spaccamela, Nicole Megow, Martin Skutella and Leen Stougie.
Price of robustness in single machine scheduling
Alix Munier-Kordon and Djamal Rebaine.
Scheduling coupled unit-time operations on identical parallel machines
  Clemens Thielen.
Generalized Truthful Mechanisms for Scheduling Verifiable Related Machines
John J.J. van den Broek and Cor A.J. Hurkens.
A branch and bound algorithm for job shops with no-wait and blocking precedence constraints
  Leah Epstein, Elena Kleiman and Rob van Stee.
Maximizing the Minimum Load: The Cost of Selfishness
David Sotelo Pinheiro da Silva and Marcus Poggi.
A Linear-time Approximation Algorithm for Permutation Flow Shop Scheduling Problem
15:50 Coffee Break
16:20 Plenary:
Tomáš Ebenlendr, Marek Krčál and Jiří Sgall.
Graph Balancing: A Special Case of Scheduling Unrelated Parallel Machines
16:50 Short Break & Room Change
17:00 Parallel Sessions
  Session A Session B
  Andrei Horbach and Dirk Briskorn.
An exact method for Scheduling Real World Sports Leagues
János Balogh, József Békési, Gábor Galambos and Miklós Krész.
Model and Algorithm for a Vehicle Scheduling Problem with Refueling
  Wiebke Höhn, Felix G. König, Marco E. Lübbecke and Rolf H. Möhring.
Scheduling in Coil Coating with Shuttles
Alexander Grigoriev and Alexander Kononov.
How to price parallel machines to maximize the revenue
  Benjamin Hiller, Torsten Klug and Andreas Tuchscherer.
Improving the performance of elevator systems using exact reoptimization algorithms
Andries E. Brouwer, Gerhard Post and Gerhard J. Woeginger.
Tight bounds for break minimization in tournament scheduling
  Monika Henzinger, Ana Radovanovic and Clifford Stein
Scheduling a Large Datacenter
Cyriel Rutten.
Scheduling in a complex setting
19:00 Dinner