A green scheduling algorithm for the distributed flowshop problem

dc.contributor.author Yuan-Zhen Li
dc.contributor.author Quan-Ke Pan
dc.contributor.author Kai-Zhou Gao
dc.contributor.author M. Fatih Tasgetiren
dc.contributor.author Biao Zhang
dc.contributor.author Jun-Qing Li
dc.date SEP
dc.date.accessioned 2025-10-06T16:23:28Z
dc.date.issued 2021
dc.description.abstract In recent years sustainable development and green manufacturing have attracted widespread attention to environmental problems becoming increasingly serious. Meanwhile affected by the intensification of market competition and economic globalization distributed manufacturing systems have become increasingly common. This paper addresses the energy-efficient scheduling of the distributed permutation flowshop (EEDPFSP) with the criteria of minimizing both total flow time and total energy consumption. Considering the distributed and multi-objective optimization complexity an improved NSGAII algorithm (INSGAII) is proposed. First we analyze the problem-specific characteristics and designed new operators based on the knowledge of the problem. Second four constructive heuristic algorithms are proposed to produce high-quality initial solutions. Third inspired by the artificial bee colony algorithm we propose a new colony generation method using the operators designed. Fourth a local intensification is designed for exploiting better non-dominated solutions. The influence of parameter settings is investigated by experiments to determine the optimal parameter configuration of the INSGAII. Finally a large number of computational tests and comparisons have been carried out to verify the effectiveness of the proposed INSGAII in solving EEDPFSP. (c) 2021 Elsevier B.V. All rights reserved. Superscript/Subscript Available
dc.identifier.doi 10.1016/j.asoc.2021.107526
dc.identifier.issn 1568-4946
dc.identifier.uri http://dx.doi.org/10.1016/j.asoc.2021.107526
dc.identifier.uri https://gcris.yasar.edu.tr/handle/123456789/7847
dc.language.iso English
dc.publisher ELSEVIER
dc.relation.ispartof Applied Soft Computing
dc.source APPLIED SOFT COMPUTING
dc.subject Distributed permutation flowshop, scheduling, NSGA-II, Multi-objective optimization, Energy efficient, Total flowtime, Total energy consumption
dc.subject MINIMIZING MAKESPAN, OPTIMIZATION ALGORITHM, SEARCH ALGORITHM, PERMUTATION, DECOMPOSITION, HEURISTICS
dc.title A green scheduling algorithm for the distributed flowshop problem
dc.type Article
dspace.entity.type Publication
gdc.bip.impulseclass C3
gdc.bip.influenceclass C4
gdc.bip.popularityclass C3
gdc.coar.type text::journal::journal article
gdc.collaboration.industrial false
gdc.description.startpage 107526
gdc.description.volume 109
gdc.identifier.openalex W3170687184
gdc.index.type WoS
gdc.oaire.diamondjournal false
gdc.oaire.impulse 35.0
gdc.oaire.influence 4.5652326E-9
gdc.oaire.isgreen false
gdc.oaire.popularity 4.143822E-8
gdc.oaire.publicfunded false
gdc.oaire.sciencefields 0211 other engineering and technologies
gdc.oaire.sciencefields 0202 electrical engineering, electronic engineering, information engineering
gdc.oaire.sciencefields 02 engineering and technology
gdc.openalex.collaboration International
gdc.openalex.fwci 6.469
gdc.openalex.normalizedpercentile 0.97
gdc.openalex.toppercent TOP 10%
gdc.opencitations.count 48
gdc.plumx.crossrefcites 51
gdc.plumx.mendeley 38
gdc.plumx.scopuscites 62
person.identifier.orcid gao- kaizhou/0000-0002-9252-6928, Tasgetiren- M. Fatih/0000-0001-8625-3671, Li- Yuanzhen/0000-0002-1089-2992,
project.funder.name National Key Research and Development Program [2020YFB1708200], National Science Foundation of China [61973203], Shanghai Key Laboratory of Power station Au-tomation Technology
publicationvolume.volumeNumber 109
relation.isOrgUnitOfPublication ac5ddece-c76d-476d-ab30-e4d3029dee37
relation.isOrgUnitOfPublication.latestForDiscovery ac5ddece-c76d-476d-ab30-e4d3029dee37

Files