Оригинал (Original)
Автори: Christoforidis S., Titopulos E., Илиева-Михайлова, Б. П., Kromitoglou E., Intzes S.
Заглавие: Solving the Job Shop Scheduling Problem – Different Techniques and Programming Languages
Ключови думи: Genetic Algorithm, Metaheuristics, Constraint Programming

Абстракт: The Job Shop Scheduling Problem (JSSP) is a long-standing combinatorial optimization problem studied since the 1960s. JSSP is NP-complete, meaning solutions exist but cannot be guaranteed within polynomial time for general instances. In this paper we aim to compare some algorithms and techniques that have been proposed by various researchers. We also present the execution of these algorithms using two programming languages, python and C#.

Библиография

    Издание

    Списание Професионално Образование, брой 5-6, 2025, България, София, АзБуки, https://doi.org/10.53656/voc25-3-4-11

    Издателските права се държат от списание Професионално образования

    		Autors: Christoforidis S., Titopulos E., Ilieva-Mihaylova, I. P., Kromitoglou E., Intzes S.
    Title: Solving the Job Shop Scheduling Problem – Different Techniques and Programming Languages
    Keywords: Genetic Algorithm, Metaheuristics, Constraint Programming

    Abstract: The Job Shop Scheduling Problem (JSSP) is a long-standing combinatorial optimization problem studied since the 1960s. JSSP is NP-complete, meaning solutions exist but cannot be guaranteed within polynomial time for general instances. In this paper we aim to compare some algorithms and techniques that have been proposed by various researchers. We also present the execution of these algorithms using two programming languages, python and C#.

    References

      Issue

      Vocational education, issue 5-6, 2025, Bulgaria, Sofia, AzBuki, https://doi.org/10.53656/voc25-3-4-11

      Copyright списание Професионално образования

      Вид: пленарен доклад в международен форум, публикация в реферирано издание, индексирана в национален референтен списък