Call for Participation
========================
MAPSP 2011
Tenth Workshop on Models and Algorithms for Planning
and Scheduling Problems
June 19-24, 2011
Nymburk, Czech Republic
http://www.mapsp.org/
mapsp@kam.mff.cuni.cz
------------------------------------------
*** Early registration is now open, until March 31 ***
*** List of accepted submissions and a preliminary schedule ***
*** available at the conference site ***
------------------------------------------
MAPSP is a biennial workshop dedicated to all theoretical and practical aspects
of scheduling, planning, and timetabling. Previous MAPSP meetings have been
held in Menaggio, Italy (1993), Wernigerode, Germany (1995), Cambridge, UK
(1997), Renesse, Netherlands (1999), Aussois, France (2001), Aussois, France
(2003), Siena, Italy (2005), Istanbul, Turkey (2007), and Kerkrade, Netherlands
(2009).
------------------------------------------
Invited speakers:
Bert Zwart (CWI, Amsterdam)
David Shmoys (Cornell University, Ithaca, NY)
Ralf Borndoerfer (Zuse Institute, Berlin)
Roman Bartak (Charles University, Prague)
Yossi Azar (Tel-Aviv University)
------------------------------------------
Plenary presentations:
Vincenzo Bonifaci and Alberto Marchetti-Spaccamela. Feasibility Analysis
of Sporadic Real-Time Multiprocessor Task Systems
Elisabeth Guenther, Marco Luebbecke and Rolf Moehring. Challenges in
Scheduling when Planning the Ship Traffic on the Kiel Canal
Kirk Pruhs and Clifford Stein. How To Schedule When You Have To Buy Your
Energy
Richard Cole, Jose Correa, Vasilis Gkatzelis, Vahab Mirrokni and Neil Olver.
Inner Product Spaces for MinSum Coordination Mechanisms
Alexander Souza, Antonios Antoniadis, Falk Hueffner, Pascal Lenzner and
Carsten Moldenhauer. Balanced Interval Coloring
Tim Nonner. Clique Clustering yields a PTAS for max-Coloring Interval
Graphs
Heiko Roeglin, Cyriel Rutten and Tjark Vredeveld. Smoothed performance
guarantees of local optima for multiprocessor scheduling
Natalia Shakhlevich. Divisible Load Scheduling to Minimize the Computation
Time and Cost
Rene Sitters. Efficient algorithms for average completion time scheduling
Nikhil Bansal and Kirk Pruhs. The Geometry of Scheduling
------------------------------------------
The program committee:
Nikhil Bansal (IBM Watson Research Center, Yorktown Heights)
Sanjoy Baruah (University of North Carolina, Chapel Hill)
Christoph Duerr (Ecole Polytechnique, Palaiseau)
Leah Epstein (University of Haifa, Haifa)
Monaldo Mastrolilli (IDSIA, Manno)
Rolf Moehring (Technische Universitaet Berlin, Berlin, chair)
Chris Potts (University of Southampton, Southampton)
Andreas Schulz (Massachusetts Institute of Technology, Cambridge, MA)
Jiri Sgall (Charles University, Prague, cochair)
Frits Spieksma (KU Leuven, Leuven)
Maxim Sviridenko (IBM Watson Research Center, Yorktown Heights)
Steef van de Velde (Erasmus University, Rotterdam)
Gerhard Woeginger (Technische Universiteit Eindhoven)
Guochuan Zhang (Zhejiang University, Hangzhou)
------------------------------------------
Organization:
Anna Kotesovcova, CONFORG s.r.o., conforg@conforg.cz
Jiri Sgall (Organizing Committee Chair), Charles University, Prague
------------------------------------------
Detailed workshop information is available at
http://www.mapsp.org/
------------------------------------------
--1908648465-1718588610-1299841803=:28998--
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
