An information sheet with some practical information on MAPSP 2009 can be found here.
The 9th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2009) will be
located at Conference-centre and Hotel Rolduc,
Kerkrade, The Netherlands, in the week June 29 - July 03, 2009.
You can book a
room directly at Rolduc.
There are two types of rooms available, A and B. There
are only limited number of rooms per type available. Rooms are assigned on a first-come-first-serve base.
suite rooms (shower or bath) with telephone, TV and radio alarm
||Single room € 61
and double room € 42
Rooms include a washbasin and/or shower and alarm clock
radio. Toilets and bathrooms in adjacent corridor.
||Single room € 37
and double room € 28
are per person per night. Including breakfast, but excluding tourist tax (€ 1,10 per person per
To reserve a room,
you can use the
Group Reservation on the website of Rolduc. Please enter "Participant MAPSP 2009" in
the field "Other
questions or comments:". If you want to share a room, you can
also mention the name of your roommate. Please note that you
need only one booking for a double room. Notice that there is no
need to select a conference room.
Attend our brown
bag session and test CP Optimizer with our expert!
If you have detailed scheduling problems that involve a lot of
custom code or search goals, require significant tuning and are
difficult to maintain or modify and would like to solve these
problems with a model and run development process, then come and
try the new CP Optimizer at one of our hands-on session.
On Monday, Tuesday and Wednesday, ILOG an IBM company will run a
hands-on session from 12:30 to 14:00 on CP Optimizer (http://www.ilog.com/products/cpoptimizer/).
Number of seats is limited so please send us an email at
email@example.com to book in advance or for other
queries. For the participants of the hands-on session, lunch
will be served in the room of the session.
What will I learn
o Introduction to the modeling framework of IBM ILOG CP
o Testing IBM ILOG CP Optimizer on some predefined models
o Model and solve my first scheduling model with IBM ILOG
o Solve hard and soft scheduling problems
What do I need?
All you need is to bring your laptop (Windows 32 bit or Linux 32
ILOG will provide you with the latest version of CP Optimizer
and a licence key. You can share your laptop with one of your
colleagues if needed.
Enjoy the conference and make sure to register for the hands-on
Product Manager Optimization
ILOG an IBM company
In the afternoon of Wednesday 1 July, we make a
trip to the beautiful city of Maastricht. We
leave Abbey Rolduc around 14:30. After that we
make a 1.5 hour guided tour through Maastricht
on a step
scooter, followed by a drink, and around
18:00 we move on to the conference dinner, which
takes place inside the caves
of south Limburg. We however need your input
as we have to order the right number of
step-scooters and organize the transportation. Please
help us by choosing one of the following options:
We would like to continue the Dutch MAPSP
tradition of playing soccer at lunch or early
evening. Steef van de Velde has been so kindly
offering to bring the ball and cones. Please
bring appropriate attire if you would like to
The MAPSP Steering
Committee is currently soliciting
local organizers for MAPSP 2011.
Potentially interested parties
should send short proposals of say
1/2 page to Kirk Pruhs.
Gaiapark: A beautiful little zoo in Kerkrade; About 2.8 km
(walking) from Abbey Rolduc.
Mondoverde: A park with four different themes: the superb world gardens, the exciting Dinofauna, the diverse zoo and the magnificent attractions.
About 15 minutes by bus.
Snowworld Landgraaf: The worlds largest indoor winter sports resort. About 20 minutes by bus.
City of Maastricht: There is a direct train from Kerkrade to Maastricht (about 45 minutes ). From Rolduc it is about 2km to the
train station in Kerkrade.
City of Aachen: There is a direct train from Herzogenrath to Aachen (about 15 minutes ). From Rolduc it is about 2km to the train station in Herzogenrath.