Multidirection Update-Based Multiobjective Particle Swarm Optimization for Mixed No-Idle Flow-Shop Scheduling Problem

The Mixed No-Idle Flow-shop Scheduling Problem (MNIFSP) is an extension of flow-shop scheduling, which has practical significance and application prospects in production scheduling. To improve the efficacy of solving the complicated multiobjective MNIFSP, a MultiDirection Update (MDU) based Multiobj...

Full description

Saved in:
Bibliographic Details
Published in:Complex System Modeling and Simulation Vol. 1; no. 3; pp. 176 - 197
Main Authors: Zhang, Wenqiang, Hou, Wenlin, Li, Chen, Yang, Weidong, Gen, Mitsuo
Format: Journal Article
Language:English
Published: Tsinghua University Press 01.09.2021
Subjects:
mixed no-idle flow-shop scheduling problem (mnlfsp)
multidirection update
multiobjective optimization
particle swarm optimization (pso)
ISSN:2096-9929, 2096-9929
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract The Mixed No-Idle Flow-shop Scheduling Problem (MNIFSP) is an extension of flow-shop scheduling, which has practical significance and application prospects in production scheduling. To improve the efficacy of solving the complicated multiobjective MNIFSP, a MultiDirection Update (MDU) based Multiobjective Particle Swarm Optimization (MDU-MoPSO) is proposed in this study. For the biobjective optimization problem of the MNIFSP with minimization of makespan and total processing time, the MDU strategy divides particles into three subgroups according to a hybrid selection mechanism. Each subgroup prefers one convergence direction. Two subgroups are individually close to the two edge areas of the Pareto Front (PF) and serve two objectives, whereas the other one approaches the central area of the PF, preferring the two objectives at the same time. The MDU-MoPSO adopts a job sequence representation method and an exchange sequence-based particle update operation, which can better reflect the characteristics of sequence differences among particles. The MDU-MoPSO updates the particle in multiple directions and interacts in each direction, which speeds up the convergence while maintaining a good distribution performance. The experimental results and comparison of six classical evolutionary algorithms for various benchmark problems demonstrate the effectiveness of the proposed algorithm.
AbstractList The Mixed No-Idle Flow-shop Scheduling Problem (MNIFSP) is an extension of flow-shop scheduling, which has practical significance and application prospects in production scheduling. To improve the efficacy of solving the complicated multiobjective MNIFSP, a MultiDirection Update (MDU) based Multiobjective Particle Swarm Optimization (MDU-MoPSO) is proposed in this study. For the biobjective optimization problem of the MNIFSP with minimization of makespan and total processing time, the MDU strategy divides particles into three subgroups according to a hybrid selection mechanism. Each subgroup prefers one convergence direction. Two subgroups are individually close to the two edge areas of the Pareto Front (PF) and serve two objectives, whereas the other one approaches the central area of the PF, preferring the two objectives at the same time. The MDU-MoPSO adopts a job sequence representation method and an exchange sequence-based particle update operation, which can better reflect the characteristics of sequence differences among particles. The MDU-MoPSO updates the particle in multiple directions and interacts in each direction, which speeds up the convergence while maintaining a good distribution performance. The experimental results and comparison of six classical evolutionary algorithms for various benchmark problems demonstrate the effectiveness of the proposed algorithm.
Author Li, Chen
Zhang, Wenqiang
Gen, Mitsuo
Hou, Wenlin
Yang, Weidong
Author_xml – sequence: 1
  givenname: Wenqiang
  surname: Zhang
  fullname: Zhang, Wenqiang
– sequence: 2
  givenname: Wenlin
  surname: Hou
  fullname: Hou, Wenlin
– sequence: 3
  givenname: Chen
  surname: Li
  fullname: Li, Chen
– sequence: 4
  givenname: Weidong
  surname: Yang
  fullname: Yang, Weidong
– sequence: 5
  givenname: Mitsuo
  surname: Gen
  fullname: Gen, Mitsuo
BookMark eNp1kVtLw0AQhRdR8NZnX_MHUvfSJDuPWrwUrAqxz8vsTVfSbtmk3n69aVQQwacZ5sx3mOEckt1VXDlCThgdcwEMTqf1vB5zytmYUlbtkANOocwBOOz-6vfJqG2DpgWXRVGK8oBs5pumCzYkZ7oQV9libbFz-Tm2zmaDFvXzVntx2T2mLpjGZfUrpmV2t-7CMnzgwPmYsnl466HbmM9sv3TZxNe8forrrDZPzm6asHrM7lPUjVsekz2PTetG3_WILC4vHqbX-c3d1Wx6dpMbMZFdzqnRjE4oguOCgzToJbVgCqwAjPAVAy0nmtMCRek8125SiUIiMyBQWCeOyOzL10Z8VusUlpjeVcSghkFMj-r7J4XgpWNAS9ZbCglYVZJ5Lb224IzE3qv48jIptm1yXpnQDc93CUOjGFVDFGobhdpGobZR9NzpH-7njv-IT2L2jwI
CitedBy_id crossref_primary_10_1093_jcde_qwac090
crossref_primary_10_26599_TST_2023_9010098
crossref_primary_10_26599_TST_2023_9010015
crossref_primary_10_3390_math10111827
crossref_primary_10_1007_s12652_022_03766_4
crossref_primary_10_1016_j_jmsy_2024_10_018
crossref_primary_10_1016_j_ins_2021_12_122
crossref_primary_10_1049_rpg2_12451
crossref_primary_10_7717_peerj_cs_2102
crossref_primary_10_1093_jcde_qwac038
crossref_primary_10_3390_math10122117
crossref_primary_10_1016_j_eswa_2023_121570
crossref_primary_10_1007_s10845_023_02227_9
crossref_primary_10_26599_TST_2023_9010140
crossref_primary_10_26599_TST_2023_9010067
crossref_primary_10_1016_j_engappai_2024_108775
crossref_primary_10_1016_j_compbiomed_2022_105510
crossref_primary_10_3390_electronics11020209
crossref_primary_10_1002_er_8011
crossref_primary_10_1007_s12293_023_00403_1
crossref_primary_10_3233_JIFS_236981
crossref_primary_10_32604_cmes_2023_022287
crossref_primary_10_3390_math10214162
crossref_primary_10_3390_sym14020331
crossref_primary_10_1007_s10489_022_03964_9
crossref_primary_10_1016_j_cie_2022_108033
Cites_doi 10.1016/j.ins.2020.01.018
10.1109/TEVC.2007.896686
10.1016/j.eswa.2019.01.057
10.1016/j.jcde.2016.05.001
10.1109/TEVC.2004.826067
10.1109/CEC.2002.1004388
10.1016/j.asoc.2017.01.017
10.1016/j.cor.2018.02.003
10.1016/j.cor.2011.10.024
10.1016/j.omega.2013.10.002
10.1016/j.swevo.2020.100689
10.1080/00207543.2018.1457812
10.1016/j.cie.2019.03.019
10.1007/s10845-013-0814-2
10.1162/EVCO_a_00104
10.1016/j.eswa.2019.113151
10.1007/s10845-015-1158-x
10.1016/j.swevo.2019.100557
10.1007/s00170-007-1252-0
10.1109/TEVC.2007.892759
10.1109/4235.996017
10.1109/MHS.1995.494215
10.3929/ethz-a-004284029
10.1080/0305215X.2018.1444163
10.1016/j.eswa.2019.113166
10.1007/s00521-015-2073-y
10.3390/a10040121
10.1109/TSMCB.2012.2209115
10.1002/nav.3800010110
10.1287/moor.1.2.117
10.1016/j.cor.2019.104839
10.1007/s10951-020-00637-8
10.1080/01605682.2019.1671149
10.1016/j.cie.2017.06.025
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.23919/CSMS.2021.0017
DatabaseName CrossRef
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
EISSN 2096-9929
EndPage 197
ExternalDocumentID oai_doaj_org_article_a9f8e19061b84389a7781fb8fbd9ec8a
10_23919_CSMS_2021_0017
GroupedDBID AAYXX
ALMA_UNASSIGNED_HOLDINGS
CITATION
M~E
GROUPED_DOAJ
ID FETCH-LOGICAL-c348t-20cb1040a9e23298caf80d9c5a799c3f719b84b205a36ef2be47358a1c93a3de3
IEDL.DBID DOA
ISICitedReferencesCount 33
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001543472200002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2096-9929
IngestDate Fri Oct 03 12:44:44 EDT 2025
Sat Nov 29 03:38:31 EST 2025
Tue Nov 18 19:37:07 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 3
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c348t-20cb1040a9e23298caf80d9c5a799c3f719b84b205a36ef2be47358a1c93a3de3
OpenAccessLink https://doaj.org/article/a9f8e19061b84389a7781fb8fbd9ec8a
PageCount 22
ParticipantIDs doaj_primary_oai_doaj_org_article_a9f8e19061b84389a7781fb8fbd9ec8a
crossref_citationtrail_10_23919_CSMS_2021_0017
crossref_primary_10_23919_CSMS_2021_0017
PublicationCentury 2000
PublicationDate 2021-9-00
2021-09-01
PublicationDateYYYYMMDD 2021-09-01
PublicationDate_xml – month: 09
  year: 2021
  text: 2021-9-00
PublicationDecade 2020
PublicationTitle Complex System Modeling and Simulation
PublicationYear 2021
Publisher Tsinghua University Press
Publisher_xml – name: Tsinghua University Press
References ref35
ref13
ref34
ref12
ref37
ref15
ref36
ref14
ref31
ref30
ref33
ref32
ref10
ref2
ref1
ref17
ref16
ref19
ref18
ref24
ref23
ref26
ref25
ref20
jiao (ref29) 2017; 15
ref22
ref21
ref28
schaffer (ref11) 1985
ref8
ref7
ref9
ref4
nouha (ref27) 2015
ref3
ref6
ref5
References_xml – ident: ref32
  doi: 10.1016/j.ins.2020.01.018
– ident: ref6
  doi: 10.1109/TEVC.2007.896686
– ident: ref14
  doi: 10.1016/j.eswa.2019.01.057
– ident: ref28
  doi: 10.1016/j.jcde.2016.05.001
– volume: 15
  start-page: 46
  year: 2017
  ident: ref29
  article-title: A niche sharing scheme-based coevolutionary particle swarm optimization algorithm for flow shop scheduling problem
  publication-title: Syst Cybern Inf
– ident: ref8
  doi: 10.1109/TEVC.2004.826067
– ident: ref7
  doi: 10.1109/CEC.2002.1004388
– ident: ref21
  doi: 10.1016/j.asoc.2017.01.017
– ident: ref22
  doi: 10.1016/j.cor.2018.02.003
– ident: ref20
  doi: 10.1016/j.cor.2011.10.024
– ident: ref2
  doi: 10.1016/j.omega.2013.10.002
– start-page: 93
  year: 1985
  ident: ref11
  article-title: Multiple objective optimization with vector evaluated genetic algorithms
  publication-title: Proc 1st Int Conf Genetic Algorithms
– ident: ref16
  doi: 10.1016/j.swevo.2020.100689
– ident: ref4
  doi: 10.1080/00207543.2018.1457812
– ident: ref37
  doi: 10.1016/j.cie.2019.03.019
– ident: ref12
  doi: 10.1007/s10845-013-0814-2
– ident: ref10
  doi: 10.1162/EVCO_a_00104
– ident: ref33
  doi: 10.1016/j.eswa.2019.113151
– ident: ref30
  doi: 10.1007/s10845-015-1158-x
– start-page: 145
  year: 2015
  ident: ref27
  article-title: A particle swarm optimization metaheuristic for the blocking flow shop scheduling problem: Total tardiness minimization
  publication-title: Proc of 13th European Conf EUMAS 2015 and Third Int Conf Multi-Agent Systems and Agreement Technologies
– ident: ref23
  doi: 10.1016/j.swevo.2019.100557
– ident: ref25
  doi: 10.1007/s00170-007-1252-0
– ident: ref36
  doi: 10.1109/TEVC.2007.892759
– ident: ref34
  doi: 10.1109/4235.996017
– ident: ref5
  doi: 10.1109/MHS.1995.494215
– ident: ref35
  doi: 10.3929/ethz-a-004284029
– ident: ref17
  doi: 10.1080/0305215X.2018.1444163
– ident: ref24
  doi: 10.1016/j.eswa.2019.113166
– ident: ref31
  doi: 10.1007/s00521-015-2073-y
– ident: ref26
  doi: 10.3390/a10040121
– ident: ref9
  doi: 10.1109/TSMCB.2012.2209115
– ident: ref1
  doi: 10.1002/nav.3800010110
– ident: ref3
  doi: 10.1287/moor.1.2.117
– ident: ref19
  doi: 10.1016/j.cor.2019.104839
– ident: ref13
  doi: 10.1007/s10951-020-00637-8
– ident: ref15
  doi: 10.1080/01605682.2019.1671149
– ident: ref18
  doi: 10.1016/j.cie.2017.06.025
SSID ssib052855636
ssib053565417
Score 2.3534062
Snippet The Mixed No-Idle Flow-shop Scheduling Problem (MNIFSP) is an extension of flow-shop scheduling, which has practical significance and application prospects in...
SourceID doaj
crossref
SourceType Open Website
Enrichment Source
Index Database
StartPage 176
SubjectTerms mixed no-idle flow-shop scheduling problem (mnlfsp)
multidirection update
multiobjective optimization
particle swarm optimization (pso)
Title Multidirection Update-Based Multiobjective Particle Swarm Optimization for Mixed No-Idle Flow-Shop Scheduling Problem
URI https://doaj.org/article/a9f8e19061b84389a7781fb8fbd9ec8a
Volume 1
WOSCitedRecordID wos001543472200002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources (ISSN International Center)
  customDbUrl:
  eissn: 2096-9929
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib053565417
  issn: 2096-9929
  databaseCode: M~E
  dateStart: 20210101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELYQYmBBIEC85YGBxdDYSW2PgKhAoqVSALFFtmPzEG2qUh4Tv527OFRlQCwsGZJz5Hy--L6T70HIfta2VlrvGZBlzVLn2kxzZRgXFuhBmTlfJ9LeXspeT93d6f5Mqy-MCYvlgSNwR0YH5cFqtROrsFO3kVIlwapgS-2dqqlRS-oZZwo0KeMKC19NDW0mMux3jbnTHDg700AKYp0fLnSij07zbg6-Ik_wYEL-MFEzlfxrk9NZJksNV6THcY4rZM4PV8lrnTIbLRFgSm9G6LOzE7BGJa2fVfYp7mK033wezd_NeECvYHsYNHmXFMgq7T5-wKBexS5KEOo8V-8sf6hGNIeVLDFE_Z72Y8OZNXLTObs-PWdN7wTmRKomoPzOgqfVMtoDZ9LKmaBapXaZkVo7EWSiAU_LW5kRbR-49diDWJnEaWFE6cU6mR9WQ79BKCxzmoJXwkMa0lJKm1mXOovno_BDy7BJDr_hKlxTWBz7WzwX4GDU-BaIb4H4Ygid3CQH0wGjWFPjd9ETxH8qhsWw6xugIkWDYfGXimz9x0u2ySLOKoaX7ZD5yfjV75IF9zZ5fBnv1doH1-7n2RccoN3h
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Multidirection+Update-Based+Multiobjective+Particle+Swarm+Optimization+for+Mixed+No-Idle+Flow-Shop+Scheduling+Problem&rft.jtitle=Complex+System+Modeling+and+Simulation&rft.au=Wenqiang+Zhang&rft.au=Wenlin+Hou&rft.au=Chen+Li&rft.au=Weidong+Yang&rft.date=2021-09-01&rft.pub=Tsinghua+University+Press&rft.issn=2096-9929&rft.volume=1&rft.issue=3&rft.spage=176&rft.epage=197&rft_id=info:doi/10.23919%2FCSMS.2021.0017&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_a9f8e19061b84389a7781fb8fbd9ec8a
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2096-9929&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2096-9929&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2096-9929&client=summon