Who serves whom? Dynamic resource matching in an activity-scanning simulation system

Presents an activity-scanning simulation model for the familiar barbershop problem where customers have favorite barbers, barbers may not show up for work, and customers may get impatient and leave. This example illustrates the mechanisms for matching customers to barbers or barbers to customers, and argues that either approach may be implemented in an activity scanning system without altering the basic model structure. The solution to this problem is described in detail using a simulation model written in STROBOSCOPE (STate- and ResOurce-Based Simulation of COnstruction ProcEsses)