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 ge nerating a pattern of demand and then determining an allocation of engineer s to jobs which maximises the number of jobs immediately serviced. Within t he maximum number of jobs the allocation pattern which minimises the amount of travelling is determined. The results obtained were compared with the a llocation rules then in use.