Publication:
A multi-objective ant colony system algorithm for flow shop scheduling problem

Simple item page
dc.contributor.authorYenisey, Mehmet Mutlu
dc.contributor.buuauthorYağmahan, Betül
dc.contributor.departmentMühendislik Fakültesi
dc.contributor.departmentEndüstri Mühendisliği Bölümü
dc.contributor.orcid0000-0003-1744-3062
dc.contributor.researcheridB-5557-2017
dc.contributor.scopusid23487445600
dc.date.accessioned2021-10-26T20:06:59Z
dc.date.available2021-10-26T20:06:59Z
dc.date.issued2010-03
dc.description.abstractIn this paper, we consider the flow shop scheduling problem with respect to the both objectives of makespan and total flowtime. This problem is known to be NP-hard type in literature Several algorithms have been proposed to solve this problem We present a multi-objective ant colony system algorithm (MOACSA). which combines ant colony optimization approach and a local search strategy in order to solve this scheduling problem. The proposed algorithm is tested with well-known problems in literature Its solution performance was compared with the existing multi-objective heuristics. The Computational results show that proposed algorithm is more efficient and better than other methods compared.
dc.identifier.citationYağmahan, B. ve Yenisey, M. M. (2010). "A multi-objective ant colony system algorithm for flow shop scheduling problem". Expert Systems with Applications, 378(2), 1361-1368.
dc.identifier.endpage1368
dc.identifier.issn0957-4174
dc.identifier.issn1873-6793
dc.identifier.issue2
dc.identifier.scopus2-s2.0-71749114629
dc.identifier.startpage1361
dc.identifier.urihttps://doi.org/10.1016/j.eswa.2009.06.105
dc.identifier.urihttps://www.sciencedirect.com/science/article/pii/S0957417409006605
dc.identifier.urihttp://hdl.handle.net/11452/22480
dc.identifier.volume37
dc.identifier.wos000272432300055
dc.indexed.wosSCIE
dc.language.isoen
dc.publisherPergamon-Elsevier Science
dc.relation.collaborationYurt içi
dc.relation.journalExpert Systems with Applications
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.subjectFlow shop scheduling
dc.subjectMulti-objective
dc.subjectMakespan
dc.subjectFlowtime
dc.subjectHeuristics
dc.subjectAnt colony optimization
dc.subjectTabu search algorithm
dc.subjectOptimization algorithm
dc.subjectGenetic algorithms
dc.subjectM-machine
dc.subjectMinimize
dc.subjectMakespan
dc.subjectTime
dc.subjectComputer science
dc.subjectEngineering
dc.subjectOperations research & management science
dc.subjectComputational complexity
dc.subjectComputational efficiency
dc.subjectHeuristic methods
dc.subjectMachine shop practice
dc.subjectMultiobjective optimization
dc.subjectScheduling algorithms
dc.subjectAnt-colony optimization
dc.subjectFlow-shop scheduling
dc.subjectFlow-time
dc.subjectMulti objective
dc.subjectProblem solving
dc.subject.scopusFlow Shop Scheduling; Permutation Flowshop; No-Wait
dc.subject.wosComputer science, artificial intelligence
dc.subject.wosEngineering, electrical & electronic
dc.subject.wosOperations research & management science
dc.titleA multi-objective ant colony system algorithm for flow shop scheduling problem
dc.typeArticle
dc.wos.quartileQ1
dc.wos.quartileQ2 (Computer science, artificial intelligence)
dspace.entity.typePublication
local.contributor.departmentMühendislik Fakültesi/Endüstri Mühendisliği Bölümü
local.indexed.atScopus
local.indexed.atWOS

Files

License bundle

Now showing 1 - 1 of 1
Placeholder
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

İndeksli Yayınlar / Indexed Publications