Yayın:
A Comparison between Two Modified NSGA-II Algorithms for Solving the Multi-objective Flexible Job Shop Scheduling Problem

Sadeleştirilmiş öğe sayfası
dc.contributor.authorTeymourifar, Aydin
dc.contributor.authorÖztürk, Gürkan
dc.contributor.authorBahadir, Ozan
dc.contributor.orcid0000-0002-0285-0266
dc.contributor.orcid0000-0002-9480-176X
dc.date.accessioned2025-11-13T10:17:23Z
dc.date.issued2018-05-01
dc.identifier.doihttps://doi.org/10.13189/ujam.2018.060302
dc.identifier.endpage93
dc.identifier.issn2331-6446
dc.identifier.issue3
dc.identifier.openalexW2889340465
dc.identifier.startpage79
dc.identifier.urihttps://hdl.handle.net/11421/3699
dc.identifier.urihttps://doi.org/10.13189/ujam.2018.060302
dc.identifier.volume6
dc.language.isoen
dc.relation.ispartofUniversal Journal of Applied Mathematics
dc.rightsopenAccess
dc.subjectPopulation
dc.subjectMathematical optimization
dc.subjectSorting
dc.subjectMulti-objective optimization
dc.subjectEvolutionary algorithm
dc.subjectScheduling (production processes)
dc.subjectJob shop scheduling
dc.subjectComputer science
dc.subjectPareto principle
dc.subjectAlgorithm
dc.subjectMathematics
dc.subject.sdg8
dc.titleA Comparison between Two Modified NSGA-II Algorithms for Solving the Multi-objective Flexible Job Shop Scheduling Problem
dc.typeArticle
dspace.entity.typePublication
local.authorid.openalexA5080770456
local.authorid.openalexA5004800651
local.authorid.openalexA5035573658

Dosyalar

Koleksiyonlar

Publications