FUZZY HIERARCHICAL QUEUEING MODELS FOR THE LOCATION SET COVERING PROBLEM IN CONGESTED SYSTEMS

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

SHAVANDI H.; MAHLOUJI H.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Scientia Iranica Year:2008 | Volume:15 | Issue:3 Page(s): 378-388

Download Full-Text

View:

371

Download:

266

Cites:

Information Journal Paper

Title

FUZZY HIERARCHICAL QUEUEING MODELS FOR THE LOCATION SET COVERING PROBLEM IN CONGESTED SYSTEMS

Author(s)

SHAVANDI H. | MAHLOUJI H. | Issue Writer Certificate

Keywords

Not Registered.

Abstract

In hierarchical service networks, facilities at different levels provide different types of service. For example, in health care systems, general centers provide low-level services, such as primary health care, while specialized hospitals provide high-level services. Because of the demand congestion at service networks, the location of servers and their allocation of demand nodes can have a strong impact on the length of the queue at each server, as well as on the response time to service calls. This study attempts to develop hierarchical location-allocation models for congested systems by employing a queuing theory in a fuzzy framework. The parameters of each model are approximately evaluated and stated as fuzzy-numbers. The coverage of demand nodes is also considered in an approximate manner and is stated by the degree of membership. Using queuing theory and fuzzy conditions, both referral and nested hierarchical models are developed for the Location Set Covering Problem (LSCP). To demonstrate the performance of the proposed models, a numerical example is solved in order to compare the results obtained from the existing probabilistic models and the new fuzzy models developed in this paper.

Cites

No record.

References

No record.

Cite

APA: Copy

SHAVANDI, H., & MAHLOUJI, H.. (2008). FUZZY HIERARCHICAL QUEUEING MODELS FOR THE LOCATION SET COVERING PROBLEM IN CONGESTED SYSTEMS. SCIENTIA IRANICA, 15(3), 378-388. SID. https://sid.ir/paper/289658/en

Vancouver: Copy

SHAVANDI H., MAHLOUJI H.. FUZZY HIERARCHICAL QUEUEING MODELS FOR THE LOCATION SET COVERING PROBLEM IN CONGESTED SYSTEMS. SCIENTIA IRANICA[Internet]. 2008;15(3):378-388. Available from: https://sid.ir/paper/289658/en

IEEE: Copy

H. SHAVANDI, and H. MAHLOUJI, “FUZZY HIERARCHICAL QUEUEING MODELS FOR THE LOCATION SET COVERING PROBLEM IN CONGESTED SYSTEMS,” SCIENTIA IRANICA, vol. 15, no. 3, pp. 378–388, 2008, [Online]. Available: https://sid.ir/paper/289658/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops