Hybrid Multi-Objective Artificial Bee Colony for Flexible Assembly Job Shop with Learning Effect

The flexible job shop scheduling problem is a typical and complex combinatorial optimization problem. In recent years, the assembly problem in job shop scheduling problems has been widely studied. However, most of the studies ignore the learning effect of workers, which may lead to higher costs than...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Mathematics (Basel) Ročník 13; číslo 3; s. 472
Hlavní autoři: Du, Zhaosheng, Li, Junqing, Li, Jiake
Médium: Journal Article
Jazyk:angličtina
Vydáno: Basel MDPI AG 01.02.2025
Témata:
ISSN:2227-7390, 2227-7390
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract The flexible job shop scheduling problem is a typical and complex combinatorial optimization problem. In recent years, the assembly problem in job shop scheduling problems has been widely studied. However, most of the studies ignore the learning effect of workers, which may lead to higher costs than necessary. This paper considers a flexible assembly job scheduling problem with learning effect (FAJSPLE) and proposes a hybrid multi-objective artificial bee colony (HMABC) algorithm to solve the problem. Firstly, a mixed integer linear programming model is developed where the maximum completion time (makespan), total energy consumption and total cost are optimized simultaneously. Secondly, a critical path-based mutation strategy was designed to dynamically adjust the level of workers according to the characteristics of the critical path. Finally, the local search capability is enhanced by combining the simulated annealing algorithm (SA), and four search operators with different neighborhood structures are designed. By comparative analysis on different scales instances, the proposed algorithm reduces 55.8 and 958.99 on average over the comparison algorithms for the GD and IGD metrics, respectively; for the C-metric, the proposed algorithm improves 0.036 on average over the comparison algorithms.
AbstractList The flexible job shop scheduling problem is a typical and complex combinatorial optimization problem. In recent years, the assembly problem in job shop scheduling problems has been widely studied. However, most of the studies ignore the learning effect of workers, which may lead to higher costs than necessary. This paper considers a flexible assembly job scheduling problem with learning effect (FAJSPLE) and proposes a hybrid multi-objective artificial bee colony (HMABC) algorithm to solve the problem. Firstly, a mixed integer linear programming model is developed where the maximum completion time (makespan), total energy consumption and total cost are optimized simultaneously. Secondly, a critical path-based mutation strategy was designed to dynamically adjust the level of workers according to the characteristics of the critical path. Finally, the local search capability is enhanced by combining the simulated annealing algorithm (SA), and four search operators with different neighborhood structures are designed. By comparative analysis on different scales instances, the proposed algorithm reduces 55.8 and 958.99 on average over the comparison algorithms for the GD and IGD metrics, respectively; for the C-metric, the proposed algorithm improves 0.036 on average over the comparison algorithms.
Audience Academic
Author Du, Zhaosheng
Li, Jiake
Li, Junqing
Author_xml – sequence: 1
  givenname: Zhaosheng
  surname: Du
  fullname: Du, Zhaosheng
– sequence: 2
  givenname: Junqing
  surname: Li
  fullname: Li, Junqing
– sequence: 3
  givenname: Jiake
  surname: Li
  fullname: Li, Jiake
BookMark eNptUUtvEzEQXqEiUUpv_ABLXNni93qPIWppUVAPwNnY3tnEkbMOXgfIv--UIFQh7IPH4-8x1veyOZvyBE3zmtErIXr6bufqhgkqqOz4s-acc961HT6cPalfNJfzvKW4eiaM7M-bb7dHX-JAPh1Sje2930Ko8QeQRalxjCG6RN4DkGVOeTqSMRdyk-BX9Akh8ww7n47kY_bk8ybvyc9YN2QFrkxxWpPrcUSxV83z0aUZLv-cF83Xm-svy9t2df_hbrlYtUFSXVvhlTNBSkcHKrSTA-u9Ck45H6DrDVMdHQZtlOaaKj90Egx4Dgxvgumeiovm7qQ7ZLe1-xJ3rhxtdtH-buSytg7_FBJY1ylFlZIMFJr74L0UnHpmJEUhL1DrzUlrX_L3A8zVbvOhTDi-RTNluOmVRtTVCbV2KBqnMdfiAu4BdjFgOGPE_sLw3mitO4WEtydCKHmeC4x_x2TUPmZon2aIcP4PPMTqaswT-sT0f9ID0hSfAw
CitedBy_id crossref_primary_10_3390_a18050248
Cites_doi 10.1016/j.knosys.2019.02.027
10.1080/00207543.2013.828164
10.1007/s00170-005-0375-4
10.1007/s00170-013-5187-3
10.1016/j.neucom.2016.08.003
10.1016/j.cor.2021.105263
10.1007/s10586-019-03022-z
10.1007/s00170-012-4217-x
10.1007/s00291-018-0537-z
10.1080/00207543.2012.756151
10.1016/j.cie.2020.106338
10.1016/j.cie.2019.03.047
10.1007/s10898-012-9993-1
10.1109/TSMCB.2012.2222373
10.1016/j.cor.2011.10.007
10.1016/j.promfg.2020.01.350
10.1016/j.knosys.2020.106032
10.1016/j.ijpe.2014.03.006
10.1016/j.cie.2022.108786
10.1016/j.egyr.2021.10.026
10.1016/j.swevo.2020.100664
10.1109/CEC.2017.7969523
10.1109/TEM.2017.2785774
10.4995/ijpme.2017.6618
10.1016/j.apm.2016.09.022
10.1016/j.ins.2022.06.056
10.1109/TETCI.2022.3145706
10.1007/s00500-017-2539-1
10.1016/j.rcim.2007.01.001
10.1080/00207543.2017.1401243
10.1016/j.rcim.2019.04.006
10.1007/s10845-007-0026-8
10.1016/j.cie.2005.01.018
10.1016/j.jmsy.2022.04.005
10.1016/j.ejor.2003.10.034
10.1016/j.asoc.2020.106696
10.1016/j.engappai.2017.05.004
10.1007/s00766-020-00328-y
10.1016/j.cie.2015.07.018
10.1109/TNNLS.2022.3208942
10.1155/2011/569784
10.1016/j.rcim.2006.06.004
10.1080/00207543.2012.746480
10.1007/s00186-013-0456-3
10.1016/j.jclepro.2018.11.231
10.1016/j.ijepes.2014.02.017
10.1016/j.ejor.2019.11.016
10.1016/j.cie.2009.04.002
10.1109/ICACTE.2010.5579761
10.1016/j.asoc.2020.106544
10.1007/s10898-021-00992-6
ContentType Journal Article
Copyright COPYRIGHT 2025 MDPI AG
2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: COPYRIGHT 2025 MDPI AG
– notice: 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID AAYXX
CITATION
3V.
7SC
7TB
7XB
8AL
8FD
8FE
8FG
8FK
ABJCF
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
FR3
GNUQQ
HCIFZ
JQ2
K7-
KR7
L6V
L7M
L~C
L~D
M0N
M7S
P62
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
Q9U
DOA
DOI 10.3390/math13030472
DatabaseName CrossRef
ProQuest Central (Corporate)
Computer and Information Systems Abstracts
Mechanical & Transportation Engineering Abstracts
ProQuest Central (purchase pre-March 2016)
Computing Database (Alumni Edition)
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
Materials Science & Engineering Collection (subscription)
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central
Technology Collection
ProQuest One Community College
ProQuest Central Korea
Engineering Research Database
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
Computer Science Database
Civil Engineering Abstracts
ProQuest Engineering Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
Computing Database
Engineering Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
ProQuest Central Basic
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
Publicly Available Content Database
Computer Science Database
ProQuest Central Student
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest One Academic Middle East (New)
Mechanical & Transportation Engineering Abstracts
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest Central Korea
ProQuest Central (New)
Advanced Technologies Database with Aerospace
Engineering Collection
Advanced Technologies & Aerospace Collection
Civil Engineering Abstracts
ProQuest Computing
Engineering Database
ProQuest Central Basic
ProQuest Computing (Alumni Edition)
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
Computer and Information Systems Abstracts Professional
ProQuest One Academic UKI Edition
Materials Science & Engineering Collection
Engineering Research Database
ProQuest One Academic
ProQuest One Academic (New)
ProQuest Central (Alumni)
DatabaseTitleList

CrossRef
Publicly Available Content Database
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
– sequence: 2
  dbid: PIMPY
  name: Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISSN 2227-7390
ExternalDocumentID oai_doaj_org_article_a75505541e5c40bcbb4320b1840903b3
A829866675
10_3390_math13030472
GroupedDBID -~X
5VS
85S
8FE
8FG
AADQD
AAFWJ
AAYXX
ABDBF
ABJCF
ABPPZ
ABUWG
ACIPV
ACIWK
ADBBV
AFFHD
AFKRA
AFPKN
AFZYC
ALMA_UNASSIGNED_HOLDINGS
AMVHM
ARAPS
AZQEC
BCNDV
BENPR
BGLVJ
BPHCQ
CCPQU
CITATION
DWQXO
GNUQQ
GROUPED_DOAJ
HCIFZ
IAO
ITC
K6V
K7-
KQ8
L6V
M7S
MODMG
M~E
OK1
PHGZM
PHGZT
PIMPY
PQGLB
PQQKQ
PROAC
PTHSS
RNS
3V.
7SC
7TB
7XB
8AL
8FD
8FK
FR3
JQ2
KR7
L7M
L~C
L~D
M0N
P62
PKEHL
PQEST
PQUKI
PRINS
Q9U
ID FETCH-LOGICAL-c406t-3b5a8c44a0d036a4d19b5ca5abce7981570dd68562605bd74e8eb2e1605316903
IEDL.DBID DOA
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001418642100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2227-7390
IngestDate Fri Oct 03 12:43:54 EDT 2025
Fri Jul 25 11:47:13 EDT 2025
Tue Nov 04 18:13:40 EST 2025
Tue Nov 18 22:27:21 EST 2025
Sat Nov 29 07:17:00 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 3
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c406t-3b5a8c44a0d036a4d19b5ca5abce7981570dd68562605bd74e8eb2e1605316903
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
OpenAccessLink https://doaj.org/article/a75505541e5c40bcbb4320b1840903b3
PQID 3165828956
PQPubID 2032364
ParticipantIDs doaj_primary_oai_doaj_org_article_a75505541e5c40bcbb4320b1840903b3
proquest_journals_3165828956
gale_infotracacademiconefile_A829866675
crossref_primary_10_3390_math13030472
crossref_citationtrail_10_3390_math13030472
PublicationCentury 2000
PublicationDate 2025-02-01
PublicationDateYYYYMMDD 2025-02-01
PublicationDate_xml – month: 02
  year: 2025
  text: 2025-02-01
  day: 01
PublicationDecade 2020
PublicationPlace Basel
PublicationPlace_xml – name: Basel
PublicationTitle Mathematics (Basel)
PublicationYear 2025
Publisher MDPI AG
Publisher_xml – name: MDPI AG
References Li (ref_1) 2022; 174
Qi (ref_24) 2022; 608
Toktas (ref_40) 2020; 96
Li (ref_45) 2020; 23
Gao (ref_42) 2013; 43
Wu (ref_9) 2018; 56
Li (ref_52) 2022; 63
Kazemi (ref_10) 2017; 63
Wong (ref_16) 2009; 57
Dai (ref_27) 2019; 59
ref_51
Zhang (ref_25) 2020; 54
Li (ref_48) 2020; 95
Kress (ref_3) 2019; 41
Xia (ref_7) 2005; 48
Xie (ref_49) 2019; 39
Liao (ref_14) 2015; 88
Li (ref_34) 2019; 173
Burmeister (ref_53) 2023; 36
Du (ref_32) 2022; 7
Liu (ref_26) 2019; 211
Homayouni (ref_4) 2021; 79
Mousakhani (ref_29) 2013; 51
Rossi (ref_20) 2007; 23
Hurink (ref_18) 2005; 162
Sun (ref_35) 2021; 132
Chan (ref_15) 2008; 24
Fattahi (ref_5) 2007; 18
Fattahi (ref_13) 2013; 65
Navaei (ref_12) 2013; 69
Alrezaamiri (ref_46) 2020; 25
Mozdgir (ref_11) 2013; 51
Du (ref_33) 2022; 35
Azzouz (ref_28) 2017; 5
Li (ref_41) 2017; 21
Rossi (ref_22) 2014; 153
Chen (ref_44) 2014; 60
Hansmann (ref_2) 2014; 79
Zhang (ref_19) 2014; 52
Shan (ref_43) 2021; 7
Fattahi (ref_31) 2007; 32
Zhang (ref_8) 2020; 283
ref_37
Zou (ref_36) 2011; 2011
Zhang (ref_21) 2012; 39
Zhang (ref_17) 2018; 65
Kishor (ref_38) 2016; 216
Li (ref_30) 2020; 200
Karimi (ref_23) 2017; 41
Akay (ref_39) 2013; 57
Baradaran (ref_47) 2019; 131
Xu (ref_50) 2020; 142
ref_6
References_xml – volume: 173
  start-page: 83
  year: 2019
  ident: ref_34
  article-title: An elitist nondominated sorting hybrid algorithm for multi-objective flexible job-shop scheduling problem with sequence-dependent setups
  publication-title: Knowl. Based Syst.
  doi: 10.1016/j.knosys.2019.02.027
– volume: 52
  start-page: 985
  year: 2014
  ident: ref_19
  article-title: A modified shifting bottleneck heuristic and disjunctive graph for job shop scheduling problems with transportation constraints
  publication-title: Int. J. Prod. Res.
  doi: 10.1080/00207543.2013.828164
– volume: 32
  start-page: 563
  year: 2007
  ident: ref_31
  article-title: Flexible job shop scheduling with tabu search algorithms
  publication-title: Int. J. Adv. Manuf. Technol.
  doi: 10.1007/s00170-005-0375-4
– volume: 69
  start-page: 2215
  year: 2013
  ident: ref_12
  article-title: Two-stage flow-shop scheduling problem with non-identical second stage assembly machines
  publication-title: Int. J. Adv. Manuf. Technol.
  doi: 10.1007/s00170-013-5187-3
– volume: 216
  start-page: 514
  year: 2016
  ident: ref_38
  article-title: NSABC: Non-dominated sorting based multi-objective artificial bee colony algorithm and its application in data clustering
  publication-title: Neurocomputing
  doi: 10.1016/j.neucom.2016.08.003
– volume: 132
  start-page: 105263
  year: 2021
  ident: ref_35
  article-title: A hybrid many-objective evolutionary algorithm for flexible job-shop scheduling problem with transportation and setup times
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2021.105263
– volume: 23
  start-page: 2483
  year: 2020
  ident: ref_45
  article-title: A hybrid multi-objective artificial bee colony algorithm for flexible task scheduling problems in cloud computing system
  publication-title: Clust. Comput.
  doi: 10.1007/s10586-019-03022-z
– volume: 65
  start-page: 787
  year: 2013
  ident: ref_13
  article-title: A mathematical model and extension algorithm for assembly flexible flow shop scheduling problem
  publication-title: Int. J. Adv. Manuf. Technol.
  doi: 10.1007/s00170-012-4217-x
– volume: 41
  start-page: 179
  year: 2019
  ident: ref_3
  article-title: A worker constrained flexible job shop scheduling problem with sequence-dependent setup times
  publication-title: OR Spectr.
  doi: 10.1007/s00291-018-0537-z
– volume: 51
  start-page: 3625
  year: 2013
  ident: ref_11
  article-title: Two-stage assembly flow-shop scheduling problem with non-identical assembly machines considering setup times
  publication-title: Int. J. Prod. Res.
  doi: 10.1080/00207543.2012.756151
– volume: 36
  start-page: 1
  year: 2023
  ident: ref_53
  article-title: A memetic NSGA-II for the multi-objective flexible job shop scheduling problem with real-time energy tariffs
  publication-title: Flex. Serv. Manuf. J.
– volume: 142
  start-page: 106338
  year: 2020
  ident: ref_50
  article-title: Multi-objective artificial bee colony algorithm for multi-stage resource leveling problem in sharing logistics network
  publication-title: Comput. Ind. Eng.
  doi: 10.1016/j.cie.2020.106338
– volume: 131
  start-page: 187
  year: 2019
  ident: ref_47
  article-title: Stochastic vehicle routing problem with heterogeneous vehicles and multiple prioritized time windows: Mathematical modeling and solution approach
  publication-title: Comput. Ind. Eng.
  doi: 10.1016/j.cie.2019.03.047
– volume: 57
  start-page: 415
  year: 2013
  ident: ref_39
  article-title: Synchronous and asynchronous pareto-based multi-objective artificial bee colony algorithms
  publication-title: J. Glob. Optim.
  doi: 10.1007/s10898-012-9993-1
– volume: 43
  start-page: 1011
  year: 2013
  ident: ref_42
  article-title: A novel artificial bee colony algorithm based on modified search equation and orthogonal learning
  publication-title: IEEE Trans. Cybern.
  doi: 10.1109/TSMCB.2012.2222373
– volume: 39
  start-page: 1713
  year: 2012
  ident: ref_21
  article-title: A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2011.10.007
– volume: 39
  start-page: 1194
  year: 2019
  ident: ref_49
  article-title: An effective multi-objective artificial bee colony algorithm for energy efficient distributed job shop scheduling
  publication-title: Procedia Manuf.
  doi: 10.1016/j.promfg.2020.01.350
– volume: 200
  start-page: 106032
  year: 2020
  ident: ref_30
  article-title: An improved Jaya algorithm for solving the flexible job shop scheduling problem with transportation and setup times
  publication-title: Knowl. Based Syst.
  doi: 10.1016/j.knosys.2020.106032
– volume: 153
  start-page: 253
  year: 2014
  ident: ref_22
  article-title: Flexible job shop scheduling with sequence-dependent setup and transportation times by ant colony with reinforced pheromone relationships
  publication-title: Int. J. Prod. Econ.
  doi: 10.1016/j.ijpe.2014.03.006
– volume: 174
  start-page: 108786
  year: 2022
  ident: ref_1
  article-title: Survey of integrated flexible job shop scheduling problems
  publication-title: Comput. Ind. Eng.
  doi: 10.1016/j.cie.2022.108786
– volume: 7
  start-page: 326
  year: 2021
  ident: ref_43
  article-title: Multi-objective economic optimization scheduling of CCHP micro-grid based on improved bee colony algorithm considering the selection of hybrid energy storage system
  publication-title: Energy Rep.
  doi: 10.1016/j.egyr.2021.10.026
– volume: 54
  start-page: 100664
  year: 2020
  ident: ref_25
  article-title: An improved genetic algorithm for the flexible job shop scheduling problem with multiple time constraints
  publication-title: Swarm Evol. Comput.
  doi: 10.1016/j.swevo.2020.100664
– ident: ref_51
  doi: 10.1109/CEC.2017.7969523
– volume: 65
  start-page: 487
  year: 2018
  ident: ref_17
  article-title: Flexible assembly job-shop scheduling with sequence-dependent setup times and part sharing in a dynamic environment: Constraint programming model, mixed-integer programming model, and dispatching rules
  publication-title: IEEE Trans. Eng. Manag.
  doi: 10.1109/TEM.2017.2785774
– volume: 5
  start-page: 23
  year: 2017
  ident: ref_28
  article-title: A hybrid algorithm for flexible job-shop scheduling problem with setup times
  publication-title: Int. J. Prod. Manag. Eng.
  doi: 10.4995/ijpme.2017.6618
– volume: 41
  start-page: 667
  year: 2017
  ident: ref_23
  article-title: Scheduling flexible job-shops with transportation times: Mathematical models and a hybrid imperialist competitive algorithm
  publication-title: Appl. Math. Model.
  doi: 10.1016/j.apm.2016.09.022
– volume: 608
  start-page: 178
  year: 2022
  ident: ref_24
  article-title: QMOEA: A Q-learning-based multiobjective evolutionary algorithm for solving time-dependent green vehicle routing problems with time windows
  publication-title: Inf. Sci.
  doi: 10.1016/j.ins.2022.06.056
– volume: 7
  start-page: 1036
  year: 2022
  ident: ref_32
  article-title: Knowledge-Based Reinforcement Learning and Estimation of Distribution Algorithm for Flexible Job Shop Scheduling Problem
  publication-title: IEEE Trans. Emerg. Top. Comput. Intell.
  doi: 10.1109/TETCI.2022.3145706
– volume: 21
  start-page: 6001
  year: 2017
  ident: ref_41
  article-title: A hybrid artificial bee colony for optimizing a reverse logistics network system
  publication-title: Soft Comput.
  doi: 10.1007/s00500-017-2539-1
– volume: 24
  start-page: 321
  year: 2008
  ident: ref_15
  article-title: Lot streaming for product assembly in job shop environment
  publication-title: Robot. Comput. -Integr. Manuf.
  doi: 10.1016/j.rcim.2007.01.001
– volume: 56
  start-page: 3064
  year: 2018
  ident: ref_9
  article-title: A two-stage three-machine assembly scheduling problem with a position-based learning effect
  publication-title: Int. J. Prod. Res.
  doi: 10.1080/00207543.2017.1401243
– volume: 59
  start-page: 143
  year: 2019
  ident: ref_27
  article-title: Multi-objective optimization for energy-efficient flexible job shop scheduling problem with transportation constraints
  publication-title: Robot. Comput. Integr. Manuf.
  doi: 10.1016/j.rcim.2019.04.006
– volume: 18
  start-page: 331
  year: 2007
  ident: ref_5
  article-title: Mathematical modeling and heuristic approaches to flexible job shop scheduling problems
  publication-title: J. Intell. Manuf.
  doi: 10.1007/s10845-007-0026-8
– volume: 48
  start-page: 409
  year: 2005
  ident: ref_7
  article-title: An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems
  publication-title: Comput. Ind. Eng.
  doi: 10.1016/j.cie.2005.01.018
– volume: 63
  start-page: 344
  year: 2022
  ident: ref_52
  article-title: An efficient critical path based method for permutation flow shop scheduling problem
  publication-title: J. Manuf. Syst.
  doi: 10.1016/j.jmsy.2022.04.005
– volume: 162
  start-page: 99
  year: 2005
  ident: ref_18
  article-title: Tabu search algorithms for job-shop problems with a single transport robot
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2003.10.034
– volume: 96
  start-page: 106696
  year: 2020
  ident: ref_40
  article-title: Pioneer Pareto artificial bee colony algorithm for three-dimensional objective space optimization of composite-based layered radar absorber
  publication-title: Appl. Soft Comput.
  doi: 10.1016/j.asoc.2020.106696
– volume: 63
  start-page: 98
  year: 2017
  ident: ref_10
  article-title: The two stage assembly flow-shop scheduling problem with batching and delivery
  publication-title: Eng. Appl. Artif. Intell.
  doi: 10.1016/j.engappai.2017.05.004
– volume: 25
  start-page: 363
  year: 2020
  ident: ref_46
  article-title: Parallel multi-objective artificial bee colony algorithm for software requirement optimization
  publication-title: Requir. Eng.
  doi: 10.1007/s00766-020-00328-y
– volume: 88
  start-page: 317
  year: 2015
  ident: ref_14
  article-title: An efficient heuristic for a two-stage assembly scheduling problem with batch setup times to minimize makespan
  publication-title: Comput. Ind. Eng.
  doi: 10.1016/j.cie.2015.07.018
– volume: 35
  start-page: 5695
  year: 2022
  ident: ref_33
  article-title: A reinforcement learning approach for flexible job shop scheduling problem with crane transportation and setup times
  publication-title: IEEE Trans. Neural Netw. Learn. Syst.
  doi: 10.1109/TNNLS.2022.3208942
– volume: 2011
  start-page: 569784
  year: 2011
  ident: ref_36
  article-title: Solving multiobjective optimization problems using artificial bee colony algorithm
  publication-title: Discret. Dyn. H. Nat. Soc.
  doi: 10.1155/2011/569784
– ident: ref_6
– volume: 23
  start-page: 503
  year: 2007
  ident: ref_20
  article-title: Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimisation method
  publication-title: Robot. Comput. -Integr. Manuf.
  doi: 10.1016/j.rcim.2006.06.004
– volume: 51
  start-page: 3476
  year: 2013
  ident: ref_29
  article-title: Sequence-dependent setup time flexible job shop scheduling problem to minimise total tardiness
  publication-title: Int. J. Prod. Res.
  doi: 10.1080/00207543.2012.746480
– volume: 79
  start-page: 135
  year: 2014
  ident: ref_2
  article-title: Flexible job shop scheduling with blockages
  publication-title: Math. Methods Oper. Res.
  doi: 10.1007/s00186-013-0456-3
– volume: 211
  start-page: 765
  year: 2019
  ident: ref_26
  article-title: Integrated green scheduling optimization of flexible job shop and crane transportation considering comprehensive energy consumption
  publication-title: J. Clean. Prod.
  doi: 10.1016/j.jclepro.2018.11.231
– volume: 60
  start-page: 203
  year: 2014
  ident: ref_44
  article-title: Multi-hive bee foraging algorithm for multi-objective optimal power flow considering the cost, loss, and emission
  publication-title: Int. J. Electr. Power Energy Syst.
  doi: 10.1016/j.ijepes.2014.02.017
– volume: 283
  start-page: 441
  year: 2020
  ident: ref_8
  article-title: Multi-objective optimisation in flexible assembly job shop scheduling using a distributed ant colony system
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2019.11.016
– volume: 57
  start-page: 983
  year: 2009
  ident: ref_16
  article-title: A resource-constrained assembly job shop scheduling problem with lot streaming technique
  publication-title: Comput. Ind. Eng.
  doi: 10.1016/j.cie.2009.04.002
– ident: ref_37
  doi: 10.1109/ICACTE.2010.5579761
– volume: 95
  start-page: 106544
  year: 2020
  ident: ref_48
  article-title: An improved artificial bee colony algorithm for solving multi-objective low-carbon flexible job shop scheduling problem
  publication-title: Appl. Soft Comput.
  doi: 10.1016/j.asoc.2020.106544
– volume: 79
  start-page: 463
  year: 2021
  ident: ref_4
  article-title: Production and transport scheduling in flexible job shop manufacturing systems
  publication-title: J. Glob. Optim.
  doi: 10.1007/s10898-021-00992-6
SSID ssj0000913849
Score 2.2883902
Snippet The flexible job shop scheduling problem is a typical and complex combinatorial optimization problem. In recent years, the assembly problem in job shop...
SourceID doaj
proquest
gale
crossref
SourceType Open Website
Aggregation Database
Enrichment Source
Index Database
StartPage 472
SubjectTerms Algorithms
artificial bee colony
Assembly
Bees
Combinatorial analysis
Completion time
Critical path
Energy consumption
flexible assembly job shop
Genetic algorithms
Heuristic
hybrid multi-objective algorithm
Integer programming
Job shop scheduling
Job shops
Learning
learning effect
Linear programming
Mixed integer
Multiple objective analysis
Optimization
Scheduling
Simulated annealing
Swarm intelligence
Workers
SummonAdditionalLinks – databaseName: Engineering Database
  dbid: M7S
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwEB5B4UAPvFEXWuQDiAOymsR2Yp9QW3VVIVGQClJvJmN7W6rtZtksSPvv8TjeBQ7lwjVxJDue1zcefwPwSqkaEYsJryuvufRKcHSu4sZpM_GVUUYOzSaa01N9fm4-5YRbn8sq1zYxGWrfOcqR74uyphOeGM6_m3_n1DWKTldzC43bcIdYEspUune2ybEQ56WWZqh3FxHd78co8JKsNnEk_uWJEmH_TWY5-Zrxg_-d5UO4n6NMdjCIxSO4FWaPYfvDhqK1fwJfT1Z0WYulG7j8I14Nli99M7BKsMMQ2FE0jrMVi6EtGxN3Jk7jkL4P1zhdsfcdsrPLbs4om8syVesFGxiRn8KX8fHnoxOe2y1wF736kgtUrXZStoWPbq2VvjSoXKtadKExulRN4X2tVYJA6BsZdITloaxJjyPIFs9ga9bNwg4wYoGvhSh9Q-1MiACxrXw90aII8UlTjeDt-tdbl7nIqSXG1EZMQhtl_9yoEbzejJ4PHBw3jDukXdyMIebs9KBbXNisiLZtCJMpWQYVl40OUYqqwAR0C4FiBG9IBizpd5ySa_M1hbgwYsqyB7oyOmK-Ro1gdy0DNit-b38LwPN_v34B9ypqJZwKwHdha7n4Efbgrvu5_NYvXiY5_gVzd_nK
  priority: 102
  providerName: ProQuest
Title Hybrid Multi-Objective Artificial Bee Colony for Flexible Assembly Job Shop with Learning Effect
URI https://www.proquest.com/docview/3165828956
https://doaj.org/article/a75505541e5c40bcbb4320b1840903b3
Volume 13
WOSCitedRecordID wos001418642100001&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: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 2227-7390
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913849
  issn: 2227-7390
  databaseCode: DOA
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2227-7390
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913849
  issn: 2227-7390
  databaseCode: M~E
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 2227-7390
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913849
  issn: 2227-7390
  databaseCode: K7-
  dateStart: 20130301
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 2227-7390
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913849
  issn: 2227-7390
  databaseCode: M7S
  dateStart: 20130301
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 2227-7390
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913849
  issn: 2227-7390
  databaseCode: BENPR
  dateStart: 20130301
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Publicly Available Content Database
  customDbUrl:
  eissn: 2227-7390
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913849
  issn: 2227-7390
  databaseCode: PIMPY
  dateStart: 20130301
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/publiccontent
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1NbxMxELWq0gMcEC0gAiXyoRUHZHV3ba_tY1MlKlQNEQWpnMz6IxQUkqobkHLhtzNjb6P0UHHh4oN3VvKOx-N53vEbQg6krJ1zxZTVVdBMBMmZ875ixmszDZWRRuRiE2o81peXZrJR6gtzwjI9cFbcUaMwhpaijNKLwnnnBK8Kl4BJwV3i-SyU2QBTyQebkmthcqY7B1x_BPHfFfprZEe8swclqv77HHLaZUZPyOMuPKTHeVi7ZCvO98ij8zW3avuUfD1d4S0rmq7Osg_uR3ZZ6Z1MB0EHMdIT8GrzFYWYlI6Q9NLNQKRt4083W9H3C0cvrhbXFI9hacex-o1mKuNn5PNo-OnklHV1EhhopF4y7mSjvRBNEWA_akQojZO-kY3zURldSlWEUGuZsIsLSkQNeDqWNS5AQMf8OdmeL-bxBaFI315zXgaFdUiQubCpQj3VvIjQo6oeeXurOes7EnGsZTGzACZQz3ZTzz1yuJa-zuQZ98gNcBLWMkh5nTrAEGxnCPZfhtAjb3AKLS5MGJJvuvsF8GFIcWWPdWU0gDUle2T_dpZtt2JbC5rAP4gAF1_-j9G8Ig8rrBSc8rv3yfby5ld8TXb87-X39qZPHgyG48nHfjJaaM8U62PW6QW2f4bwfPLufPLlL5o08JU
linkProvider Directory of Open Access Journals
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3LbtQwFLVKQQIWvFEHCnhBxQJZTfyI7QVCbWE0ZdoBiSJ158aPaamGyTAZQPNTfCO-TjLAouy6YJvcRHF8fB9-nIPQcyEKa202JgX1inAvGLHOUaKd0mNPtdC8EZuQo5E6PtYf1tDP7iwMbKvsfGJy1L5yMEe-zfICVnhiOv969pWAahSsrnYSGg0shmH5I5Zs9av9N7F_tyjtvz3aG5BWVYC4GLwWhFlRKsd5mfnovUvuc22FK0VpXZBa5UJm3hdKpEzfesmDitVnyAuAa6wlWXzvFXSVMyVhXA0lWc3pAMem4rrZX8-YzrZj1nkGUQI4Gf-KfEkg4KIwkGJb__b_9lfuoFttFo13GtjfRWtheg_dPFxR0Nb30clgCYfRcDphTN7b88azp2ca1gy8GwLei85_usQxdcd94Aa1k2hS1-GLnSzxu8rij2fVDMNsNW6paE9xw_j8AH26lCY-ROvTaho2EAaW-4Kx3EuQawGCx5L6YqxYFuIVSXvoZdfVxrVc6yD5MTGx5gJgmD-B0UNbK-tZwzFygd0uoGZlA8zg6UI1PzWtozGlhJpT8DyI2GzrrOWMZjYV8hmzrIdeAOYM-K_4Sa5sj2HEhgETmNlRVKtY00rRQ5sd5kzr2GrzG3CP_n37Gbo-ODo8MAf7o-FjdIOCbHLa7L6J1hfzb-EJuua-Lz7X86dpDGF0ctnw_AUcD1Tk
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9NAEB6VFCE48EYECuyBigOyYu967d0DQn0QNZSGSIBUTlvvIy0oJCEOoPw1fh0zfgQ4lFsPXO2x5fV-O4_dmW8AnkqZWWvjcZRxr6LUSxFZ53ikndJjz7XUad1sIh8O1fGxHm3Az7YWhtIqW51YKWo_c7RH3hNJRic86M73xk1axGi__3L-NaIOUnTS2rbTqCFyGFY_MHwrXwz2ca63Oe-_er93EDUdBiKHhmwZCSsL5dK0iD1q8iL1ibbSFbKwLuRaJTKPvc-UrLx-6_M0KIxEQ5IRdDGuFPjeS7CJLnnKO7A5GhyNPq53eIhxU6W6zrYXQsc99EHPyGYQQ-NfdrBqF3CeUagsXf_G__yPbsL1xr9mO_WCuAUbYXobrh2tyWnLO3BysKIyNVbVHkdv7eda51fP1HwabDcEtodmYbpi6NSzPrGG2gmKlGX4Yicr9npm2buz2ZzRPjZrSGpPWc0FfRc-XMgQ70FnOpuG-8CI_z4TIvE5NXIh6seC-2ysRBzwSs678LydduMaFnZqBjIxGI0RSMyfIOnC9lp6XrOPnCO3SwhayxBneHVhtjg1jQoyRU7RqEyTIHHY1lmbCh7bKsSPhRVdeEb4M6TZ8JNc0RRo4MCII8zsKK4VRru57MJWiz_TqLzS_Abfg3_ffgJXEJXmzWB4-BCucuqnXGXBb0FnufgWHsFl9335qVw8bhYUg5OLxucve0NfZQ
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=Hybrid+Multi-Objective+Artificial+Bee+Colony+for+Flexible+Assembly+Job+Shop+with+Learning+Effect&rft.jtitle=Mathematics+%28Basel%29&rft.au=Zhaosheng+Du&rft.au=Junqing+Li&rft.au=Jiake+Li&rft.date=2025-02-01&rft.pub=MDPI+AG&rft.eissn=2227-7390&rft.volume=13&rft.issue=3&rft.spage=472&rft_id=info:doi/10.3390%2Fmath13030472&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_a75505541e5c40bcbb4320b1840903b3
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2227-7390&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2227-7390&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2227-7390&client=summon