Heuristic Algorithms

Heuristic Algorithms is a problem-solving methodology in combinatorial optimization that employs practical, experience-based techniques to generate sufficiently good solutions to computationally complex scheduling problems, such as those in open shop environments, where exact optimal solutions are intractable to obtain within feasible time.

10.7K

Publications

649.3K

Citations

22.5K

Authors

4.2K

Institutions

Publications per year

2017–2026

3.4K

Variants

Heuristic Algorithm

Authors

22.5K

  1. QP
    Quan-Ke Pan

    Liaocheng University, China

    57 publications · 5.6K citations

    36

    h-index

  2. LG
    Liang Gao

    Huazhong University of Science and Technology, China

    54 publications · 4.1K citations

    32

    h-index

  3. LW
    Ling Wang

    Tsinghua University, China

    39 publications · 4.1K citations

    31

    h-index

  4. EB
    Edmund Burke

    University of Nottingham, United Kingdom

    44 publications · 3.1K citations

    27

    h-index

  5. MZ
    Mengjie Zhang

    Victoria University of Wellington, New Zealand

    42 publications · 2.9K citations

    26

    h-index

1–5 of 22.5K

Venues

  1. European Journal of Operational Research

    281 publications · 33.2K citations

    97

    h-index

  2. Computers & Operations Research

    265 publications · 20.6K citations

    79

    h-index

  3. International Journal of Production Research

    391 publications · 19.7K citations

    74

    h-index

  4. Computers & Industrial Engineering

    169 publications · 10.7K citations

    58

    h-index

  5. Operations Research

    85 publications · 20.7K citations

    53

    h-index

1–5