EconPapers    
Economics at your fingertips  
 

A branching algorithm to solve binary problem in uncertain environment: an application in machine allocation problem

Sujeet Kumar Singh () and Deepika Rani ()
Additional contact information
Sujeet Kumar Singh: National University of Singapore
Deepika Rani: Dr. B. R. Ambedkar National Institute of Technology

OPSEARCH, 2019, vol. 56, issue 3, No 19, 1007-1023

Abstract: Abstract This paper studies a new algorithm to solve the uncertain generalized assignment problem. The presented technique is based on the concept of branch and bound rather than the usual simplex based techniques. At first, the problem is relaxed to the transportation model which is easy to handle and work with. The model, so obtained is solved by the conventional transportation technique. The obtained solution serves as starting solution for further sub problems. The ambiguity in parameters is represented by triangular fuzzy numbers. We propose a linear ranking function, called the grade function which is based on the centroid method. The grade function is used to rank the triangular fuzzy numbers. The proposed approach is justified numerically by showing its application in generalized machine allocation problem.

Keywords: Generalized machine allocation problem; Grade function; Uncertainty; Binary problems; Transportation problem; 90C05; 90C57; 90C70 (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s12597-019-00378-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:opsear:v:56:y:2019:i:3:d:10.1007_s12597-019-00378-z

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/12597

DOI: 10.1007/s12597-019-00378-z

Access Statistics for this article

OPSEARCH is currently edited by Birendra Mandal

More articles in OPSEARCH from Springer, Operational Research Society of India
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-03-20
Handle: RePEc:spr:opsear:v:56:y:2019:i:3:d:10.1007_s12597-019-00378-z