Scheduling meetings at trade events with complex preferences

Andreas Ernst, Gaurav Singh, René Weiskircher

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

Abstract

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
Pages76-82
Number of pages7
Publication statusPublished - 2008
Externally publishedYes
EventInternational Conference on Automated Planning and Scheduling 2008 - Sydney, Australia
Duration: 14 Sep 200818 Sep 2008
Conference number: 18
http://icaps08.icaps-conference.org/

Conference

ConferenceInternational Conference on Automated Planning and Scheduling 2008
Abbreviated titleICAPS 2008
CountryAustralia
CitySydney
Period14/09/0818/09/08
Internet address

Cite this

Ernst, A., Singh, G., & Weiskircher, R. (2008). Scheduling meetings at trade events with complex preferences. In ICAPS 2008 - Proceedings of the 18th International Conference on Automated Planning and Scheduling (pp. 76-82)
Ernst, Andreas ; Singh, Gaurav ; Weiskircher, René. / Scheduling meetings at trade events with complex preferences. ICAPS 2008 - Proceedings of the 18th International Conference on Automated Planning and Scheduling. 2008. pp. 76-82
@inproceedings{60a1a7721280466dae49fd6063756773,
title = "Scheduling meetings at trade events with complex preferences",
abstract = "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.",
author = "Andreas Ernst and Gaurav Singh and Ren{\'e} Weiskircher",
year = "2008",
language = "English",
isbn = "9781577353867",
pages = "76--82",
booktitle = "ICAPS 2008 - Proceedings of the 18th International Conference on Automated Planning and Scheduling",

}

Ernst, A, Singh, G & Weiskircher, R 2008, Scheduling meetings at trade events with complex preferences. in ICAPS 2008 - Proceedings of the 18th International Conference on Automated Planning and Scheduling. pp. 76-82, International Conference on Automated Planning and Scheduling 2008, Sydney, Australia, 14/09/08.

Scheduling meetings at trade events with complex preferences. / Ernst, Andreas; Singh, Gaurav; Weiskircher, René.

ICAPS 2008 - Proceedings of the 18th International Conference on Automated Planning and Scheduling. 2008. p. 76-82.

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

TY - GEN

T1 - Scheduling meetings at trade events with complex preferences

AU - Ernst, Andreas

AU - Singh, Gaurav

AU - Weiskircher, René

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=58849157393&partnerID=8YFLogxK

M3 - Conference Paper

SN - 9781577353867

SP - 76

EP - 82

BT - ICAPS 2008 - Proceedings of the 18th International Conference on Automated Planning and Scheduling

ER -

Ernst A, Singh G, Weiskircher R. Scheduling meetings at trade events with complex preferences. In ICAPS 2008 - Proceedings of the 18th International Conference on Automated Planning and Scheduling. 2008. p. 76-82