A gamified teaching–learning based optimization algorithm for a three-echelon supply chain scheduling problem in a two-stage assembly flow shop environment

The supply chain scheduling problem, which is an integrated production scheduling and distribution through the batch delivery system, has been studied by researchers for more than two decades. So far, all researches in this regard have studied the two-echelon supply chain network. The first novelty...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Applied soft computing Jg. 146; S. 110598
Hauptverfasser: Rostami, Mohammad, Yousefzadeh, Ali
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 01.10.2023
Schlagworte:
ISSN:1568-4946
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract The supply chain scheduling problem, which is an integrated production scheduling and distribution through the batch delivery system, has been studied by researchers for more than two decades. So far, all researches in this regard have studied the two-echelon supply chain network. The first novelty of this research is that, for the first time, the three-echelon supply chain scheduling problem, including supplier, manufacturer and customer, is investigated considering two separated batch delivery systems for transportation, simultaneously. To do so, a two-stage assembly flow shop environment is used. In the first stage, there are a number of decentralized suppliers who are responsible for manufacturing components. The components are dispatched to the second stage (assembly stage) with the first batch delivery system and after assembly, the orders are dispatched to the customer through secondary batch delivery system. The purpose of this problem is to minimize the cost of total completion time plus batch delivery costs. First, a mixed integer linear programming model (MILP) is presented that is able to solve small-size instances in a logical time. The second novelty of this research is that, to solve large-size instances, a novel gamified teaching–learning based optimization (GTLBO) algorithm is developed with applying a number of dominance rules and gamification tools. The computational results indicate the superiority of the new TLBO variant over its standard form and two well-known methods, i.e. GA and PSO, especially by applying the dominance rules. •Three-echelon supply chain scheduling problem is investigated for the first time.•A comprehensive and integrated MILP model is developed for the problem.•A number of properties and dominance rules are provided to facilitate problem solving.•A new variant of TLBO algorithm, namely GTLBO, is introduced for the first time.•Some managerial insights and computational tests are provided to evaluate solution methods.
AbstractList The supply chain scheduling problem, which is an integrated production scheduling and distribution through the batch delivery system, has been studied by researchers for more than two decades. So far, all researches in this regard have studied the two-echelon supply chain network. The first novelty of this research is that, for the first time, the three-echelon supply chain scheduling problem, including supplier, manufacturer and customer, is investigated considering two separated batch delivery systems for transportation, simultaneously. To do so, a two-stage assembly flow shop environment is used. In the first stage, there are a number of decentralized suppliers who are responsible for manufacturing components. The components are dispatched to the second stage (assembly stage) with the first batch delivery system and after assembly, the orders are dispatched to the customer through secondary batch delivery system. The purpose of this problem is to minimize the cost of total completion time plus batch delivery costs. First, a mixed integer linear programming model (MILP) is presented that is able to solve small-size instances in a logical time. The second novelty of this research is that, to solve large-size instances, a novel gamified teaching–learning based optimization (GTLBO) algorithm is developed with applying a number of dominance rules and gamification tools. The computational results indicate the superiority of the new TLBO variant over its standard form and two well-known methods, i.e. GA and PSO, especially by applying the dominance rules. •Three-echelon supply chain scheduling problem is investigated for the first time.•A comprehensive and integrated MILP model is developed for the problem.•A number of properties and dominance rules are provided to facilitate problem solving.•A new variant of TLBO algorithm, namely GTLBO, is introduced for the first time.•Some managerial insights and computational tests are provided to evaluate solution methods.
ArticleNumber 110598
Author Rostami, Mohammad
Yousefzadeh, Ali
Author_xml – sequence: 1
  givenname: Mohammad
  surname: Rostami
  fullname: Rostami, Mohammad
  email: rostami_m@shahroodut.ac.ir
  organization: Department of Industrial Engineering and Management, Shahrood University of Technology, Shahroud, Iran
– sequence: 2
  givenname: Ali
  surname: Yousefzadeh
  fullname: Yousefzadeh, Ali
  organization: Department of Management, University of Tehran, Tehran, Iran
BookMark eNp9kDtuJCEQQAm8kr8XcMQFehZmephGcmJZ-5MsObFjVEAxzYiGFmBbduQ7bLyX80mW2dnIgaP6vpLqnZKjmCIScsnZgjMuvu4WUJJZLNlyteCcreVwRE74WgxdL3txTE5L2bG2KJfDCflzTbcweefR0opgRh-372-_A0KOLaUaSpukufrJv0L1KVII25R9HSfqUqZA65gROzQjhjYtj_McXqgZwbeiNe1j2B-ac9IBJ9q6DXlOXamwRQql4KQb4EJ6pmVMM8X45HOKE8Z6Tr44CAUv_scz8vD92_3Nz-727sevm-vbzqwYq91guZRrYzWCEL2Qrh8YlxsLjglhN3aNEpyzTGipjTQMNkZLi72RejU4jaszsjzcNTmVktGpOfsJ8oviTO2lqp3aS1V7qeogtUHDB8j4-k9RzeDD5-jVAcX21JPHrIrxGA1an9FUZZP_DP8LSDed0w
CitedBy_id crossref_primary_10_3233_JIFS_238627
crossref_primary_10_1109_ACCESS_2025_3548146
crossref_primary_10_1080_21681015_2024_2370847
crossref_primary_10_1016_j_eswa_2024_124669
crossref_primary_10_1007_s12351_024_00844_7
crossref_primary_10_1016_j_engappai_2024_108668
crossref_primary_10_1007_s11831_025_10252_5
crossref_primary_10_32604_cmc_2024_049481
Cites_doi 10.1080/07408179908969812
10.1016/j.chb.2016.12.033
10.1016/j.ejor.2006.02.016
10.1016/j.cor.2006.07.006
10.1021/ie0100030
10.1007/s00500-021-06099-0
10.1016/j.cie.2011.08.014
10.1016/j.cie.2013.09.014
10.1016/0377-2217(95)00351-7
10.1016/j.apm.2015.03.052
10.5267/j.uscm.2018.5.001
10.1080/00207543.2021.2009586
10.1016/j.engappai.2017.05.004
10.1080/00207543.2020.1757174
10.1016/j.cie.2021.107634
10.1016/j.omega.2022.102804
10.1109/TSMC.2017.2720178
10.1016/j.ejor.2006.09.087
10.1016/j.omega.2012.06.002
10.1016/j.cie.2018.09.035
10.1016/j.cor.2014.08.012
10.1016/j.chb.2015.07.045
10.1007/s10845-013-0775-5
10.1016/j.cie.2017.07.029
10.1080/0305215X.2017.1400546
10.1016/j.jclepro.2019.119517
10.1016/j.cad.2010.12.015
10.1016/S0925-5273(99)00105-X
10.1016/j.cor.2021.105515
10.1145/2393132.2393137
10.1016/j.ejor.2005.09.006
10.1108/JM2-10-2016-0094
10.1080/00207543.2019.1693659
10.1287/opre.1080.0688
10.1108/K-10-2020-0697
10.1007/s10732-014-9249-y
10.1002/nav.21813
10.1155/2015/464390
10.1287/opre.51.4.566.16106
10.1287/mnsc.39.5.616
10.1016/j.ejor.2021.04.020
10.1080/00207543.2020.1836422
ContentType Journal Article
Copyright 2023 Elsevier B.V.
Copyright_xml – notice: 2023 Elsevier B.V.
DBID AAYXX
CITATION
DOI 10.1016/j.asoc.2023.110598
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
ExternalDocumentID 10_1016_j_asoc_2023_110598
S1568494623006166
GroupedDBID --K
--M
.DC
.~1
0R~
1B1
1~.
1~5
23M
4.4
457
4G.
53G
5GY
5VS
6J9
7-5
71M
8P~
AABNK
AACTN
AAEDT
AAEDW
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AATTM
AAXKI
AAXUO
AAYFN
ABBOA
ABFNM
ABFRF
ABJNI
ABMAC
ABWVN
ABXDB
ACDAQ
ACGFO
ACGFS
ACNNM
ACRLP
ACRPL
ACZNC
ADBBV
ADEZE
ADJOM
ADMUD
ADNMO
ADTZH
AEBSH
AECPX
AEFWE
AEIPS
AEKER
AENEX
AFJKZ
AFTJW
AGHFR
AGUBO
AGYEJ
AHJVU
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AKRWK
ALMA_UNASSIGNED_HOLDINGS
AMRAJ
ANKPU
AOUOD
ASPBG
AVWKF
AXJTR
AZFZN
BJAXD
BKOJK
BLXMC
BNPGV
CS3
EBS
EFJIC
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-Q
GBLVA
GBOLZ
HVGLF
HZ~
IHE
J1W
JJJVA
KOM
M41
MO0
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
ROL
RPZ
SDF
SDG
SES
SEW
SPC
SPCBC
SSH
SST
SSV
SSZ
T5K
UHS
UNMZH
~G-
9DU
AAYWO
AAYXX
ACLOT
ACVFH
ADCNI
AEUPX
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKYEP
APXCP
CITATION
EFKBS
EFLBG
~HD
ID FETCH-LOGICAL-c300t-8d1995cdbea66469f480197daf066d7d5e9affd06b9bc9c0a7cb9de4c9b38fbe3
ISICitedReferencesCount 8
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001054450800001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1568-4946
IngestDate Sat Nov 29 06:58:39 EST 2025
Tue Nov 18 22:28:44 EST 2025
Sun Apr 06 06:53:42 EDT 2025
IsPeerReviewed true
IsScholarly true
Keywords Two-stage assembly flow shop
Batch delivery system
Three-echelon supply chain
Gamified TLBO
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c300t-8d1995cdbea66469f480197daf066d7d5e9affd06b9bc9c0a7cb9de4c9b38fbe3
ParticipantIDs crossref_primary_10_1016_j_asoc_2023_110598
crossref_citationtrail_10_1016_j_asoc_2023_110598
elsevier_sciencedirect_doi_10_1016_j_asoc_2023_110598
PublicationCentury 2000
PublicationDate October 2023
2023-10-00
PublicationDateYYYYMMDD 2023-10-01
PublicationDate_xml – month: 10
  year: 2023
  text: October 2023
PublicationDecade 2020
PublicationTitle Applied soft computing
PublicationYear 2023
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References Kong, Pei, Xu, Liu, Yu, Pardalos (b31) 2020; 58
Kazemi, Mazdeh, Rostami (b10) 2017; 63
Abedi, Seidgar (b23) 2016; 23
Sailer, Hense, Mayr, Mandl (b48) 2017; 69
Hall, Potts (b12) 2003; 51
Lei, Su, Li (b7) 2021; 59
Hamari (b41) 2007
Yang, Xu (b38) 2021; 59
Cheng, Wang (b9) 1999; 31
Mazdeh, Sarhadi, Hindi (b14) 2008; 35
K. Huotari, J. Hamari, Defining gamification: A service marketing perspective, in: Proceeding of the 16th International Academic MindTrek Conference, 2012, pp. 17–22.
Romeijn, Shu, Teo (b3) 2007; 178
Basir, Mazdeh, Namakshenas (b34) 2018; 126
Beheshtinia, Ghasemi (b39) 2018; 50
Li, Li, Zhang, Zhang (b37) 2021; 25
Mazdeh, Sarhadi, Hindi (b13) 2007; 183
Noroozi, Mazdeh, Heydari, Rasti-Barzoki (b25) 2019; 7
Yin, Yang, Wang, Cheng, Wu (b24) 2018; 65
Allahverdi, Aydilek (b49) 2015; 26
Mazdeh, Rostami (b28) 2014; 1
Sana (b4) 2021
Juman, M’Hallah, Lokuhetti, Battaïa (b32) 2023; 61
Wang, Cheng (b11) 2000; 68
Ji, He, Cheng (b15) 2007; 176
Rostami, Kheirandish, Ansari (b1) 2015; 39
Chen (b43) 2010; 58
Tsiakis, Shah, Pantelides (b2) 2001; 40
Lin, Wang, Oulamara (b36) 2023; 116
Wang, Luo, Liu, Yue (b33) 2017; 48
Bachtenkirch, Bock (b20) 2022; 297
Cakici, Mason, Geismar, Fowler (b29) 2014; 20
Gharaei, Jolai (b26) 2021; 21
Qi, Yuan (b18) 2017; 111
Hamari, Koivisto, Sarsa (b42) 2014
Gong, Zhang, Peng (b30) 2015; 2015
Bank, Mahdavi Mazdeh, Heydari, Teimoury (b27) 2022; 51
Hamari, Shernoff, Rowe, Coller, Asbell-Clarke, Edwards (b47) 2016; 54
Mazdeh, Rostami, Namaki (b17) 2013; 66
Tirkolaee, Mardani, Dashtian, Soltani, Weber (b5) 2020; 250
Rostami (b19) 2021; 161
Ahmadizar, Farhadi (b22) 2015; 53
Hamidinia, Khakabimamaghani, Mazdeh, Jafari (b21) 2012; 62
Rostami, Shad (b35) 2020; 5
Della Croce, Narayan, Tadei (b44) 1996; 90
Sun, Guo, Li (b6) 2022; 137
Rao, Savsani, Vakharia (b45) 2011; 43
Yin, Cheng, Hsu, Wu (b16) 2013; 41
Lee, Cheng, Lin (b8) 1993; 39
Beheshtinia, Ghasemi, Farokhnia (b40) 2018; 13
Hamari (10.1016/j.asoc.2023.110598_b41) 2007
Kong (10.1016/j.asoc.2023.110598_b31) 2020; 58
Rostami (10.1016/j.asoc.2023.110598_b1) 2015; 39
Ahmadizar (10.1016/j.asoc.2023.110598_b22) 2015; 53
Hamari (10.1016/j.asoc.2023.110598_b42) 2014
Lei (10.1016/j.asoc.2023.110598_b7) 2021; 59
Della Croce (10.1016/j.asoc.2023.110598_b44) 1996; 90
Chen (10.1016/j.asoc.2023.110598_b43) 2010; 58
Tsiakis (10.1016/j.asoc.2023.110598_b2) 2001; 40
Kazemi (10.1016/j.asoc.2023.110598_b10) 2017; 63
Wang (10.1016/j.asoc.2023.110598_b11) 2000; 68
Rostami (10.1016/j.asoc.2023.110598_b35) 2020; 5
Qi (10.1016/j.asoc.2023.110598_b18) 2017; 111
Yin (10.1016/j.asoc.2023.110598_b24) 2018; 65
Cakici (10.1016/j.asoc.2023.110598_b29) 2014; 20
Gharaei (10.1016/j.asoc.2023.110598_b26) 2021; 21
Mazdeh (10.1016/j.asoc.2023.110598_b13) 2007; 183
Juman (10.1016/j.asoc.2023.110598_b32) 2023; 61
Bachtenkirch (10.1016/j.asoc.2023.110598_b20) 2022; 297
Lin (10.1016/j.asoc.2023.110598_b36) 2023; 116
Mazdeh (10.1016/j.asoc.2023.110598_b17) 2013; 66
Gong (10.1016/j.asoc.2023.110598_b30) 2015; 2015
Beheshtinia (10.1016/j.asoc.2023.110598_b39) 2018; 50
Allahverdi (10.1016/j.asoc.2023.110598_b49) 2015; 26
Abedi (10.1016/j.asoc.2023.110598_b23) 2016; 23
Lee (10.1016/j.asoc.2023.110598_b8) 1993; 39
Rao (10.1016/j.asoc.2023.110598_b45) 2011; 43
Li (10.1016/j.asoc.2023.110598_b37) 2021; 25
Sana (10.1016/j.asoc.2023.110598_b4) 2021
Mazdeh (10.1016/j.asoc.2023.110598_b14) 2008; 35
10.1016/j.asoc.2023.110598_b46
Mazdeh (10.1016/j.asoc.2023.110598_b28) 2014; 1
Romeijn (10.1016/j.asoc.2023.110598_b3) 2007; 178
Noroozi (10.1016/j.asoc.2023.110598_b25) 2019; 7
Sun (10.1016/j.asoc.2023.110598_b6) 2022; 137
Bank (10.1016/j.asoc.2023.110598_b27) 2022; 51
Beheshtinia (10.1016/j.asoc.2023.110598_b40) 2018; 13
Hall (10.1016/j.asoc.2023.110598_b12) 2003; 51
Ji (10.1016/j.asoc.2023.110598_b15) 2007; 176
Tirkolaee (10.1016/j.asoc.2023.110598_b5) 2020; 250
Rostami (10.1016/j.asoc.2023.110598_b19) 2021; 161
Wang (10.1016/j.asoc.2023.110598_b33) 2017; 48
Yang (10.1016/j.asoc.2023.110598_b38) 2021; 59
Basir (10.1016/j.asoc.2023.110598_b34) 2018; 126
Cheng (10.1016/j.asoc.2023.110598_b9) 1999; 31
Hamidinia (10.1016/j.asoc.2023.110598_b21) 2012; 62
Yin (10.1016/j.asoc.2023.110598_b16) 2013; 41
Hamari (10.1016/j.asoc.2023.110598_b47) 2016; 54
Sailer (10.1016/j.asoc.2023.110598_b48) 2017; 69
References_xml – volume: 51
  start-page: 1151
  year: 2022
  end-page: 1179
  ident: b27
  article-title: Coordinating lot sizing and integrated production and distribution scheduling with batch delivery and holding cost
  publication-title: Kybernetes
– volume: 61
  start-page: 462
  year: 2023
  end-page: 484
  ident: b32
  article-title: A multi-vendor multi-buyer integrated production–inventory model with synchronised unequal-sized batch delivery
  publication-title: Int. J. Prod. Res.
– volume: 59
  start-page: 7232
  year: 2021
  end-page: 7245
  ident: b7
  article-title: Cooperated teaching-learning-based optimisation for distributed two-stage assembly flow shop scheduling
  publication-title: Int. J. Prod. Res.
– volume: 31
  start-page: 135
  year: 1999
  end-page: 143
  ident: b9
  article-title: Scheduling the fabrication and assembly of components in a two-machine flowshop
  publication-title: IIE Trans.
– volume: 58
  start-page: 5132
  year: 2020
  end-page: 5154
  ident: b31
  article-title: A robust optimization approach for integrated steel production and batch delivery scheduling with uncertain rolling times and deterioration effect
  publication-title: Int. J. Prod. Res.
– volume: 66
  start-page: 675
  year: 2013
  end-page: 682
  ident: b17
  article-title: Minimizing maximum tardiness and delivery costs in a batched delivery system
  publication-title: Comput. Ind. Eng.
– volume: 35
  start-page: 1099
  year: 2008
  end-page: 1111
  ident: b14
  article-title: A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times
  publication-title: Comput. Oper. Res.
– reference: K. Huotari, J. Hamari, Defining gamification: A service marketing perspective, in: Proceeding of the 16th International Academic MindTrek Conference, 2012, pp. 17–22.
– volume: 41
  start-page: 216
  year: 2013
  end-page: 225
  ident: b16
  article-title: Single-machine batch delivery scheduling with an assignable common due window
  publication-title: Omega
– volume: 111
  start-page: 458
  year: 2017
  end-page: 462
  ident: b18
  article-title: A further study on two-agent scheduling on an unbounded serial-batch machine with batch delivery cost
  publication-title: Comput. Ind. Eng.
– start-page: 1
  year: 2021
  end-page: 29
  ident: b4
  article-title: A structural mathematical model on two echelon supply chain system
  publication-title: Ann. Oper. Res.
– start-page: 1
  year: 2007
  end-page: 3
  ident: b41
  article-title: Gamification, the Blackwell Encyclopedia of Sociology
– volume: 68
  start-page: 177
  year: 2000
  end-page: 183
  ident: b11
  article-title: Parallel machine scheduling with batch delivery costs
  publication-title: Int. J. Prod. Econ.
– volume: 62
  start-page: 29
  year: 2012
  end-page: 38
  ident: b21
  article-title: A genetic algorithm for minimizing total tardiness/earliness of weighted jobs in a batched delivery system
  publication-title: Comput. Ind. Eng.
– volume: 63
  start-page: 98
  year: 2017
  end-page: 107
  ident: b10
  article-title: The two stage assembly flow-shop scheduling problem with batching and delivery
  publication-title: Eng. Appl. Artif. Intell.
– volume: 13
  start-page: 27
  year: 2018
  end-page: 49
  ident: b40
  article-title: Supply chain scheduling and routing in multi-site manufacturing system (case study: A drug manufacturing company)
  publication-title: J. Model. Manag.
– volume: 54
  start-page: 170
  year: 2016
  end-page: 179
  ident: b47
  article-title: Challenging games help students learn: An empirical study on engagement, flow and immersion in game-based learning
  publication-title: Comput. Hum. Behav.
– volume: 23
  start-page: 135
  year: 2016
  end-page: 152
  ident: b23
  article-title: A new bi-level meta-heuristic approach for a single machine JIT-scheduling in the batch delivery system with controllable due dates
  publication-title: Int. J. Serv. Oper. Manag.
– volume: 183
  start-page: 74
  year: 2007
  end-page: 86
  ident: b13
  article-title: A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs
  publication-title: European J. Oper. Res.
– volume: 176
  start-page: 745
  year: 2007
  end-page: 755
  ident: b15
  article-title: Batch delivery scheduling with batch delivery cost on a single machine
  publication-title: European J. Oper. Res.
– volume: 69
  start-page: 371
  year: 2017
  end-page: 380
  ident: b48
  article-title: How gamification motivates: An experimental study of the effects of specific game design elements on psychological need satisfaction
  publication-title: Comput. Hum. Behav.
– volume: 39
  start-page: 616
  year: 1993
  end-page: 625
  ident: b8
  article-title: Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem
  publication-title: Manage. Sci.
– volume: 7
  start-page: 73
  year: 2019
  end-page: 96
  ident: b25
  article-title: Coordinating order acceptance and integrated lot streaming-batch delivery scheduling considering third party logistics
  publication-title: Uncertain Supply Chain Manag.
– volume: 51
  start-page: 566
  year: 2003
  end-page: 584
  ident: b12
  article-title: Supply chain scheduling: Batching and delivery
  publication-title: Oper. Res.
– volume: 58
  start-page: 130
  year: 2010
  end-page: 148
  ident: b43
  article-title: Integrated production and outbound distribution scheduling: Review and extensions
  publication-title: Oper. Res.
– volume: 40
  start-page: 3585
  year: 2001
  end-page: 3604
  ident: b2
  article-title: Design of multi-echelon supply chain networks under demand uncertainty
  publication-title: Ind. Eng. Chem. Res.
– volume: 53
  start-page: 194
  year: 2015
  end-page: 205
  ident: b22
  article-title: Single-machine batch delivery scheduling with job release dates, due windows and earliness, tardiness, holding and delivery costs
  publication-title: Comput. Oper. Res.
– volume: 161
  year: 2021
  ident: b19
  article-title: Minimizing maximum tardiness subject to collect the EOL products in a single machine scheduling problem with capacitated batch delivery and pickup systems
  publication-title: Comput. Ind. Eng.
– volume: 59
  start-page: 4053
  year: 2021
  end-page: 4071
  ident: b38
  article-title: The distributed assembly permutation flowshop scheduling problem with flexible assembly and batch delivery
  publication-title: Int. J. Prod. Res.
– volume: 43
  start-page: 303
  year: 2011
  end-page: 315
  ident: b45
  article-title: Teaching–learning-based optimization: A novel method for constrained mechanical design optimization problems
  publication-title: Comput. Aided Des.
– volume: 21
  start-page: 2333
  year: 2021
  end-page: 2364
  ident: b26
  article-title: A Pareto approach for the multi-factory supply chain scheduling and distribution problem
  publication-title: Oper. Res.
– volume: 126
  start-page: 217
  year: 2018
  end-page: 231
  ident: b34
  article-title: Bi-level genetic algorithms for a two-stage assembly flow-shop scheduling problem with batch delivery system
  publication-title: Comput. Ind. Eng.
– volume: 2015
  year: 2015
  ident: b30
  article-title: Scheduling and common due date assignment on a single parallel-batching machine with batch delivery
  publication-title: Discrete Dyn. Nat. Soc.
– volume: 178
  start-page: 449
  year: 2007
  end-page: 462
  ident: b3
  article-title: Designing two-echelon supply networks
  publication-title: European J. Oper. Res.
– volume: 1
  start-page: 94
  year: 2014
  end-page: 104
  ident: b28
  article-title: A branch-and-bound algorithm for two-machine flow-shop scheduling problems with batch delivery costs
  publication-title: Int. J. Syst. Sci.: Oper. Logist.
– volume: 25
  start-page: 13181
  year: 2021
  end-page: 13194
  ident: b37
  article-title: A wale optimization algorithm for distributed flow shop with batch delivery
  publication-title: Soft Comput.
– volume: 297
  start-page: 133
  year: 2022
  end-page: 152
  ident: b20
  article-title: Finding efficient make-to-order production and batch delivery schedules
  publication-title: European J. Oper. Res.
– volume: 50
  start-page: 1415
  year: 2018
  end-page: 1433
  ident: b39
  article-title: A multi-objective and integrated model for supply chain scheduling optimization in a multi-site manufacturing system
  publication-title: Eng. Optim.
– volume: 48
  start-page: 1826
  year: 2017
  end-page: 1837
  ident: b33
  article-title: Permutation flow shop scheduling with batch delivery to multiple customers in supply chains
  publication-title: IEEE Trans. Syst., Man, Cybern.: Syst.
– volume: 26
  start-page: 225
  year: 2015
  end-page: 237
  ident: b49
  article-title: The two stage assembly flowshop scheduling problem to minimize total tardiness
  publication-title: J. Intell. Manuf.
– volume: 5
  start-page: 137
  year: 2020
  end-page: 164
  ident: b35
  article-title: A hybrid bee algorithm for two-machine flow-shop scheduling problems with batch delivery
  publication-title: J. Qual. Eng. Prod. Optim.
– volume: 250
  year: 2020
  ident: b5
  article-title: A novel hybrid method using fuzzy decision making and multi-objective programming for sustainable-reliable supplier selection in two-echelon supply chain design
  publication-title: J. Clean. Prod.
– volume: 137
  year: 2022
  ident: b6
  article-title: An order-splitting model for supplier selection and order allocation in a multi-echelon supply chain
  publication-title: Comput. Oper. Res.
– volume: 90
  start-page: 227
  year: 1996
  end-page: 237
  ident: b44
  article-title: The two-machine total completion time flow shop problem
  publication-title: European J. Oper. Res.
– start-page: 3025
  year: 2014
  end-page: 3034
  ident: b42
  article-title: Does gamification work?–A literature review of empirical studies on gamification
  publication-title: 2014 47th Hawaii International Conference on System Sciences
– volume: 39
  start-page: 4909
  year: 2015
  end-page: 4927
  ident: b1
  article-title: Minimizing maximum tardiness and delivery costs with batch delivery and job release times
  publication-title: Appl. Math. Model.
– volume: 65
  start-page: 393
  year: 2018
  end-page: 409
  ident: b24
  article-title: Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents
  publication-title: Nav. Res. Logist.
– volume: 20
  start-page: 511
  year: 2014
  end-page: 537
  ident: b29
  article-title: Scheduling parallel machines with single vehicle delivery
  publication-title: J. Heuristics
– volume: 116
  year: 2023
  ident: b36
  article-title: Online scheduling on parallel-batch machines with periodic availability constraints and job delivery
  publication-title: Omega
– volume: 31
  start-page: 135
  issue: 2
  year: 1999
  ident: 10.1016/j.asoc.2023.110598_b9
  article-title: Scheduling the fabrication and assembly of components in a two-machine flowshop
  publication-title: IIE Trans.
  doi: 10.1080/07408179908969812
– volume: 69
  start-page: 371
  year: 2017
  ident: 10.1016/j.asoc.2023.110598_b48
  article-title: How gamification motivates: An experimental study of the effects of specific game design elements on psychological need satisfaction
  publication-title: Comput. Hum. Behav.
  doi: 10.1016/j.chb.2016.12.033
– volume: 178
  start-page: 449
  issue: 2
  year: 2007
  ident: 10.1016/j.asoc.2023.110598_b3
  article-title: Designing two-echelon supply networks
  publication-title: European J. Oper. Res.
  doi: 10.1016/j.ejor.2006.02.016
– volume: 35
  start-page: 1099
  issue: 4
  year: 2008
  ident: 10.1016/j.asoc.2023.110598_b14
  article-title: A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2006.07.006
– start-page: 1
  year: 2007
  ident: 10.1016/j.asoc.2023.110598_b41
– volume: 40
  start-page: 3585
  issue: 16
  year: 2001
  ident: 10.1016/j.asoc.2023.110598_b2
  article-title: Design of multi-echelon supply chain networks under demand uncertainty
  publication-title: Ind. Eng. Chem. Res.
  doi: 10.1021/ie0100030
– volume: 25
  start-page: 13181
  issue: 21
  year: 2021
  ident: 10.1016/j.asoc.2023.110598_b37
  article-title: A wale optimization algorithm for distributed flow shop with batch delivery
  publication-title: Soft Comput.
  doi: 10.1007/s00500-021-06099-0
– volume: 62
  start-page: 29
  issue: 1
  year: 2012
  ident: 10.1016/j.asoc.2023.110598_b21
  article-title: A genetic algorithm for minimizing total tardiness/earliness of weighted jobs in a batched delivery system
  publication-title: Comput. Ind. Eng.
  doi: 10.1016/j.cie.2011.08.014
– volume: 66
  start-page: 675
  issue: 4
  year: 2013
  ident: 10.1016/j.asoc.2023.110598_b17
  article-title: Minimizing maximum tardiness and delivery costs in a batched delivery system
  publication-title: Comput. Ind. Eng.
  doi: 10.1016/j.cie.2013.09.014
– volume: 21
  start-page: 2333
  issue: 4
  year: 2021
  ident: 10.1016/j.asoc.2023.110598_b26
  article-title: A Pareto approach for the multi-factory supply chain scheduling and distribution problem
  publication-title: Oper. Res.
– volume: 90
  start-page: 227
  issue: 2
  year: 1996
  ident: 10.1016/j.asoc.2023.110598_b44
  article-title: The two-machine total completion time flow shop problem
  publication-title: European J. Oper. Res.
  doi: 10.1016/0377-2217(95)00351-7
– volume: 1
  start-page: 94
  issue: 2
  year: 2014
  ident: 10.1016/j.asoc.2023.110598_b28
  article-title: A branch-and-bound algorithm for two-machine flow-shop scheduling problems with batch delivery costs
  publication-title: Int. J. Syst. Sci.: Oper. Logist.
– volume: 39
  start-page: 4909
  issue: 16
  year: 2015
  ident: 10.1016/j.asoc.2023.110598_b1
  article-title: Minimizing maximum tardiness and delivery costs with batch delivery and job release times
  publication-title: Appl. Math. Model.
  doi: 10.1016/j.apm.2015.03.052
– volume: 7
  start-page: 73
  issue: 1
  year: 2019
  ident: 10.1016/j.asoc.2023.110598_b25
  article-title: Coordinating order acceptance and integrated lot streaming-batch delivery scheduling considering third party logistics
  publication-title: Uncertain Supply Chain Manag.
  doi: 10.5267/j.uscm.2018.5.001
– volume: 61
  start-page: 462
  issue: 2
  year: 2023
  ident: 10.1016/j.asoc.2023.110598_b32
  article-title: A multi-vendor multi-buyer integrated production–inventory model with synchronised unequal-sized batch delivery
  publication-title: Int. J. Prod. Res.
  doi: 10.1080/00207543.2021.2009586
– volume: 63
  start-page: 98
  year: 2017
  ident: 10.1016/j.asoc.2023.110598_b10
  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: 59
  start-page: 4053
  issue: 13
  year: 2021
  ident: 10.1016/j.asoc.2023.110598_b38
  article-title: The distributed assembly permutation flowshop scheduling problem with flexible assembly and batch delivery
  publication-title: Int. J. Prod. Res.
  doi: 10.1080/00207543.2020.1757174
– volume: 161
  year: 2021
  ident: 10.1016/j.asoc.2023.110598_b19
  article-title: Minimizing maximum tardiness subject to collect the EOL products in a single machine scheduling problem with capacitated batch delivery and pickup systems
  publication-title: Comput. Ind. Eng.
  doi: 10.1016/j.cie.2021.107634
– volume: 23
  start-page: 135
  issue: 2
  year: 2016
  ident: 10.1016/j.asoc.2023.110598_b23
  article-title: A new bi-level meta-heuristic approach for a single machine JIT-scheduling in the batch delivery system with controllable due dates
  publication-title: Int. J. Serv. Oper. Manag.
– volume: 116
  year: 2023
  ident: 10.1016/j.asoc.2023.110598_b36
  article-title: Online scheduling on parallel-batch machines with periodic availability constraints and job delivery
  publication-title: Omega
  doi: 10.1016/j.omega.2022.102804
– start-page: 1
  year: 2021
  ident: 10.1016/j.asoc.2023.110598_b4
  article-title: A structural mathematical model on two echelon supply chain system
  publication-title: Ann. Oper. Res.
– volume: 48
  start-page: 1826
  issue: 10
  year: 2017
  ident: 10.1016/j.asoc.2023.110598_b33
  article-title: Permutation flow shop scheduling with batch delivery to multiple customers in supply chains
  publication-title: IEEE Trans. Syst., Man, Cybern.: Syst.
  doi: 10.1109/TSMC.2017.2720178
– volume: 183
  start-page: 74
  issue: 1
  year: 2007
  ident: 10.1016/j.asoc.2023.110598_b13
  article-title: A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs
  publication-title: European J. Oper. Res.
  doi: 10.1016/j.ejor.2006.09.087
– volume: 41
  start-page: 216
  issue: 2
  year: 2013
  ident: 10.1016/j.asoc.2023.110598_b16
  article-title: Single-machine batch delivery scheduling with an assignable common due window
  publication-title: Omega
  doi: 10.1016/j.omega.2012.06.002
– volume: 126
  start-page: 217
  year: 2018
  ident: 10.1016/j.asoc.2023.110598_b34
  article-title: Bi-level genetic algorithms for a two-stage assembly flow-shop scheduling problem with batch delivery system
  publication-title: Comput. Ind. Eng.
  doi: 10.1016/j.cie.2018.09.035
– volume: 53
  start-page: 194
  year: 2015
  ident: 10.1016/j.asoc.2023.110598_b22
  article-title: Single-machine batch delivery scheduling with job release dates, due windows and earliness, tardiness, holding and delivery costs
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2014.08.012
– volume: 54
  start-page: 170
  year: 2016
  ident: 10.1016/j.asoc.2023.110598_b47
  article-title: Challenging games help students learn: An empirical study on engagement, flow and immersion in game-based learning
  publication-title: Comput. Hum. Behav.
  doi: 10.1016/j.chb.2015.07.045
– volume: 26
  start-page: 225
  issue: 2
  year: 2015
  ident: 10.1016/j.asoc.2023.110598_b49
  article-title: The two stage assembly flowshop scheduling problem to minimize total tardiness
  publication-title: J. Intell. Manuf.
  doi: 10.1007/s10845-013-0775-5
– volume: 111
  start-page: 458
  year: 2017
  ident: 10.1016/j.asoc.2023.110598_b18
  article-title: A further study on two-agent scheduling on an unbounded serial-batch machine with batch delivery cost
  publication-title: Comput. Ind. Eng.
  doi: 10.1016/j.cie.2017.07.029
– volume: 50
  start-page: 1415
  issue: 9
  year: 2018
  ident: 10.1016/j.asoc.2023.110598_b39
  article-title: A multi-objective and integrated model for supply chain scheduling optimization in a multi-site manufacturing system
  publication-title: Eng. Optim.
  doi: 10.1080/0305215X.2017.1400546
– volume: 250
  year: 2020
  ident: 10.1016/j.asoc.2023.110598_b5
  article-title: A novel hybrid method using fuzzy decision making and multi-objective programming for sustainable-reliable supplier selection in two-echelon supply chain design
  publication-title: J. Clean. Prod.
  doi: 10.1016/j.jclepro.2019.119517
– volume: 43
  start-page: 303
  issue: 3
  year: 2011
  ident: 10.1016/j.asoc.2023.110598_b45
  article-title: Teaching–learning-based optimization: A novel method for constrained mechanical design optimization problems
  publication-title: Comput. Aided Des.
  doi: 10.1016/j.cad.2010.12.015
– volume: 68
  start-page: 177
  issue: 2
  year: 2000
  ident: 10.1016/j.asoc.2023.110598_b11
  article-title: Parallel machine scheduling with batch delivery costs
  publication-title: Int. J. Prod. Econ.
  doi: 10.1016/S0925-5273(99)00105-X
– volume: 137
  year: 2022
  ident: 10.1016/j.asoc.2023.110598_b6
  article-title: An order-splitting model for supplier selection and order allocation in a multi-echelon supply chain
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2021.105515
– ident: 10.1016/j.asoc.2023.110598_b46
  doi: 10.1145/2393132.2393137
– volume: 5
  start-page: 137
  issue: 1
  year: 2020
  ident: 10.1016/j.asoc.2023.110598_b35
  article-title: A hybrid bee algorithm for two-machine flow-shop scheduling problems with batch delivery
  publication-title: J. Qual. Eng. Prod. Optim.
– volume: 176
  start-page: 745
  issue: 2
  year: 2007
  ident: 10.1016/j.asoc.2023.110598_b15
  article-title: Batch delivery scheduling with batch delivery cost on a single machine
  publication-title: European J. Oper. Res.
  doi: 10.1016/j.ejor.2005.09.006
– volume: 13
  start-page: 27
  issue: 1
  year: 2018
  ident: 10.1016/j.asoc.2023.110598_b40
  article-title: Supply chain scheduling and routing in multi-site manufacturing system (case study: A drug manufacturing company)
  publication-title: J. Model. Manag.
  doi: 10.1108/JM2-10-2016-0094
– volume: 58
  start-page: 5132
  issue: 17
  year: 2020
  ident: 10.1016/j.asoc.2023.110598_b31
  article-title: A robust optimization approach for integrated steel production and batch delivery scheduling with uncertain rolling times and deterioration effect
  publication-title: Int. J. Prod. Res.
  doi: 10.1080/00207543.2019.1693659
– volume: 58
  start-page: 130
  issue: 1
  year: 2010
  ident: 10.1016/j.asoc.2023.110598_b43
  article-title: Integrated production and outbound distribution scheduling: Review and extensions
  publication-title: Oper. Res.
  doi: 10.1287/opre.1080.0688
– volume: 51
  start-page: 1151
  issue: 3
  year: 2022
  ident: 10.1016/j.asoc.2023.110598_b27
  article-title: Coordinating lot sizing and integrated production and distribution scheduling with batch delivery and holding cost
  publication-title: Kybernetes
  doi: 10.1108/K-10-2020-0697
– volume: 20
  start-page: 511
  issue: 5
  year: 2014
  ident: 10.1016/j.asoc.2023.110598_b29
  article-title: Scheduling parallel machines with single vehicle delivery
  publication-title: J. Heuristics
  doi: 10.1007/s10732-014-9249-y
– volume: 65
  start-page: 393
  issue: 5
  year: 2018
  ident: 10.1016/j.asoc.2023.110598_b24
  article-title: Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents
  publication-title: Nav. Res. Logist.
  doi: 10.1002/nav.21813
– volume: 2015
  year: 2015
  ident: 10.1016/j.asoc.2023.110598_b30
  article-title: Scheduling and common due date assignment on a single parallel-batching machine with batch delivery
  publication-title: Discrete Dyn. Nat. Soc.
  doi: 10.1155/2015/464390
– volume: 51
  start-page: 566
  issue: 4
  year: 2003
  ident: 10.1016/j.asoc.2023.110598_b12
  article-title: Supply chain scheduling: Batching and delivery
  publication-title: Oper. Res.
  doi: 10.1287/opre.51.4.566.16106
– start-page: 3025
  year: 2014
  ident: 10.1016/j.asoc.2023.110598_b42
  article-title: Does gamification work?–A literature review of empirical studies on gamification
– volume: 39
  start-page: 616
  issue: 5
  year: 1993
  ident: 10.1016/j.asoc.2023.110598_b8
  article-title: Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem
  publication-title: Manage. Sci.
  doi: 10.1287/mnsc.39.5.616
– volume: 297
  start-page: 133
  issue: 1
  year: 2022
  ident: 10.1016/j.asoc.2023.110598_b20
  article-title: Finding efficient make-to-order production and batch delivery schedules
  publication-title: European J. Oper. Res.
  doi: 10.1016/j.ejor.2021.04.020
– volume: 59
  start-page: 7232
  issue: 23
  year: 2021
  ident: 10.1016/j.asoc.2023.110598_b7
  article-title: Cooperated teaching-learning-based optimisation for distributed two-stage assembly flow shop scheduling
  publication-title: Int. J. Prod. Res.
  doi: 10.1080/00207543.2020.1836422
SSID ssj0016928
Score 2.4347124
Snippet The supply chain scheduling problem, which is an integrated production scheduling and distribution through the batch delivery system, has been studied by...
SourceID crossref
elsevier
SourceType Enrichment Source
Index Database
Publisher
StartPage 110598
SubjectTerms Batch delivery system
Gamified TLBO
Three-echelon supply chain
Two-stage assembly flow shop
Title A gamified teaching–learning based optimization algorithm for a three-echelon supply chain scheduling problem in a two-stage assembly flow shop environment
URI https://dx.doi.org/10.1016/j.asoc.2023.110598
Volume 146
WOSCitedRecordID wos001054450800001&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: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  issn: 1568-4946
  databaseCode: AIEXJ
  dateStart: 20010601
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://www.sciencedirect.com
  omitProxy: false
  ssIdentifier: ssj0016928
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEF6FlAMX3qgtD-2Bm7VVUttr7zFCRYBQhUSRcrP2maSK4yhx2tJT_wNn_hy_hFnvrmNaVAESFyveeNaJ58vs7GS-GYRep2DywMzlRAsakyQzhjCVMyKkoEzqVMamKeL6MTs-zsdj9qnXuwxcmLN5tljkFxds-V9VDWOgbEud_Qt1t5PCALwGpcMR1A7HP1L8KJrwcmasa1n7VMmQ0RDPQyDELl4qqsBelJ6IGfH5pFrN6mnpEittBx-tibaZovDu2nb__Gp5wjM4gUG18UT2piGNDZuAyHlFwNuc6Ahccl0KEDDz6jxaT6tll1LX9YiDG7yG9aBJcN_UYTV1jR9r-DZN2Laa8rLkqmOn1tpccqWnjqkz60YwDre5cD6sdoNa4ywxzUnCfHwymGp3esPsuwjE6QEHRB_YW1h2Q-raW18rp_3ZTmznhb0X-DKU3kE7hxlc20c7o_dH4w_tf1CUNZ152w_iKVcuO_D6nX7v1nRclZOH6L7fY-CRw8Yj1NOLx-hB6N-BvTl_gr6PcIAKDlD5cfUtgAQ3IMFdkOAWJBhAgjn-BSTYgQQ3IMFbkGAPEgyjIBJAggNIsAUJtiDBHZA8RV_eHp28eUd8uw4i4VHWJFeW7i-V0JzShDJjKxOxTHEDbq3KVKoZN0YNqGBCMjngmRRM6UQyEedG6PgZ6i-qhd5FOBMqhp2DzIZDk-gBzWFZibWJWWxYZgZsDw3D0y6kr2VvW6rMi5C0eFpYDRVWQ4XT0B6KWpmlq-Ry69VpUGLhfVHnYxaAuVvk9v9R7jm6t_1pvED9erXRL9FdeVbP1qtXHpo_AYYRuDo
linkProvider Elsevier
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=A+gamified+teaching%E2%80%93learning+based+optimization+algorithm+for+a+three-echelon+supply+chain+scheduling+problem+in+a+two-stage+assembly+flow+shop+environment&rft.jtitle=Applied+soft+computing&rft.au=Rostami%2C+Mohammad&rft.au=Yousefzadeh%2C+Ali&rft.date=2023-10-01&rft.pub=Elsevier+B.V&rft.issn=1568-4946&rft.volume=146&rft_id=info:doi/10.1016%2Fj.asoc.2023.110598&rft.externalDocID=S1568494623006166
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1568-4946&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1568-4946&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1568-4946&client=summon