Scheduling meetings at trade events with complex preferences

Andreas Ernst, Gaurav Singh, René Weiskircher

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

1 Citation (Scopus)


We present a complex scheduling problem where we want to plan meetings between customers and exhibitors at a trade event. One cause of the complexity of the problem is the general nature of the preferences expressed by the participants prior to the event. These map a set of requesters to a set of requested participants and express a preferred length of the meeting. A further source of complexity is that the quality of the solution not only depends on the realisation of the preferences in the solution but also on the distance covered by the customers. We present our solution method and the results of preliminary computational experiments.

Original languageEnglish
Title of host publicationICAPS 2008 - Proceedings of the 18th International Conference on Automated Planning and Scheduling
Number of pages7
Publication statusPublished - 2008
Externally publishedYes
EventInternational Conference on Automated Planning and Scheduling 2008 - Sydney, Australia
Duration: 14 Sept 200818 Sept 2008
Conference number: 18th (Proceedings)


ConferenceInternational Conference on Automated Planning and Scheduling 2008
Abbreviated titleICAPS 2008
Internet address

Cite this