Solving Lot-streaming Flow Shop Scheduling Problems Using a Discrete Harmony Search Algorithm

dc.contributor.author Quan-Ke Pan
dc.contributor.author Mehmet Fatih Tasgetiren
dc.contributor.author Ponnuthurai Nagaratnam Suganthan
dc.contributor.author Yun-Chia Liang
dc.contributor.author Tasgetiren, Mehmet Fatih
dc.contributor.author Suganthan, Ponnuthurai Nagaratnam
dc.contributor.author Liang, Yun-Chia
dc.contributor.author Pan, Quan-Ke
dc.coverage.spatial 2010 IEEE World Congress on Computational Intelligence
dc.date.accessioned 2025-10-06T16:23:15Z
dc.date.issued 2010
dc.description.abstract The harmony search (HS) algorithm is one of the recent evolutionary computation techniques to solve optimization problems. To make it applicable for lot-streaming flow shop problems a discrete variant of the HS algorithm (DHS) with job permutations representation is proposed. In the proposed DHS algorithm a new improvisation scheme is designed to generate feasible job sequences. A local search algorithm based on the insert neighborhood structure is fused to stress the further enhancement capability of the algorithm proposed whereas a restart scheme is employed to avoid the stagnation of the evolution. Extensive computational simulations and comparisons are provided which demonstrate the effectiveness of the proposed DHS against the best performing algorithms from the literature.
dc.description.sponsorship National Science Foundation of China [60874075, 70871065, 60905039]; Science Research and Development of Provincial Department of Public Edu cation of Shandong [J09LG29]
dc.description.sponsorship This research is partially supported by National Science Foundation of China under Grants 60874075, 70871065, 60905039, and Science Research and Development of Provincial Department of Public Edu cation of Shandong under Grant J09LG29.
dc.identifier.doi 10.1109/CEC.2010.5586199
dc.identifier.isbn 978-1-4244-8126-2
dc.identifier.isbn 9781424481262
dc.identifier.isbn 9781424469109
dc.identifier.scopus 2-s2.0-79959413226
dc.identifier.uri https://gcris.yasar.edu.tr/handle/123456789/7759
dc.identifier.uri https://doi.org/10.1109/CEC.2010.5586199
dc.language.iso English
dc.publisher IEEE
dc.relation.ispartof 2010 IEEE World Congress on Computational Intelligence
dc.relation.ispartofseries IEEE Congress on Evolutionary Computation
dc.rights info:eu-repo/semantics/closedAccess
dc.source 2010 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC)
dc.subject NO-WAIT FLOWSHOPS, M-MACHINE, HEURISTIC ALGORITHM, 2-MACHINE FLOWSHOP, SEQUENCING PROBLEM, MULTIPLE PRODUCTS, HYBRID FLOWSHOPS, OPTIMIZATION, MINIMIZE, MAKESPAN
dc.title Solving Lot-streaming Flow Shop Scheduling Problems Using a Discrete Harmony Search Algorithm
dc.type Conference Object
dspace.entity.type Publication
gdc.author.scopusid 6505799356
gdc.author.scopusid 7003996538
gdc.author.scopusid 15074237600
gdc.author.scopusid 7403499508
gdc.author.wosid Suganthan, Ponnuthurai/A-5023-2011
gdc.author.wosid Pan, Quan-ke/F-2019-2013
gdc.bip.impulseclass C5
gdc.bip.influenceclass C5
gdc.bip.popularityclass C5
gdc.coar.type text::conference output
gdc.collaboration.industrial false
gdc.description.department
gdc.description.departmenttemp [Pan, Quan-Ke] Liaocheng Univ, Sch Comp Sci, Liaocheng, Peoples R China; [Tasgetiren, Mehmet Fatih] Yasar Univ, Dept Ind Engn, Izmir, Turkey; [Suganthan, Ponnuthurai Nagaratnam] Nanyang Technol Univ, Sch Elect & Elect Engn, Singapore 639798, Singapore; [Liang, Yun-Chia] Yuan Ze Univ, Dept Ind Engn & Management, Taoyuan, Taiwan
gdc.description.endpage 6
gdc.description.publicationcategory Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı
gdc.description.startpage 1
gdc.description.woscitationindex Conference Proceedings Citation Index - Science
gdc.identifier.openalex W2022968437
gdc.identifier.wos WOS:000287375802041
gdc.index.type WoS
gdc.index.type Scopus
gdc.oaire.diamondjournal false
gdc.oaire.impulse 1.0
gdc.oaire.influence 2.389126E-9
gdc.oaire.isgreen true
gdc.oaire.popularity 4.17188E-10
gdc.oaire.publicfunded false
gdc.oaire.sciencefields 0209 industrial biotechnology
gdc.oaire.sciencefields 0211 other engineering and technologies
gdc.oaire.sciencefields 02 engineering and technology
gdc.openalex.collaboration International
gdc.openalex.fwci 1.6242
gdc.openalex.normalizedpercentile 0.85
gdc.opencitations.count 1
gdc.plumx.mendeley 9
gdc.plumx.scopuscites 2
gdc.scopus.citedcount 2
gdc.virtual.author Taşgetiren, Mehmet Fatih
gdc.wos.citedcount 0
person.identifier.orcid Suganthan- Ponnuthurai Nagaratnam/0000-0003-0901-5105, Tasgetiren- M. Fatih/0000-0001-8625-3671, Tasgetiren- Mehmet Fatih/0000-0002-5716-575X,
project.funder.name National Science Foundation of China [60874075- 70871065- 60905039], Science Research and Development of Provincial Department of Public Edu cation of Shandong [J09LG29]
relation.isAuthorOfPublication 8bccf385-4262-4593-9e77-8bea302a93b0
relation.isAuthorOfPublication.latestForDiscovery 8bccf385-4262-4593-9e77-8bea302a93b0
relation.isOrgUnitOfPublication ac5ddece-c76d-476d-ab30-e4d3029dee37
relation.isOrgUnitOfPublication.latestForDiscovery ac5ddece-c76d-476d-ab30-e4d3029dee37

Files