İçeriğe geç
akaturk Akademik ölçüm
Giriş yap Kayıt ol

OpenAlex konusu

Scheduling and Timetabling Solutions

Bu sayfa OpenAlex konu etiketine göre çalışmaları ve o konuda görünen akademisyenleri listeler. YÖKSİS temel alan / yan dal değildir.

OpenAlex 1.066 eser 65 yazar konusu

Çalışmalar

1.066 eser

  1. A survey on the resource-constrained project scheduling problem 1995
    OpenAlex üst %1 OpenAlex 99.2%

    In this paper, research on the resource-constrained project scheduling problem is classified according to specified objectives and constraints. Each classified area is extensively surveyed, and special emphasis is given to trends in recent research. Specific papers involving nonrenewable resource constraints and time/…

  2. A comprehensive analysis of hyper-heuristics 2008
    OpenAlex üst %1 OpenAlex 99.7%

    Meta-heuristics such as simulated annealing, genetic algorithms and tabu search have been successfully applied to many difficult optimization problems for which no satisfactory problem specific solution exists. However, expertise is required to adopt

  3. A comparative analysis of several asymmetric traveling salesman problem formulations 2009
    YÖKSİS SJR Q1 JCR Q1 OpenAlex üst %10 OpenAlex 96.7%

    Özet henüz yok.

  4. A comparative analysis of several asymmetric traveling salesman problem formulations 2007
    OpenAlex üst %10 OpenAlex 96.7%

    Özet henüz yok.

  5. A review on the studies employing artificial bee colony algorithm to solve combinatorial optimization problems 2022
    YÖKSİS SJR Q1 JCR Q1 OpenAlex üst %1 OpenAlex 99.5%

    Özet henüz yok.

  6. A review on the studies employing artificial bee colony algorithm to solve combinatorial optimization problems 2022
    YÖKSİS SJR Q1 JCR Q1 OpenAlex üst %1 OpenAlex 99.5%

    Özet henüz yok.

  7. A review on the studies employing artificial bee colony algorithm to solve combinatorial optimization problems 2022
    YÖKSİS SJR Q1 JCR Q1 OpenAlex üst %1 OpenAlex 99.5%

    Özet henüz yok.

  8. A hybrid genetic algorithm for the discrete time cost trade off problem 2012
    YÖKSİS SJR Q1 JCR Q1 OpenAlex üst %1 OpenAlex 99.1%

    Özet henüz yok.

  9. A parallel cooperative hybrid method based on ant colony optimization and 3 Opt algorithm for solving traveling salesman problem 2016
    YÖKSİS SJR Q1 JCR Q2 OpenAlex üst %10 OpenAlex 99.0%

    Özet henüz yok.

  10. A parallel cooperative hybrid method based on ant colony optimization and 3-Opt algorithm for solving traveling salesman problem 2018
    YÖKSİS SJR Q2 JCR Q2 OpenAlex üst %10 OpenAlex 99.0%

    Özet henüz yok.

  11. A parallel cooperative hybrid method based on ant colony optimization and 3-Opt algorithm for solving traveling salesman problem 2018
    YÖKSİS SJR Q2 JCR Q2 OpenAlex üst %10 OpenAlex 99.0%

    Özet henüz yok.

  12. Testing the performance of teaching\u2013learning based optimization (TLBO) algorithm on combinatorial problems: Flow shop and job shop scheduling cases 2014
    YÖKSİS SJR Q1 JCR Q1 OpenAlex üst %1 OpenAlex 99.8%

    Özet henüz yok.

Akademisyenler

65 akademisyen