Uncertain bottleneck assignment problem using credibility theory
by Debapriya Dey Sarkar; Shyamal Kumar Mondal; Kajla Basu
International Journal of Mathematics in Operational Research (IJMOR), Vol. 26, No. 4, 2023

Abstract: In this paper, two types of generalised bottleneck assignment problem (BGAP) namely task-BGAP and agent-BGAP have been considered with fuzzy costs, capacities and resources. In reality, most of the data are uncertain or vague in nature. The objective of this paper is to formulate and solve a more realistic model under uncertainty. A robust counterpart of these two BGAP models have been constructed using credibility measure theory to solve these optimal mini-max regret problems. Credibility theory helps the actuaries to understand the risk associated with historical data and try to reduce the losses for any organisation. So, by this approach, chance constrained programming (CCP) models have been developed. Finally, the CCP models are solved to get the optimal solution using LINGO software. The method has been illustrated using a real life application of a production factory in Section 5.

Online publication date: Mon, 18-Dec-2023

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com