Optimal workload allocation in closed queueing networks with state dependent queues

Abstract

The problem of optimal workload allocation in closed queueing network models with multi-server exponential infinite capacity workstations and finite capacity state dependent queueing models is examined. The processing rates (i.e. service times) of jobs in the queueing system are the main focus. State dependent queues are appropriate for modeling the transportation and material transfer of the customers and products within the system. By combining these two types of queues, we can model the processing of jobs or customers at service stations and also the material handling transfer of job and customers between these stations. Because the environment is a closed queueing network model, it allows for the dynamic interaction of the jobs and customers in the optimal workload allocation values. This combination of queues and optimal search process provides a broad range of potential applications in manufacturing and service type design operations where the travel time between workstations is important. Conveyors, automated-guided vehicle systems (AGVS), and fork lift trucks are utilized to show the full range of material handling component systems.