This section presents a J-MADeM implementation of the MSP problem, a well
known scheduling problem to ﬁnd the best allocation for a meeting within an
organization.

The example proposed is about school meetings in a MAS where four agents
A = {director, teacher, father, father worker} try to schedule some meetings
proposed by the director to the rest of the agents. All meetings
last 2 hours and their starting time can be {9, 11, 15} on days {monday, tuesday}. 

Two kinds of meetings are considered: usual monomodal meetings, based on laboral 
constraints; and MADeM multimodal meetings considering two aspects: laboral
constraints and personal preferences. Performace varies according to the number
of attendants for the meeting. This variation takes into account that autonomous 
agents can accept to assist to the scheduled meeting or not, following their preferences.

More details about this example can be found in the paper named "J-MADeM v.1.1: A 
full-ﬂedge AgentSpeak(L) multimodal social decision library in Jason", available
at "doc/publications". 
