Skip to Main content Skip to Navigation
New interface
Journal articles

Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem

Abstract : The Business-to-Business Meeting Scheduling problem consists of scheduling a set of meetings between given pairs of participants to an event, while taking into account participants' availability and accommodation capacity. A crucial aspect of this problem is that breaks in participants' schedules should be avoided as much as possible. It constitutes a challenging combinatorial problem that needs to be solved for many real world brokerage events. In this paper we present a comparative study of Constraint Programming (CP), Mixed-Integer Programming (MIP) and Maximum Satisfiability (MaxSAT) approaches to this problem. The CP approach relies on using global constraints and has been implemented in MiniZinc to be able to compare CP, Lazy Clause Generation and MIP as solving technologies in this setting. We also present a pure MIP encoding. Finally, an alternative viewpoint is considered under MaxSAT, showing best performance when considering some implied constraints. Experiments conducted on real world instances, as well as on crafted ones, show that the MaxSAT approach is the one with the best performance for this problem, exhibiting better solving times, sometimes even orders of magnitude smaller than CP and MIP.
Document type :
Journal articles
Complete list of metadata
Contributor : Jordi Coll Connect in order to contact the contributor
Submitted on : Monday, September 12, 2022 - 2:25:27 PM
Last modification on : Tuesday, September 13, 2022 - 3:51:39 AM


Publisher files allowed on an open archive




  • HAL Id : hal-03775300, version 1



Miquel Bofill, Jordi Coll, Marc Garcia, Jesús Giráldez-Cru, Gilles Pesant, et al.. Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem. Journal of Artificial Intelligence Research, 2022. ⟨hal-03775300⟩



Record views


Files downloads