In this paper, we investigate network location problem for congestible facilities, considering balking, the reluctance of customers to join the queue upon arrival. Balking often happens when the estimated waiting times by customers are more than their patience threshold. Based on the number of current customers, each customer decides to join or leave the system upon the arrival. Since balking is a usual issue in the real world situations, taking it into consideration increases the reality of mathematical models. In the proposed model, the selection of candidate sites and the assignment of customers to facilities are performed in such a manner that the total lost demands is minimized. We use a monotonically decreasing function to calculate arrival rates for facilities. In order to evaluate the proposed mathematical model, some numerical examples are presented and solved using GAMS.
Arkat, J., & Zamani, S. (2013). Network Location for Congested Facilities Considering Balking. Journal of Industrial Engineering Research in Production Systems, 1(1), 37-44.
MLA
J. Arkat; S. Zamani. "Network Location for Congested Facilities Considering Balking". Journal of Industrial Engineering Research in Production Systems, 1, 1, 2013, 37-44.
HARVARD
Arkat, J., Zamani, S. (2013). 'Network Location for Congested Facilities Considering Balking', Journal of Industrial Engineering Research in Production Systems, 1(1), pp. 37-44.
VANCOUVER
Arkat, J., Zamani, S. Network Location for Congested Facilities Considering Balking. Journal of Industrial Engineering Research in Production Systems, 2013; 1(1): 37-44.
)