A Very Fast Heuristic for Combinatorial Optimization With Specific Application to Priority Rule Sequencing in Operations Management: Fuzzy Greedy Search

Kaveh Sheibani
Additional contact information
Kaveh Sheibani: ORLab Analytics, Vancouver, Canada

International Journal of Operations Research and Information Systems (IJORIS), 2018, vol. 9, issue 3, 77-89

Abstract: This article presents mathematics of a generic polynomial-time heuristic which can be integrated into approaches for hard combinatorial optimization problems. The proposed method evaluates objects in a way that combines fuzzy reasoning with a greedy mechanism, thereby exploiting a fuzzy solution space using greedy methods. The effectiveness and efficiency of the proposed method are demonstrated on job-shop scheduling as one of the most challenging classical sequencing problems in the area of combinatorial optimization.

Date: 2018
References: Add references at CitEc
Citations:

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 18/IJORIS.2018070104 (application/pdf)

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:igg:joris0:v:9:y:2018:i:3:p:77-89

Access Statistics for this article

International Journal of Operations Research and Information Systems (IJORIS) is currently edited by John Wang

More articles in International Journal of Operations Research and Information Systems (IJORIS) from IGI Global
Bibliographic data for series maintained by Journal Editor ().