Using linear programming to simulate service engineers

This paper describes the use of a network flow model to simulate a proposed spatial allocation of engineers to service requests. The model involves generating a pattern of demand and then determining an allocation of engineers to jobs which maximises the number of jobs immediately serviced. Within the maximum number of jobs the allocation pattern which minimises the amount of travelling is determined. The results obtained were compared with the allocation rules then in use.