Experiments on networks of employee timetabling problems Conference Paper uri icon


  • The natural representation of employee timetabling problems (ETPs), as constraint networks (CNs), has variables representing tasks and values representing employees that are assigned to tasks. In this representation, ETPs have binary constraints of non-equality (mutual exclusion), the networks are non uniform, and variables have different domains of values. There is also a typical family of non-binary constraints that represent finite capacity limits. These features differentiate the networks of ETPs from random uniform binary CNs. Much experimental work has been done in recent years on random binary constraint networks (cf. [10,11, 9]) and the so called phase transitions have been connected with certain value combinations of the parameters of random binary CNs.

publication date

  • January 1, 1997