A Very Fast Heuristic for Combinatorial Optimization With Specific Application to Priority Rule Sequencing in Operations Management
| Autor: | Kaveh Sheibani |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Mathematical optimization
021103 operations research Information Systems and Management Computer Networks and Communications Computer science 0211 other engineering and technologies Combinatorial optimization problem 0102 computer and information sciences 02 engineering and technology 01 natural sciences Fuzzy logic Computer Science Applications Management Information Systems Scheduling (computing) Computational Theory and Mathematics 010201 computation theory & mathematics Combinatorial optimization Fuzzy reasoning Greedy algorithm Information Systems |
| Zdroj: | International Journal of Operations Research and Information Systems. 9:77-89 |
| ISSN: | 1947-9336 1947-9328 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|