ASAP Group University of Nottingham PlanSIG 2006
The 25th Workshop of the UK PLANNING AND SCHEDULING
Special Interest Group

Nottingham, UK
December 14-15, 2006

Plenary Sessions

Peter Brucker. The Job Shop Problem: Old and New Challenges.
Edmund Burke. Hyper-heuristics and their Employment on Search Problems.

Hyper-heuristic references

The following papers are published in the proceedings:
Proceedings of The 25th Workshop of the UK PLANNING AND SCHEDULING Special Interest Group (PlanSIG2006), Rong Qu (ed.), 14th-15th December. Nottingham, UK. ISSN 1368-5708. Table of Content

Full Papers

Maria Fox, Jonathan Gough and Derek Long
Using Learned Action Models in Execution Monitoring
Andrew Coles and Amanda Smith
Generic Types and their Use in Improving the Quality of Search Heuristics
Funlade T. Sunmola and Jeremy L.Wyatt
Model Transfer for Markov Decision Tasks via Parameter Matching
Michaėl Soulignac and Patrick Taillibert
Fast Trajectory Planning for Multiple Site Surveillance through Moving Obstacles and Wind
Mathijs deWeerdt and Roman van der Krogt
Inefficiencies in Task Allocation for Multiagent Planning with Bilateral Deals
Alexandra Coddington
Motivations for MADbot: a Motivated and Goal Directed Robot
M.A. Hakim Newton, John Levine, Maria Fox, Derek Long
Learning Macro-Actions Genetically from Plans
T.L. McCluskey and R.M. Simpson
Combining Constraint Based and Classical Formulations for Planning Domains
Andrew Coles and Amanda Smith
Simulating the use of Macro-Actions through Action Reordering
Sergio Jimenez, Andrew Coles and Amanda Smith
Planning in Probabilistic Domains using a Deterministic Numeric Planner
Alistair R. Clark, Reinaldo Morabito Neto and Eli A. V. Toso
Multi-period Production Setup-sequencing and Lot-sizing through ATSP Subtour Elimination and Patching
Olivier Marchetti and Alix Munier-Kordon
A Polynomial Algorithm for a Bi-criteria Cyclic Scheduling Problem
Srihari Narasimhan and Hans-Joachim Bungartz
Methods for Optimal Pedestrian Task Scheduling and Routing
Sanja Petrovic, William Leung, Xueyan Song and Santhanam Sundar
Algorithms for Radiotherapy Treatment Booking
Sonda Elloumi, Philippe Fortemps, Jacques Teghem and Taļcir Loukil
A New Bi-objective Approach using Clustering Tools to Solve the Multi-mode Resource Constraint Project Scheduling Problem
Roman Bartįk, Ondrej Cepek and Pavel Surynek
Modelling Alternatives in Temporal Networks
Javier Murillo and Beatriz Lopez
An Empirical Study of Planning and Scheduling Interactions in the Road Passenger Transportation Domain
Antonio Garrido, Eva Onaind“ia and Marlene Arangu
Using Constraint Programming to Model Complex Plans in an Integrated Approach for Planning and Scheduling

Short Papers

Marlies Vanhulsel, Davy Janssens and Geert Wets
Generating Dynamic Activity-Travel Schedules
Kaveh Sheibani
Fuzzy Greedy Search and Job-Shop Problem
N.E. Richardson, T. L. McCluskey and M.M. West
Towards Inducing HTN Domain Models from Examples
Patrick De Causmaecker, Peter Demeester and Greet Vanden Berghe
Evaluation of the University Course Timetabling Problem with the Linear Numberings Method

Programme Schedule

Each full paper is accolated 25 minutes including 5 minutes on questions. Abstracts are allocated 10 minutes. An OHP data projector and a laptop are provided for presentations. Presenters may also bring transparencies for their presentations. Please send Dr Rong Qu any other requirements concerning the presentations.