A Discrete Artificial Bee Colony Algorithm for Minimizing the Total Flow Time in the Blocking Flow Shop Scheduling

A discrete artificial bee colony algorithm is proposed for solving the blocking flow shop scheduling problem with total flow time criterion. Firstly, the solution in the algorithm is represented as job permutation. Secondly, an initialization scheme based on a variant of the NEH （Nawaz-Enscore-Ham）...

Full description

Saved in:
Bibliographic Details
Published inChinese journal of chemical engineering Vol. 20; no. 6; pp. 1067 - 1073
Main Author 邓冠龙 徐震浩 顾幸生
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.12.2012
Subjects
Algorithms
artificial bee colony algorithm
Benchmarking
blocking flow shop scheduling
Chemical engineering
Colonies
Criteria
Mathematical models
Permutations
Scheduling
Swarm intelligence
total flow time
工蜂
总流量
时间标准
最小化
流水车间调度
离散
群算法
车间调度问题
artificial bee colony algorithm
blocking flow shop scheduling
total flow time
Online AccessGet full text

Cover

Abstract A discrete artificial bee colony algorithm is proposed for solving the blocking flow shop scheduling problem with total flow time criterion. Firstly, the solution in the algorithm is represented as job permutation. Secondly, an initialization scheme based on a variant of the NEH （Nawaz-Enscore-Ham） heuristic and a local search is designed to construct the initial population with both quality and diversity. Thirdly, based on the idea of iterated greedy algorithm, some newly designed schemes for employed bee, onlooker bee and scout bee are presented. The performance of the proposed algorithm is tested on the well-known Taillard benchmark set, and the computational results demonstrate the effectiveness of the discrete artificial bee colony algorithm. In addition, the best known solutions of the benchmark set are provided for the blocking flow shop scheduling problem with total flow time criterion.
AbstractList A discrete artificial bee colony algorithm is proposed for solving the blocking flow shop scheduling problem with total flow time criterion. Firstly, the solution in the algorithm is represented as job permutation. Secondly, an initialization scheme based on a variant of the NEH （Nawaz-Enscore-Ham） heuristic and a local search is designed to construct the initial population with both quality and diversity. Thirdly, based on the idea of iterated greedy algorithm, some newly designed schemes for employed bee, onlooker bee and scout bee are presented. The performance of the proposed algorithm is tested on the well-known Taillard benchmark set, and the computational results demonstrate the effectiveness of the discrete artificial bee colony algorithm. In addition, the best known solutions of the benchmark set are provided for the blocking flow shop scheduling problem with total flow time criterion.
A discrete artificial bee colony algorithm is proposed for solving the blocking flow shop scheduling problem with total flow time criterion. Firstly, the solution in the algorithm is represented as job permutation. Secondly, an initialization scheme based on a variant of the NEH (Nawaz-Enscore-Ham) heuristic and a local search is designed to construct the initial population with both quality and diversity. Thirdly, based on the idea of iterated greedy algorithm, some newly designed schemes for employed bee, onlooker bee and scout bee are presented. The performance of the proposed algorithm is tested on the well-known Taillard benchmark set, and the computational results demonstrate the effectiveness of the discrete artificial bee colony algorithm. In addition, the best known solutions of the benchmark set are provided for the blocking flow shop scheduling problem with total flow time criterion.
Author 邓冠龙 徐震浩 顾幸生
AuthorAffiliation Key Laboratory of Advanced Control and Optimization for Chemical Process, Mir~stry of Education, East ChinaUniversity of Science and Technology, Shanghai 200237, China
Author_xml – sequence: 1
  fullname: 邓冠龙 徐震浩 顾幸生
BookMark eNqFkUFvEzEQhS3USqQtPwHJ3Mphy3jt9TonlAYKlVpxSJC4Wbv2bNbgtVN7A2p_PZuk6rWnkWa-N6M374ychBiQkPcMrhgw-WnFAEQxrwS7ZOVHCZVShXxDZmXJoOAl-3VCZi_IW3KW82-AEhRTM5IW9IvLJuGIdJFG1znjGk-vEeky-hge6cJvYnJjP9AuJnrvghvckwsbOvZI13Gc6Bsf_9G1G5C6cGhf-2j-7JnDZNXHLV2ZHu3OT80Lcto1PuO753pOft58XS-_F3c_vt0uF3eFEcDGwtRWWM6V7ZpKiLY1jcFa1i2Wtp2L-VwobpRB3prSAlOyri20smuZYVzUdcvPyeVx7zbFhx3mUQ-TU_S-CRh3WbMKpADBuXgdLRWXUvGqntDqiJoUc07Y6W1yQ5MeNQO9j0Mf4tD7X086fYhDy0n3-ajDyfJfh0ln4zAYtC6hGbWN7tUNH54v9zFsHqZPvpwWglcKQPL_sQuewQ
CitedBy_id crossref_primary_10_1177_1687814018797034
crossref_primary_10_1007_s10586_019_03022_z
crossref_primary_10_1016_j_eswa_2018_06_020
crossref_primary_10_1007_s11771_015_2887_x
crossref_primary_10_31202_ecjse_670424
crossref_primary_10_1016_j_eswa_2019_06_069
crossref_primary_10_1016_j_cie_2015_04_013
crossref_primary_10_1109_TASE_2017_2690802
crossref_primary_10_1109_ACCESS_2018_2879600
crossref_primary_10_3390_a14020053
crossref_primary_10_1007_s10845_017_1358_7
crossref_primary_10_1080_00207543_2018_1471240
crossref_primary_10_1016_j_ins_2014_08_040
crossref_primary_10_1016_j_knosys_2018_11_021
crossref_primary_10_1016_j_swevo_2016_06_001
crossref_primary_10_1016_j_eswa_2015_03_026
crossref_primary_10_1109_ACCESS_2021_3093336
crossref_primary_10_1016_j_engappai_2017_06_025
crossref_primary_10_1109_ACCESS_2018_2814054
crossref_primary_10_1016_j_swevo_2022_101195
crossref_primary_10_51551_verimlilik_1207259
crossref_primary_10_1109_TITS_2018_2873145
crossref_primary_10_1049_itr2_12248
crossref_primary_10_3390_en12101876
crossref_primary_10_1016_j_asoc_2015_11_008
crossref_primary_10_3390_a9040071
crossref_primary_10_1016_j_eswa_2016_05_040
crossref_primary_10_1007_s10479_017_2465_8
crossref_primary_10_1016_j_swevo_2017_12_005
crossref_primary_10_1080_00207543_2022_2127959
crossref_primary_10_1177_1687814016664262
Cites_doi 10.1287/opre.44.3.510
10.1016/j.jfranklin.2008.11.003
10.1016/j.amc.2009.03.090
10.1007/s10898-007-9149-x
10.1016/S0925-5273(03)00065-3
10.1287/opre.37.6.925
10.1016/j.cie.2011.02.013
10.1016/S1004-9541(09)60130-0
10.1016/S1004-9541(09)60025-2
10.1016/j.omega.2005.07.004
10.1080/00207549008942855
10.1016/0305-0483(83)90088-9
10.1016/0377-2217(93)90182-M
10.1016/j.omega.2010.07.007
10.1016/S0167-5060(08)70356-X
10.1016/j.ejor.2004.08.046
10.1016/j.ejor.2005.12.009
10.1007/s10479-009-0657-6
10.1016/j.ins.2011.04.018
10.1016/j.asoc.2007.05.007
10.1016/j.eswa.2010.04.042
10.1016/j.cor.2008.12.004
10.1016/S0925-5273(99)00104-8
10.1016/S0377-2217(99)00224-6
10.1016/j.cor.2009.08.001
10.1016/j.ins.2009.12.025
ContentType Journal Article
Copyright 2012 Chemical Industry and Engineering Society of China (CIESC) and Chemical Industry Press (CIP)
Copyright_xml – notice: 2012 Chemical Industry and Engineering Society of China (CIESC) and Chemical Industry Press (CIP)
DBID 2RA
92L
CQIGP
W92
~WA
AAYXX
CITATION
7U5
8FD
L7M
DOI 10.1016/S1004-9541(12)60588-6
DatabaseName 维普_期刊
中文科技期刊数据库-CALIS站点
中文科技期刊数据库-7.0平台
中文科技期刊数据库-工程技术
中文科技期刊数据库- 镜像站点
CrossRef
Solid State and Superconductivity Abstracts
Technology Research Database
Advanced Technologies Database with Aerospace
DatabaseTitle CrossRef
Technology Research Database
Advanced Technologies Database with Aerospace
Solid State and Superconductivity Abstracts
DatabaseTitleList
Technology Research Database

Technology Research Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
DocumentTitleAlternate A Discrete Artificial Bee Colony Algorithm for Minimizing the Total Flow Time in the Blocking Flow Shop Scheduling
EISSN 2210-321X
EndPage 1073
ExternalDocumentID 10_1016_S1004_9541_12_60588_6
S1004954112605886
44358006
GrantInformation_xml – fundername: National Natural Science Foundation of China
  grantid: (61174040, 61104178)
GroupedDBID --K
--M
.~1
0R~
188
1B1
1~.
1~5
29B
2B.
2C0
2RA
4.4
457
4G.
5GY
5VR
5VS
7-5
71M
8P~
8RM
92H
92I
92L
92R
93N
AABNK
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAXUO
ABMAC
ABNUV
ABXDB
ABYKQ
ACDAQ
ACGFS
ACRLP
ADBBV
ADEWK
ADEZE
ADMUD
AEBSH
AEKER
AENEX
AFKWA
AFTJW
AFUIB
AGHFR
AGUBO
AGYEJ
AHPOS
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
AKURH
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AXJTR
BKOJK
BLXMC
CCEZO
CDRFL
CHBEP
CQIGP
CS3
CW9
DU5
EBS
EFJIC
EFLBG
EJD
ENUVR
EO9
EP2
EP3
FA0
FDB
FEDTE
FIRID
FNPLU
FYGXN
GBLVA
HVGLF
HZ~
J1W
KOM
M41
MO0
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
PC.
Q38
RIG
ROL
SDC
SDF
SDG
SDH
SES
SPC
SPCBC
SSG
SSZ
T5K
TCJ
TGT
UGNYK
W92
~G-
~WA
-SB
-S~
AAXDM
AAXKI
AAYXX
AKRWK
CAJEB
CITATION
U1G
U5L
7U5
8FD
L7M
ID FETCH-LOGICAL-c401t-c7d4d338dfa544bbcace767be2db9499483c8ce3bc2d018677d0b6fb1c13477b3
IEDL.DBID .~1
ISSN 1004-9541
IngestDate Fri Aug 16 01:44:57 EDT 2024
Sat Aug 17 00:28:32 EDT 2024
Thu Sep 12 19:36:01 EDT 2024
Fri Feb 23 02:37:36 EST 2024
Wed Feb 14 10:44:03 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 6
Keywords artificial bee colony algorithm
blocking flow shop scheduling
total flow time
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c401t-c7d4d338dfa544bbcace767be2db9499483c8ce3bc2d018677d0b6fb1c13477b3
Notes A discrete artificial bee colony algorithm is proposed for solving the blocking flow shop scheduling problem with total flow time criterion. Firstly, the solution in the algorithm is represented as job permutation. Secondly, an initialization scheme based on a variant of the NEH （Nawaz-Enscore-Ham） heuristic and a local search is designed to construct the initial population with both quality and diversity. Thirdly, based on the idea of iterated greedy algorithm, some newly designed schemes for employed bee, onlooker bee and scout bee are presented. The performance of the proposed algorithm is tested on the well-known Taillard benchmark set, and the computational results demonstrate the effectiveness of the discrete artificial bee colony algorithm. In addition, the best known solutions of the benchmark set are provided for the blocking flow shop scheduling problem with total flow time criterion.
blocking flow shop scheduling; artificial bee colony algorithm; total flow time
11-3270/TQ
DENG Guanlong, XU Zhenhao and GU Xingsheng＊＊ Key Laboratory of Advanced Control and Optimization for Chemical Process, Ministry of Education, East China University of Science and Technology, Shanghai 200237, China
ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
PQID 1283668357
PQPubID 23500
PageCount 7
ParticipantIDs proquest_miscellaneous_1506404334
proquest_miscellaneous_1283668357
crossref_primary_10_1016_S1004_9541_12_60588_6
elsevier_sciencedirect_doi_10_1016_S1004_9541_12_60588_6
chongqing_primary_44358006
PublicationCentury 2000
PublicationDate 2012-12-01
PublicationDateYYYYMMDD 2012-12-01
PublicationDate_xml – month: 12
  year: 2012
  text: 2012-12-01
  day: 01
PublicationDecade 2010
PublicationTitle Chinese journal of chemical engineering
PublicationTitleAlternate Chinese Journal of Chemical Engineering
PublicationYear 2012
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References Hall, Sriskandarajah (bib1) 1996; 44
Ronconi (bib2) 2004; 87
Karaboga, Basturk (bib20) 2007; 39
Ruiz, Stutzle (bib26) 2007; 177
Gong, Tang, Duin (bib5) 2010; 37
Ribas, Companys, Tort-Martorell (bib14) 2011; 39
Grabowski, Pempera (bib4) 2000; 125
Tasgetiren, Pan, Suganthan, Chen (bib25) 2011; 181
Graham, Lawler, Lenstra, Rinnooy Kan (bib7) 1979; 5
Zhao, Rong (bib17) 2005; 13
McCormick, Pinedo, Shenker, Wolf (bib8) 1989; 37
Hansen, Mladenović, Moreno (bib27) 2010; 175
Karaboga, Akay (bib23) 2009; 214
Grabowski, Pempera (bib12) 2007; 35
Karaboga, Basturk (bib21) 2008; 8
Wang, Pan, Tasgetiren (bib15) 2011; 61
Qian, Pan, Huang (bib3) 2009; 17
Martinez, Peres, Gueret, Mati, Sauer (bib6) 2006; 169
Wang, Pan, Suganthan, Wang, Wang (bib13) 2010; 37
Pan, Tasgetiren, Suganthan, Chua (bib24) 2011; 181
Wang, Pan, Tasgetiren (bib16) 2010; 37
Wang, Xue, Yu, Zhao (bib18) 2010; 18
Nawaz, Enscore, Ham (bib10) 1983; 11
Leisten (bib9) 1990; 28
Caraffa, Ianes, Bagchi, Sriskandarajah (bib11) 2001; 70
Taillard (bib28) 1993; 64
Karaboga, D., “An idea based on honey bee swarm for numerical optimization”, Technical Report TR06, Computer Engineering Department, Erciyes University, Turkey (2005).
Karaboga (bib22) 2009; 346
Grabowski (10.1016/S1004-9541(12)60588-6_bib12) 2007; 35
Karaboga (10.1016/S1004-9541(12)60588-6_bib22) 2009; 346
Wang (10.1016/S1004-9541(12)60588-6_bib15) 2011; 61
Ribas (10.1016/S1004-9541(12)60588-6_bib14) 2011; 39
Taillard (10.1016/S1004-9541(12)60588-6_bib28) 1993; 64
Martinez (10.1016/S1004-9541(12)60588-6_bib6) 2006; 169
Ronconi (10.1016/S1004-9541(12)60588-6_bib2) 2004; 87
Karaboga (10.1016/S1004-9541(12)60588-6_bib21) 2008; 8
Hall (10.1016/S1004-9541(12)60588-6_bib1) 1996; 44
Karaboga (10.1016/S1004-9541(12)60588-6_bib20) 2007; 39
10.1016/S1004-9541(12)60588-6_bib19
Grabowski (10.1016/S1004-9541(12)60588-6_bib4) 2000; 125
Wang (10.1016/S1004-9541(12)60588-6_bib13) 2010; 37
Wang (10.1016/S1004-9541(12)60588-6_bib18) 2010; 18
Karaboga (10.1016/S1004-9541(12)60588-6_bib23) 2009; 214
Hansen (10.1016/S1004-9541(12)60588-6_bib27) 2010; 175
Pan (10.1016/S1004-9541(12)60588-6_bib24) 2011; 181
Ruiz (10.1016/S1004-9541(12)60588-6_bib26) 2007; 177
Qian (10.1016/S1004-9541(12)60588-6_bib3) 2009; 17
Zhao (10.1016/S1004-9541(12)60588-6_bib17) 2005; 13
Leisten (10.1016/S1004-9541(12)60588-6_bib9) 1990; 28
Nawaz (10.1016/S1004-9541(12)60588-6_bib10) 1983; 11
Tasgetiren (10.1016/S1004-9541(12)60588-6_bib25) 2011; 181
Wang (10.1016/S1004-9541(12)60588-6_bib16) 2010; 37
Gong (10.1016/S1004-9541(12)60588-6_bib5) 2010; 37
Graham (10.1016/S1004-9541(12)60588-6_bib7) 1979; 5
Caraffa (10.1016/S1004-9541(12)60588-6_bib11) 2001; 70
McCormick (10.1016/S1004-9541(12)60588-6_bib8) 1989; 37
References_xml – volume: 37
  start-page: 960
  year: 2010
  end-page: 969
  ident: bib5
  article-title: “A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times”
  publication-title: Comput. Oper. Res.
  contributor:
    fullname: Duin
– volume: 37
  start-page: 7929
  year: 2010
  end-page: 7936
  ident: bib16
  article-title: “Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms”
  publication-title: Expert Syst. Appl.
  contributor:
    fullname: Tasgetiren
– volume: 39
  start-page: 293
  year: 2011
  end-page: 301
  ident: bib14
  article-title: “An iterated greedy algorithm for the flowshop scheduling with blocking”
  publication-title: OMEGA
  contributor:
    fullname: Tort-Martorell
– volume: 87
  start-page: 39
  year: 2004
  end-page: 48
  ident: bib2
  article-title: “A note on constructive heuristics for the flowshop problem with blocking”
  publication-title: Int. J. Prod. Econ.
  contributor:
    fullname: Ronconi
– volume: 5
  start-page: 287
  year: 1979
  end-page: 326
  ident: bib7
  article-title: “Optimization and approximation in deterministic sequencing and scheduling: A survey”
  publication-title: Ann. Discrete Math.
  contributor:
    fullname: Rinnooy Kan
– volume: 177
  start-page: 2033
  year: 2007
  end-page: 2049
  ident: bib26
  article-title: “A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem”
  publication-title: Eur. J. Oper. Res.
  contributor:
    fullname: Stutzle
– volume: 11
  start-page: 91
  year: 1983
  end-page: 95
  ident: bib10
  article-title: “A heuristic algorithm for the
  publication-title: OMEGA
  contributor:
    fullname: Ham
– volume: 64
  start-page: 278
  year: 1993
  end-page: 285
  ident: bib28
  article-title: “Benchmarks for basic scheduling problems”
  publication-title: Eur. J. Oper. Res.
  contributor:
    fullname: Taillard
– volume: 39
  start-page: 459
  year: 2007
  end-page: 471
  ident: bib20
  article-title: “A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm”
  publication-title: J. Global Optim.
  contributor:
    fullname: Basturk
– volume: 13
  start-page: 535
  year: 2005
  end-page: 541
  ident: bib17
  article-title: “Blending scheduling under uncertainty based on particle swarm optimization algorithm”
  publication-title: Chin. J. Chem. Eng.
  contributor:
    fullname: Rong
– volume: 8
  start-page: 687
  year: 2008
  end-page: 697
  ident: bib21
  article-title: “On the performance of artificial bee colony (ABC) algorithm”
  publication-title: Appl. Soft Comput.
  contributor:
    fullname: Basturk
– volume: 37
  start-page: 925
  year: 1989
  end-page: 936
  ident: bib8
  article-title: “Sequencing in an assembly line with blocking to minimize cycle time”
  publication-title: Oper. Res.
  contributor:
    fullname: Wolf
– volume: 181
  start-page: 3459
  year: 2011
  end-page: 3475
  ident: bib25
  article-title: “A discrete artificial bee colony algorithm for the total flow time minimization in permutation flow shops”
  publication-title: Inform. Sci.
  contributor:
    fullname: Chen
– volume: 175
  start-page: 367
  year: 2010
  end-page: 407
  ident: bib27
  article-title: “Variable neighborhood search: methods and applications”
  publication-title: Ann. Oper. Res.
  contributor:
    fullname: Moreno
– volume: 44
  start-page: 510
  year: 1996
  end-page: 525
  ident: bib1
  article-title: “A survey of machine scheduling problems with blocking and no-wait in process”
  publication-title: Oper. Res.
  contributor:
    fullname: Sriskandarajah
– volume: 346
  start-page: 328
  year: 2009
  end-page: 348
  ident: bib22
  article-title: “A new design method based on artificial bee colony algorithm for digital IIR filters”
  publication-title: J. Franklin Inst.
  contributor:
    fullname: Karaboga
– volume: 35
  start-page: 302
  year: 2007
  end-page: 311
  ident: bib12
  article-title: “The permutation flowshop problem with blocking: a tabu search approach”
  publication-title: OMEGA
  contributor:
    fullname: Pempera
– volume: 37
  start-page: 509
  year: 2010
  end-page: 520
  ident: bib13
  article-title: “A novel hybrid discrete differential evolution algorithm for blocking flowshop scheduling problems”
  publication-title: Comput. Oper. Res.
  contributor:
    fullname: Wang
– volume: 169
  start-page: 855
  year: 2006
  end-page: 864
  ident: bib6
  article-title: “Complexity of flowshop scheduling problems with a new blocking constraint”
  publication-title: Eur. J. Oper. Res.
  contributor:
    fullname: Sauer
– volume: 18
  start-page: 787
  year: 2010
  end-page: 794
  ident: bib18
  article-title: “Run-to-run optimization for fed-batch fermentation process with swarm energy conservation particle swarm optimization algorithm”
  publication-title: Chin. J. Chem. Eng.
  contributor:
    fullname: Zhao
– volume: 181
  start-page: 2455
  year: 2011
  end-page: 2468
  ident: bib24
  article-title: “A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem”
  publication-title: Inform. Sci.
  contributor:
    fullname: Chua
– volume: 28
  start-page: 2085
  year: 1990
  end-page: 2100
  ident: bib9
  article-title: “Flowshop sequencing problems with limited buffer storage”
  publication-title: Int. J. Prod. Res.
  contributor:
    fullname: Leisten
– volume: 70
  start-page: 101
  year: 2001
  end-page: 115
  ident: bib11
  article-title: “Minimizing makespan in a blocking flowshop using genetic algorithms”
  publication-title: Int. J. Prod. Econ.
  contributor:
    fullname: Sriskandarajah
– volume: 17
  start-page: 1
  year: 2009
  end-page: 7
  ident: bib3
  article-title: “Modeling and optimization for scheduling of chemical batch processes”
  publication-title: Chin. J. Chem. Eng.
  contributor:
    fullname: Huang
– volume: 61
  start-page: 76
  year: 2011
  end-page: 83
  ident: bib15
  article-title: “A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem”
  publication-title: Comput. Ind. Eng.
  contributor:
    fullname: Tasgetiren
– volume: 125
  start-page: 535
  year: 2000
  end-page: 550
  ident: bib4
  article-title: “Sequencing of jobs in some production system”
  publication-title: Eur. J. Oper. Res.
  contributor:
    fullname: Pempera
– volume: 214
  start-page: 108
  year: 2009
  end-page: 132
  ident: bib23
  article-title: “A comparative study of artificial bee colony algorithm”
  publication-title: Appl. Math. Comput.
  contributor:
    fullname: Akay
– volume: 44
  start-page: 510
  issue: 3
  year: 1996
  ident: 10.1016/S1004-9541(12)60588-6_bib1
  article-title: “A survey of machine scheduling problems with blocking and no-wait in process”
  publication-title: Oper. Res.
  doi: 10.1287/opre.44.3.510
  contributor:
    fullname: Hall
– volume: 346
  start-page: 328
  issue: 4
  year: 2009
  ident: 10.1016/S1004-9541(12)60588-6_bib22
  article-title: “A new design method based on artificial bee colony algorithm for digital IIR filters”
  publication-title: J. Franklin Inst.
  doi: 10.1016/j.jfranklin.2008.11.003
  contributor:
    fullname: Karaboga
– volume: 214
  start-page: 108
  issue: 1
  year: 2009
  ident: 10.1016/S1004-9541(12)60588-6_bib23
  article-title: “A comparative study of artificial bee colony algorithm”
  publication-title: Appl. Math. Comput.
  doi: 10.1016/j.amc.2009.03.090
  contributor:
    fullname: Karaboga
– volume: 39
  start-page: 459
  issue: 3
  year: 2007
  ident: 10.1016/S1004-9541(12)60588-6_bib20
  article-title: “A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm”
  publication-title: J. Global Optim.
  doi: 10.1007/s10898-007-9149-x
  contributor:
    fullname: Karaboga
– volume: 87
  start-page: 39
  issue: 1
  year: 2004
  ident: 10.1016/S1004-9541(12)60588-6_bib2
  article-title: “A note on constructive heuristics for the flowshop problem with blocking”
  publication-title: Int. J. Prod. Econ.
  doi: 10.1016/S0925-5273(03)00065-3
  contributor:
    fullname: Ronconi
– volume: 37
  start-page: 925
  issue: 6
  year: 1989
  ident: 10.1016/S1004-9541(12)60588-6_bib8
  article-title: “Sequencing in an assembly line with blocking to minimize cycle time”
  publication-title: Oper. Res.
  doi: 10.1287/opre.37.6.925
  contributor:
    fullname: McCormick
– volume: 61
  start-page: 76
  issue: 1
  year: 2011
  ident: 10.1016/S1004-9541(12)60588-6_bib15
  article-title: “A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem”
  publication-title: Comput. Ind. Eng.
  doi: 10.1016/j.cie.2011.02.013
  contributor:
    fullname: Wang
– volume: 18
  start-page: 787
  issue: 5
  year: 2010
  ident: 10.1016/S1004-9541(12)60588-6_bib18
  article-title: “Run-to-run optimization for fed-batch fermentation process with swarm energy conservation particle swarm optimization algorithm”
  publication-title: Chin. J. Chem. Eng.
  doi: 10.1016/S1004-9541(09)60130-0
  contributor:
    fullname: Wang
– volume: 17
  start-page: 1
  issue: 1
  year: 2009
  ident: 10.1016/S1004-9541(12)60588-6_bib3
  article-title: “Modeling and optimization for scheduling of chemical batch processes”
  publication-title: Chin. J. Chem. Eng.
  doi: 10.1016/S1004-9541(09)60025-2
  contributor:
    fullname: Qian
– volume: 35
  start-page: 302
  issue: 3
  year: 2007
  ident: 10.1016/S1004-9541(12)60588-6_bib12
  article-title: “The permutation flowshop problem with blocking: a tabu search approach”
  publication-title: OMEGA
  doi: 10.1016/j.omega.2005.07.004
  contributor:
    fullname: Grabowski
– ident: 10.1016/S1004-9541(12)60588-6_bib19
– volume: 28
  start-page: 2085
  issue: 11
  year: 1990
  ident: 10.1016/S1004-9541(12)60588-6_bib9
  article-title: “Flowshop sequencing problems with limited buffer storage”
  publication-title: Int. J. Prod. Res.
  doi: 10.1080/00207549008942855
  contributor:
    fullname: Leisten
– volume: 11
  start-page: 91
  issue: 1
  year: 1983
  ident: 10.1016/S1004-9541(12)60588-6_bib10
  article-title: “A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem”
  publication-title: OMEGA
  doi: 10.1016/0305-0483(83)90088-9
  contributor:
    fullname: Nawaz
– volume: 64
  start-page: 278
  issue: 2
  year: 1993
  ident: 10.1016/S1004-9541(12)60588-6_bib28
  article-title: “Benchmarks for basic scheduling problems”
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/0377-2217(93)90182-M
  contributor:
    fullname: Taillard
– volume: 39
  start-page: 293
  issue: 3
  year: 2011
  ident: 10.1016/S1004-9541(12)60588-6_bib14
  article-title: “An iterated greedy algorithm for the flowshop scheduling with blocking”
  publication-title: OMEGA
  doi: 10.1016/j.omega.2010.07.007
  contributor:
    fullname: Ribas
– volume: 5
  start-page: 287
  issue: 1
  year: 1979
  ident: 10.1016/S1004-9541(12)60588-6_bib7
  article-title: “Optimization and approximation in deterministic sequencing and scheduling: A survey”
  publication-title: Ann. Discrete Math.
  doi: 10.1016/S0167-5060(08)70356-X
  contributor:
    fullname: Graham
– volume: 169
  start-page: 855
  issue: 3
  year: 2006
  ident: 10.1016/S1004-9541(12)60588-6_bib6
  article-title: “Complexity of flowshop scheduling problems with a new blocking constraint”
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2004.08.046
  contributor:
    fullname: Martinez
– volume: 177
  start-page: 2033
  issue: 3
  year: 2007
  ident: 10.1016/S1004-9541(12)60588-6_bib26
  article-title: “A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem”
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2005.12.009
  contributor:
    fullname: Ruiz
– volume: 175
  start-page: 367
  issue: 1
  year: 2010
  ident: 10.1016/S1004-9541(12)60588-6_bib27
  article-title: “Variable neighborhood search: methods and applications”
  publication-title: Ann. Oper. Res.
  doi: 10.1007/s10479-009-0657-6
  contributor:
    fullname: Hansen
– volume: 13
  start-page: 535
  issue: 4
  year: 2005
  ident: 10.1016/S1004-9541(12)60588-6_bib17
  article-title: “Blending scheduling under uncertainty based on particle swarm optimization algorithm”
  publication-title: Chin. J. Chem. Eng.
  contributor:
    fullname: Zhao
– volume: 181
  start-page: 3459
  issue: 16
  year: 2011
  ident: 10.1016/S1004-9541(12)60588-6_bib25
  article-title: “A discrete artificial bee colony algorithm for the total flow time minimization in permutation flow shops”
  publication-title: Inform. Sci.
  doi: 10.1016/j.ins.2011.04.018
  contributor:
    fullname: Tasgetiren
– volume: 8
  start-page: 687
  issue: 1
  year: 2008
  ident: 10.1016/S1004-9541(12)60588-6_bib21
  article-title: “On the performance of artificial bee colony (ABC) algorithm”
  publication-title: Appl. Soft Comput.
  doi: 10.1016/j.asoc.2007.05.007
  contributor:
    fullname: Karaboga
– volume: 37
  start-page: 7929
  issue: 12
  year: 2010
  ident: 10.1016/S1004-9541(12)60588-6_bib16
  article-title: “Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms”
  publication-title: Expert Syst. Appl.
  doi: 10.1016/j.eswa.2010.04.042
  contributor:
    fullname: Wang
– volume: 37
  start-page: 509
  issue: 3
  year: 2010
  ident: 10.1016/S1004-9541(12)60588-6_bib13
  article-title: “A novel hybrid discrete differential evolution algorithm for blocking flowshop scheduling problems”
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2008.12.004
  contributor:
    fullname: Wang
– volume: 70
  start-page: 101
  issue: 2
  year: 2001
  ident: 10.1016/S1004-9541(12)60588-6_bib11
  article-title: “Minimizing makespan in a blocking flowshop using genetic algorithms”
  publication-title: Int. J. Prod. Econ.
  doi: 10.1016/S0925-5273(99)00104-8
  contributor:
    fullname: Caraffa
– volume: 125
  start-page: 535
  issue: 3
  year: 2000
  ident: 10.1016/S1004-9541(12)60588-6_bib4
  article-title: “Sequencing of jobs in some production system”
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/S0377-2217(99)00224-6
  contributor:
    fullname: Grabowski
– volume: 37
  start-page: 960
  issue: 5
  year: 2010
  ident: 10.1016/S1004-9541(12)60588-6_bib5
  article-title: “A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times”
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2009.08.001
  contributor:
    fullname: Gong
– volume: 181
  start-page: 2455
  issue: 12
  year: 2011
  ident: 10.1016/S1004-9541(12)60588-6_bib24
  article-title: “A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem”
  publication-title: Inform. Sci.
  doi: 10.1016/j.ins.2009.12.025
  contributor:
    fullname: Pan
SSID ssj0020818
Score 2.1868794
Snippet A discrete artificial bee colony algorithm is proposed for solving the blocking flow shop scheduling problem with total flow time criterion. Firstly, the...
SourceID proquest
crossref
elsevier
chongqing
SourceType Aggregation Database
Publisher
StartPage 1067
SubjectTerms Algorithms
artificial bee colony algorithm
Benchmarking
blocking flow shop scheduling
Chemical engineering
Colonies
Criteria
Mathematical models
Permutations
Scheduling
Swarm intelligence
total flow time
工蜂
总流量
时间标准
最小化
流水车间调度
离散
群算法
车间调度问题
Title A Discrete Artificial Bee Colony Algorithm for Minimizing the Total Flow Time in the Blocking Flow Shop Scheduling
URI http://lib.cqvip.com/qk/84275X/201206/44358006.html
https://dx.doi.org/10.1016/S1004-9541(12)60588-6
https://search.proquest.com/docview/1283668357
https://search.proquest.com/docview/1506404334
Volume 20
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1NT9tAEF1FcIFD1ZZWJbRokTi0Bye2d22vj0loFEDkkiBxW3k_klhK7JAmquDQ396ZtZPSShSJ635ptbN-8-yZeSbkPLGo6pYmnuFZ6nEjmKcCAENuOeClYip0EfybYTy45Vd30V2D9La1MJhWWWN_hekOreuWdn2a7WWet0eodZZGHGtg_EgIlN3m4IzgTrd-7dI8QpRscxFPn3s4-k8VT7WCa_wahN_cIp7TWJiVxfQePMdzvuof1HauqP-WvKk5JO1U23xHGrZ4Tw6fKAsekVWHXuSACECJ3bhKJ4J2raU9gLvigXbm03KVr2cLCrSV3uRFvsgfYS4FRkjHJXBy2p-XPynWiNC8cM1d8Hz4ab3qGc3KJR2B0Q1ms08_kNv-93Fv4NW_V_A0vFStPZ0YbuAN1UyyiHOldKZtEifKhkahZA0XTAttmdKh8Z3unfFVPFGBxvLTRLGPZK8oC_uJUMEAHDQzIoCldDZJgVZZHonUWpYwFh6T5u5Q5bKS0ZCcYwjWj49Ja3vKu75d7hmaSKKJZBBKZyIJE8TWFvKvuyLBDbw09WxrOwnPEQZHssKWmx8wRrA4Bj6a_GcMqvuh4htvvn4LJ-QASFdYpcR8Jnvr1cZ-AWKzVqfu5p6S_c7l9WD4G0az8Sc
link.rule.ids 315,786,790,4521,24144,27957,27958,45620,45714
linkProvider Elsevier
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3PT9swFH5i5bBxmNgvAQPmSRy2Q9YkdmLnWApVGbSXFombFf9oGwmSUorQ9tfz7KTdmMQm7Wr7WZGf873P8XtfAI64dapuGQ8My7OAGUEDFSEYMssQLxVVsb_BHwzT_iX7fpVcbUB3VQvj0iob7K8x3aN109JuVrM9L4r2yGmdZQlzNTBhIkT6AjZZwiPWgs3O2Xl_uD53OdU2f-kZssAZ_CrkqSfxjV-i-KufJ_AyC7OqnN5i8HguXP0B3D4a9bbhdUMjSad-0jewYcu3sPWbuOA7WHTISYGggKzYj6ulIsixtaSLiFf-IJ3rabUolrMbgsyVDIqyuCl-oi1BUkjGFdJy0ruuHogrEyFF6ZuPMfi5r-t1z2hWzckI_W5cQvv0PVz2TsfdftD8YSHQeK5aBpobZvCQaiZ5wphSOteWp1zZ2CinWsME1UJbqnRsQi99Z0KVTlSkXQUqV_QDtMqqtDtABEV80NSICKfS-SRDZmVZIjJrKac03oW99aLKea2kIRlzt7BhugvfVqu87lunnzkXSeciGcXSu0iigVj5Qj7ZLhIjwb9MP698J_FVcvcjeWmr-zscI2iaIiXlfxnjBP6c6Bvb-_9H-AQv--PBhbw4G55_hFfIweI6Q2YfWsvFvT1AnrNUh80-fgSnZPPd
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+Discrete+Artificial+Bee+Colony+Algorithm+for+Minimizing+the+Total+Flow+Time+in+the+Blocking+Flow+Shop+Scheduling&rft.jtitle=Chinese+journal+of+chemical+engineering&rft.au=DENG%2C+Guanlong&rft.au=XU%2C+Zhenhao&rft.au=GU%2C+Xingsheng&rft.date=2012-12-01&rft.issn=1004-9541&rft.volume=20&rft.issue=6&rft.spage=1067&rft.epage=1073&rft_id=info:doi/10.1016%2FS1004-9541%2812%2960588-6&rft.externalDBID=NO_FULL_TEXT
thumbnail_s http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fimage.cqvip.com%2Fvip1000%2Fqk%2F84275X%2F84275X.jpg