An Improved Genetic-Simulated Annealing Algorithm Based on a Hormone Modulation Mechanism for a Flexible Flow-Shop Scheduling Problem

A flexible flow-shop scheduling (FFS) with nonidentical parallel machines for minimizing the maximum completion time or makespan is a well-known combinational problem. Since the problem is known to be strongly NP-hard, optimization can either be the subject of optimization approaches or be implement...

Full description

Saved in:
Bibliographic Details
Published inAdvances in Mechanical Engineering Vol. 2013; no. 2013; pp. 1 - 13
Main Authors Cai, Qixiang, Zheng, Kun, Tang, Dunbing, Dai, Min
Format Journal Article
LanguageEnglish
Published Cairo, Egypt Hindawi Puplishing Corporation 2013
SAGE Publications
Sage Publications Ltd. (UK)
SAGE Publishing
Subjects
Online AccessGet full text

Cover

Loading…
Abstract A flexible flow-shop scheduling (FFS) with nonidentical parallel machines for minimizing the maximum completion time or makespan is a well-known combinational problem. Since the problem is known to be strongly NP-hard, optimization can either be the subject of optimization approaches or be implemented for some approximated cases. In this paper, an improved genetic-simulated annealing algorithm (IGAA), which combines genetic algorithm (GA) based on an encoding matrix with simulated annealing algorithm (SAA) based on a hormone modulation mechanism, is proposed to achieve the optimal or near-optimal solution. The novel hybrid algorithm tries to overcome the local optimum and further to explore the solution space. To evaluate the performance of IGAA, computational experiments are conducted and compared with results generated by different algorithms. Experimental results clearly demonstrate that the improved metaheuristic algorithm performs considerably well in terms of solution quality, and it outperforms several other algorithms.
AbstractList A flexible flow-shop scheduling (FFS) with nonidentical parallel machines for minimizing the maximum completion time or makespan is a well-known combinational problem. Since the problem is known to be strongly NP-hard, optimization can either be the subject of optimization approaches or be implemented for some approximated cases. In this paper, an improved genetic-simulated annealing algorithm (IGAA), which combines genetic algorithm (GA) based on an encoding matrix with simulated annealing algorithm (SAA) based on a hormone modulation mechanism, is proposed to achieve the optimal or near-optimal solution. The novel hybrid algorithm tries to overcome the local optimum and further to explore the solution space. To evaluate the performance of IGAA, computational experiments are conducted and compared with results generated by different algorithms. Experimental results clearly demonstrate that the improved metaheuristic algorithm performs considerably well in terms of solution quality, and it outperforms several other algorithms.
A flexible flow-shop scheduling (FFS) with nonidentical parallel machines for minimizing the maximum completion time or makespan is a well-known combinational problem. Since the problem is known to be strongly NP-hard, optimization can either be the subject of optimization approaches or be implemented for some approximated cases. In this paper, an improved geneticsimulated annealing algorithm (IGAA), which combines genetic algorithm (GA) based on an encoding matrix with simulated annealing algorithm (SAA) based on a hormone modulation mechanism, is proposed to achieve the optimal or near-optimal solution. The novel hybrid algorithm tries to overcome the local optimum and further to explore the solution space. To evaluate the performance of IGAA, computational experiments are conducted and compared with results generated by different algorithms. Experimental results clearly demonstrate that the improved metaheuristic algorithm performs considerably well in terms of solution quality, and it outperforms several other algorithms.
Audience Academic
Author Zheng, Kun
Tang, Dunbing
Cai, Qixiang
Dai, Min
Author_xml – sequence: 1
  fullname: Cai, Qixiang
– sequence: 2
  fullname: Zheng, Kun
– sequence: 3
  fullname: Tang, Dunbing
– sequence: 4
  fullname: Dai, Min
BookMark eNp1kk1rFTEUhgepYK1duRYG3AgybTJJ5mM5FtteaFG4ug75OJmbkkmuydyqP8D_bcaRK4KSRcJ7nvNy8nKeFyc-eCiKlxhdYMzYZY0wucQ17RF5UpzipmurDlN0cnyT-llxnpKViKEGoabvT4sfgy830z6GR9DlDXiYraq2djo4MWdl8B6Es34sBzeGaOfdVL4TKVeCL0V5G-KUhyjvg14abBbvQe2Et2kqTYgZuXbwzUoH-RG-Vttd2JdbtYPML64fY8i16UXx1AiX4Pz3fVZ8vn7_6eq2uvtws7ka7ipFezxXGBglgCQinWkZU7QBjY3uqJRCacJII5vedDU1xDS97gSVpqcYgDDZSEDkrNisvjqIB76PdhLxOw_C8l9CiCMXMSfggGtiQGomlSKSAjJC1Qy0FgY04E7h7PVm9crhfTlAmvlkkwLnhIdwSBxT2rW4JTXL6OsVHUV2tt6EOQq14HwgTd_2rK5Jpi7-QeWjYbIqx2xs1v9qeLs2qBhSimCOP8KILyvBl5Xg60r8mTeJEfhDOESfo_4P-mpFIbuBEUdfSltGO_ITpJrA7g
CitedBy_id crossref_primary_10_1080_00207543_2013_865855
crossref_primary_10_1155_2015_731492
crossref_primary_10_1007_s40747_021_00400_2
crossref_primary_10_1080_00207543_2021_1924411
crossref_primary_10_1177_1687814017746514
crossref_primary_10_1016_j_eswa_2023_120240
crossref_primary_10_3390_app8122621
Cites_doi 10.1007/s001700200126
10.1080/00207729708929359
10.1016/S0076-6879(04)84005-9
10.1080/00207549108948025
10.1057/jors.1988.63
10.1016/0377-2217(91)90148-O
10.1007/s00170-007-1048-2
10.1007/s10878-011-9423-1
10.1016/j.ejor.2004.05.017
10.1002/(SICI)1099-1425(199905/06)2:3<135::AID-JOS21>3.0.CO;2-L
10.1002/1526-968X(200008)27:4<159::AID-GENE50>3.0.CO;2-T
10.1007/978-3-642-80784-8_7
10.1016/j.amc.2007.03.046
10.1023/A:1018976827443
10.1007/s10951-005-1640-y
10.1016/0377-2217(89)90208-7
10.1016/S0360-8352(99)00023-6
10.1007/s00170-010-2868-z
10.1007/978-3-662-02830-8
10.1109/ISMS.2011.18
10.1057/palgrave.jors.2601716
10.1016/j.ejor.2008.07.024
10.1007/s00170-011-3807-3
10.1016/S0925-5273(99)00051-1
10.1016/S0377-2217(99)00386-0
10.1016/j.ejor.2009.09.024
10.1016/j.engappai.2004.02.008
10.1023/B:JIMS.0000026570.03851.cc
10.1016/S0305-0548(98)00056-2
10.1016/j.asoc.2010.12.006
10.1080/18756891.2008.9727611
10.1007/s10845-005-7029-0
10.1016/S0305-0548(01)00040-5
10.1007/s10845-009-0373-8
ContentType Journal Article
Contributor Zheng, Kun
Tang, Dunbing
Cai, Qixiang
Dai, Min
Contributor_xml – sequence: 1
  fullname: Cai, Qixiang
– sequence: 2
  fullname: Zheng, Kun
– sequence: 3
  fullname: Tang, Dunbing
– sequence: 4
  fullname: Dai, Min
Copyright 2013 Min Dai et al.
COPYRIGHT 2013 Sage Publications Ltd. (UK)
Copyright_xml – notice: 2013 Min Dai et al.
– notice: COPYRIGHT 2013 Sage Publications Ltd. (UK)
DBID ADJCN
AFRWT
AAYXX
CITATION
7TB
8FD
FR3
DOA
DOI 10.1155/2013/124903
DatabaseName الدوريات العلمية والإحصائية - e-Marefa Academic and Statistical Periodicals
SAGE Journals Open Access
CrossRef
Mechanical & Transportation Engineering Abstracts
Technology Research Database
Engineering Research Database
Directory of Open Access Journals
DatabaseTitle CrossRef
Technology Research Database
Mechanical & Transportation Engineering Abstracts
Engineering Research Database
DatabaseTitleList

Technology Research Database
CrossRef


Database_xml – sequence: 1
  dbid: DOA
  name: Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
– sequence: 2
  dbid: AFRWT
  name: SAGE Journals Open Access
  url: http://journals.sagepub.com/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1687-8140
1687-8132
EndPage 13
ExternalDocumentID oai_doaj_org_article_d3febd5bcc3b4e0fac25eddafede18c1
A369795223
10_1155_2013_124903
10.1155_2013/124903
447548
GroupedDBID .4S
.DC
0R~
188
23M
2UF
2WC
31X
4.4
54M
5GY
5VS
8FE
8FG
8R4
8R5
AAJPV
AATBZ
ABAWP
ABJCF
ABQXT
ACGFS
ACIWK
ACROE
ACSIQ
ADBBV
ADJCN
ADOGD
AEDFJ
AENEX
AEUHG
AEUIJ
AEWDL
AEWHI
AFCOW
AFKRA
AFKRG
AFRWT
AINHJ
AJUZI
ALMA_UNASSIGNED_HOLDINGS
ARCSS
AUTPY
AYAKG
BCNDV
BDDNI
BENPR
BGLVJ
C1A
CAHYU
CCPQU
CNMHZ
DV7
E3Z
EBS
EDO
EJD
GROUPED_DOAJ
GROUPED_SAGE_PREMIER_JOURNAL_COLLECTION
H13
HCIFZ
I-F
IAO
IEA
IL9
ITC
J8X
K.F
KQ8
L6V
M7S
M~E
O9-
OK1
PIMPY
PTHSS
Q2X
RHU
ROL
SFC
SFK
SFT
SGV
SPP
TR2
UGNYK
AAYXX
CITATION
7TB
8FD
FR3
ID FETCH-LOGICAL-c491t-1e543e0b038f755c46ed1fd84bbacd3536b69f824f3f69d8a4bf941ee35b6be03
IEDL.DBID AFRWT
ISSN 1687-8132
IngestDate Thu Jul 04 21:11:04 EDT 2024
Fri Jun 28 08:09:30 EDT 2024
Thu Feb 22 23:55:38 EST 2024
Wed Oct 25 09:52:20 EDT 2023
Wed Oct 02 14:36:04 EDT 2024
Tue Jul 16 20:44:54 EDT 2024
Thu Sep 12 21:35:26 EDT 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 2013
Language English
License This article is distributed under the terms of the Creative Commons Attribution 3.0 License (http://www.creativecommons.org/licenses/by/3.0/) which permits any use, reproduction and distribution of the work without further permission provided the original work is attributed as specified on the SAGE and Open Access page (http://www.uk.sagepub.com/aboutus/openaccess.htm).
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c491t-1e543e0b038f755c46ed1fd84bbacd3536b69f824f3f69d8a4bf941ee35b6be03
Notes ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
OpenAccessLink https://journals.sagepub.com/doi/full/10.1155/2013/124903?utm_source=summon&utm_medium=discovery-provider
PQID 1448717325
PQPubID 23500
PageCount 13
ParticipantIDs doaj_primary_oai_doaj_org_article_d3febd5bcc3b4e0fac25eddafede18c1
proquest_miscellaneous_1448717325
gale_infotracmisc_A369795223
gale_infotracacademiconefile_A369795223
crossref_primary_10_1155_2013_124903
sage_journals_10_1155_2013_124903
emarefa_primary_447548
PublicationCentury 2000
PublicationDate 2013.
20130000
2013-01-00
20130101
2013-01-01
PublicationDateYYYYMMDD 2013-01-01
PublicationDate_xml – year: 2013
  text: 2013.
PublicationDecade 2010
PublicationPlace Cairo, Egypt
PublicationPlace_xml – name: Cairo, Egypt
– name: London, England
PublicationTitle Advances in Mechanical Engineering
PublicationYear 2013
Publisher Hindawi Puplishing Corporation
SAGE Publications
Sage Publications Ltd. (UK)
SAGE Publishing
Publisher_xml – name: Hindawi Puplishing Corporation
– name: SAGE Publications
– name: Sage Publications Ltd. (UK)
– name: SAGE Publishing
References Gupta, Hariri, Potts 1997; vol. 69
Brah, Hunsucker 1991; vol. 51
Kyparisis, Koulamas 2006; vol. 168
Gupta, Krüger, Lauff, Werner, Sotskov 2002; vol. 29
Kahraman, Engin, Kaya, Yilmaz 2008; vol. 1
Choi, Lee 2013; vol. 25
Shi 1997; vol. 28
Wang, Zheng 2002; vol. 20
Şerifoğlu, Ulusoy 2004; vol. 55
Mirsanei, Zandieh, Moayed, Khabbazi 2011; vol. 22
Nearchou 2004; vol. 15
Nearchou 2004; vol. 17
Liaw 1999; vol. 26
Sriskandarajah, Sethi 1989; vol. 43
Deep, Thakur 2007; vol. 193
Xing, Chen, Yang 2009; vol. 197
Verma, Dessouky 1999; vol. 2
Ruiz, Vázquez-Rodríguez 2010; vol. 205
Oĝuz, Ercan 2005; vol. 8
Gupta 1988; vol. 39
Wang, Chou, Wu 2011; vol. 53
Alaykýran, Engin, Döyen 2007; vol. 35
Sepich, Myers, Short, Topczewski, Marlow, Solnica-Krezel 2000; vol. 27
Linn, Zhang 1999; vol. 37
Gupta, Ruiz-Torres 2000; vol. 125
Engin, Ceran, Yilmaz 2011; vol. 11
Gupta, Tunc 1991; vol. 29
Tang, Liu, Liu 2005; vol. 16
Singh, Mahapatra 2012; vol. 62
Moursli, Pochet 2000; vol. 64
bibr30-2013-124903
bibr11-2013-124903
bibr22-2013-124903
bibr33-2013-124903
bibr34-2013-124903
bibr12-2013-124903
bibr23-2013-124903
bibr35-2013-124903
bibr13-2013-124903
bibr24-2013-124903
bibr14-2013-124903
bibr16-2013-124903
bibr25-2013-124903
bibr27-2013-124903
bibr15-2013-124903
bibr19-2013-124903
bibr29-2013-124903
bibr18-2013-124903
bibr28-2013-124903
bibr17-2013-124903
bibr1-2013-124903
bibr3-2013-124903
bibr2-2013-124903
bibr6-2013-124903
bibr5-2013-124903
bibr4-2013-124903
bibr9-2013-124903
Pindo M. (bibr26-2013-124903) 2002
bibr32-2013-124903
bibr7-2013-124903
bibr10-2013-124903
bibr21-2013-124903
bibr31-2013-124903
bibr8-2013-124903
bibr20-2013-124903
References_xml – volume: vol. 11
  start-page: 3056
  issue: no. 3
  year: 2011
  end-page: 3065
  article-title: “An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems,”
  publication-title: Applied Soft Computing
  contributor:
    fullname: Yilmaz
– volume: vol. 8
  start-page: 323
  issue: no. 4
  year: 2005
  end-page: 351
  article-title: “A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks,”
  publication-title: Journal of Scheduling
  contributor:
    fullname: Ercan
– volume: vol. 39
  start-page: 359
  issue: no. 4
  year: 1988
  end-page: 364
  article-title: “Two-stage, hybrid flowshop scheduling problem,”
  publication-title: Journal of the Operational Research Society
  contributor:
    fullname: Gupta
– volume: vol. 26
  start-page: 109
  issue: no. 2
  year: 1999
  end-page: 126
  article-title: “A tabu search algorithm for the open shop scheduling problem,”
  publication-title: Computers & Operations Research
  contributor:
    fullname: Liaw
– volume: vol. 29
  start-page: 1489
  issue: no. 7
  year: 1991
  end-page: 1502
  article-title: “Schedules for a two-stage hybrid flowshop with parallel machines at the second stage,”
  publication-title: International Journal of Production Research
  contributor:
    fullname: Tunc
– volume: vol. 37
  start-page: 57
  issue: no. 1
  year: 1999
  end-page: 61
  article-title: “Hybrid flow shop scheduling: a survey,”
  publication-title: Computers & Industrial Engineering
  contributor:
    fullname: Zhang
– volume: vol. 20
  start-page: 72
  issue: no. 1
  year: 2002
  end-page: 76
  article-title: “A modified genetic algorithm for job shop scheduling,”
  publication-title: The International Journal of Advanced Manufacturing Technology
  contributor:
    fullname: Zheng
– volume: vol. 29
  start-page: 1417
  issue: no. 10
  year: 2002
  end-page: 1439
  article-title: “Heuristics for hybrid flow shops with controllable processing times and assignable due dates,”
  publication-title: Computers & Operations Research
  contributor:
    fullname: Sotskov
– volume: vol. 35
  start-page: 541
  issue: no. 5–6
  year: 2007
  end-page: 550
  article-title: “Using ant colony optimization to solve hybrid flow shop scheduling problems,”
  publication-title: The International Journal of Advanced Manufacturing Technology
  contributor:
    fullname: Döyen
– volume: vol. 69
  start-page: 171
  year: 1997
  end-page: 191
  article-title: “Scheduling a two-stage hybrid flow shop with parallel machines at the first stage,”
  publication-title: Annals of Operations Research
  contributor:
    fullname: Potts
– volume: vol. 1
  start-page: 134
  issue: no. 2
  year: 2008
  end-page: 147
  article-title: “An application of effective genetic algorithms for solving hybrid flow shop scheduling problems,”
  publication-title: International Journal of Computational Intelligence Systems
  contributor:
    fullname: Yilmaz
– volume: vol. 205
  start-page: 1
  issue: no. 1
  year: 2010
  end-page: 18
  article-title: “The hybrid flow shop scheduling problem,”
  publication-title: European Journal of Operational Research
  contributor:
    fullname: Vázquez-Rodríguez
– volume: vol. 15
  start-page: 317
  issue: no. 3
  year: 2004
  end-page: 328
  article-title: “Flow-shop sequencing using hybrid simulated annealing,”
  publication-title: Journal of Intelligent Manufacturing
  contributor:
    fullname: Nearchou
– volume: vol. 168
  start-page: 985
  issue: no. 3
  year: 2006
  end-page: 997
  article-title: “Flexible flow shop scheduling with uniform parallel machines,”
  publication-title: European Journal of Operational Research
  contributor:
    fullname: Koulamas
– volume: vol. 16
  start-page: 361
  issue: no. 3
  year: 2005
  end-page: 370
  article-title: “A neural network model and algorithm for the hybrid flow shop scheduling problem in a dynamic environment,”
  publication-title: Journal of Intelligent Manufacturing
  contributor:
    fullname: Liu
– volume: vol. 43
  start-page: 143
  issue: no. 2
  year: 1989
  end-page: 160
  article-title: “Scheduling algorithms for flexible flowshops: worst and average case performance,”
  publication-title: European Journal of Operational Research
  contributor:
    fullname: Sethi
– volume: vol. 28
  start-page: 25
  issue: no. 1
  year: 1997
  end-page: 32
  article-title: “A genetic algorithm applied to a classic job-shop scheduling problem,”
  publication-title: International Journal of Systems Science
  contributor:
    fullname: Shi
– volume: vol. 25
  start-page: 123
  issue: no. 1
  year: 2013
  end-page: 134
  article-title: “Two-stage proportionate flexible flow shop to minimize the makespan,”
  publication-title: Journal of Combinatorial Optimization
  contributor:
    fullname: Lee
– volume: vol. 62
  start-page: 267
  issue: no. 1–4
  year: 2012
  end-page: 277
  article-title: “A swarm optimization approach for flexible flow shop scheduling with multiprocessor tasks,”
  publication-title: The International Journal of Advanced Manufacturing Technology
  contributor:
    fullname: Mahapatra
– volume: vol. 55
  start-page: 504
  issue: no. 5
  year: 2004
  end-page: 512
  article-title: “Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach,”
  publication-title: Journal of the Operational Research Society
  contributor:
    fullname: Ulusoy
– volume: vol. 2
  start-page: 135
  issue: no. 3
  year: 1999
  end-page: 150
  article-title: “Multistage hybrid flowshop scheduling with identical jobs and uniform parallel machines,”
  publication-title: Journal of Scheduling
  contributor:
    fullname: Dessouky
– volume: vol. 64
  start-page: 113
  issue: no. 1–3
  year: 2000
  end-page: 125
  article-title: “A branch-and-bound algorithm for the hybrid flowshop,”
  publication-title: International Journal of Production Economics
  contributor:
    fullname: Pochet
– volume: vol. 51
  start-page: 88
  issue: no. 1
  year: 1991
  end-page: 99
  article-title: “Branch and bound algorithm for the flow shop with multiple processors,”
  publication-title: European Journal of Operational Research
  contributor:
    fullname: Hunsucker
– volume: vol. 53
  start-page: 761
  issue: no. 5–8
  year: 2011
  end-page: 776
  article-title: “A simulated annealing for hybrid flow shop scheduling with multiprocessor tasks to minimize makespan,”
  publication-title: The International Journal of Advanced Manufacturing Technology
  contributor:
    fullname: Wu
– volume: vol. 125
  start-page: 370
  issue: no. 2
  year: 2000
  end-page: 380
  article-title: “Minimizing makespan subject to minimum total flow-time on identical parallel machines,”
  publication-title: European Journal of Operational Research
  contributor:
    fullname: Ruiz-Torres
– volume: vol. 27
  start-page: 159
  issue: no. 4
  year: 2000
  end-page: 173
  article-title: “Role of the zebrafish trilobite locus in gastrulation movements of convergence and extension,”
  publication-title: Genesis
  contributor:
    fullname: Solnica-Krezel
– volume: vol. 193
  start-page: 211
  issue: no. 1
  year: 2007
  end-page: 230
  article-title: “A new mutation operator for real coded genetic algorithms,”
  publication-title: Applied Mathematics and Computation
  contributor:
    fullname: Thakur
– volume: vol. 22
  start-page: 965
  issue: no. 6
  year: 2011
  end-page: 978
  article-title: “A simulated annealing algorithm approach to hybrid flowshop scheduling with sequence-dependent setup times,”
  publication-title: Journal of Intelligent Manufacturing
  contributor:
    fullname: Khabbazi
– volume: vol. 17
  start-page: 289
  issue: no. 3
  year: 2004
  end-page: 300
  article-title: “A novel metaheuristic approach for the flow shop scheduling problem,”
  publication-title: Engineering Applications of Artificial Intelligence
  contributor:
    fullname: Nearchou
– volume: vol. 197
  start-page: 830
  issue: no. 2
  year: 2009
  end-page: 833
  article-title: “A novel mutation operator based on the immunity operation,”
  publication-title: European Journal of Operational Research
  contributor:
    fullname: Yang
– ident: bibr23-2013-124903
  doi: 10.1007/s001700200126
– ident: bibr27-2013-124903
  doi: 10.1080/00207729708929359
– ident: bibr34-2013-124903
  doi: 10.1016/S0076-6879(04)84005-9
– ident: bibr11-2013-124903
  doi: 10.1080/00207549108948025
– ident: bibr7-2013-124903
  doi: 10.1057/jors.1988.63
– ident: bibr12-2013-124903
  doi: 10.1016/0377-2217(91)90148-O
– ident: bibr20-2013-124903
  doi: 10.1007/s00170-007-1048-2
– ident: bibr3-2013-124903
  doi: 10.1007/s10878-011-9423-1
– ident: bibr6-2013-124903
  doi: 10.1016/j.ejor.2004.05.017
– ident: bibr15-2013-124903
  doi: 10.1002/(SICI)1099-1425(199905/06)2:3<135::AID-JOS21>3.0.CO;2-L
– ident: bibr28-2013-124903
  doi: 10.1002/1526-968X(200008)27:4<159::AID-GENE50>3.0.CO;2-T
– ident: bibr9-2013-124903
  doi: 10.1007/978-3-642-80784-8_7
– ident: bibr30-2013-124903
  doi: 10.1016/j.amc.2007.03.046
– ident: bibr13-2013-124903
  doi: 10.1023/A:1018976827443
– ident: bibr16-2013-124903
  doi: 10.1007/s10951-005-1640-y
– ident: bibr14-2013-124903
  doi: 10.1016/0377-2217(89)90208-7
– ident: bibr1-2013-124903
  doi: 10.1016/S0360-8352(99)00023-6
– ident: bibr18-2013-124903
  doi: 10.1007/s00170-010-2868-z
– ident: bibr29-2013-124903
  doi: 10.1007/978-3-662-02830-8
– ident: bibr33-2013-124903
  doi: 10.1109/ISMS.2011.18
– volume-title: Scheduling: Theory, Algorithms, and Systems
  year: 2002
  ident: bibr26-2013-124903
  contributor:
    fullname: Pindo M.
– ident: bibr35-2013-124903
  doi: 10.1057/palgrave.jors.2601716
– ident: bibr31-2013-124903
  doi: 10.1016/j.ejor.2008.07.024
– ident: bibr22-2013-124903
  doi: 10.1007/s00170-011-3807-3
– ident: bibr10-2013-124903
  doi: 10.1016/S0925-5273(99)00051-1
– ident: bibr4-2013-124903
  doi: 10.1016/S0377-2217(99)00386-0
– ident: bibr8-2013-124903
  doi: 10.1016/j.ejor.2009.09.024
– ident: bibr24-2013-124903
  doi: 10.1016/j.engappai.2004.02.008
– ident: bibr25-2013-124903
  doi: 10.1023/B:JIMS.0000026570.03851.cc
– ident: bibr32-2013-124903
  doi: 10.1016/S0305-0548(98)00056-2
– ident: bibr2-2013-124903
  doi: 10.1016/j.asoc.2010.12.006
– ident: bibr17-2013-124903
  doi: 10.1080/18756891.2008.9727611
– ident: bibr21-2013-124903
  doi: 10.1007/s10845-005-7029-0
– ident: bibr5-2013-124903
  doi: 10.1016/S0305-0548(01)00040-5
– ident: bibr19-2013-124903
  doi: 10.1007/s10845-009-0373-8
SSID ssib050600699
ssib044728254
ssj0000395696
Score 2.0276046
Snippet A flexible flow-shop scheduling (FFS) with nonidentical parallel machines for minimizing the maximum completion time or makespan is a well-known combinational...
SourceID doaj
proquest
gale
crossref
sage
emarefa
SourceType Open Website
Aggregation Database
Publisher
StartPage 1
SubjectTerms Algorithms
Genetic algorithms
Hormones
Mathematical models
Modulation
Optimization
Scheduling
Simulated annealing
SummonAdditionalLinks – databaseName: Directory of Open Access Journals
  dbid: DOA
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Na9wwEBUlp15KSxq6bVpUKPRkYluSP45O6LIUthS2gdyEPkbNQtYOu17yC_q_OyMrS5YWeunNtoSRNE_SjNC8x9gnZ3IFtvFZQ5fDZGlthl6Ry4BUkoAowQIlCi-_VYtr-fVG3TyR-qI7YRM98DRwF14EsF5Z54SVkAfjSgXemwAeisZNgU-hngRTiCQpa8rJPCCNWPTyqm1Tgh7uoRj0F-KClJcf5bLSlhSZ-2N6rsF38-dKfXTlK-5C85fsRXIfeTc1-xV7Bv0p-9X1fDocAM-JRxoLs9V6Q8pc-KXDpdRQ1jnv7n4O2_V4u-GXuHl5PvTc8AV6rUMPfDn4JOXFl0D5wOvdhqNLi1XmxJpp7wAfhodsdTvc8xUa2-_jX79PmjSv2fX8y4-rRZbkFTIn22LMCjSFgNzmogm1Uk5W4IvgG2mtcV4oUdmqDU0pgwhV6xsjbWhlASCUrSzk4oyd9Ni-N4y7HJEgQuFFbqS3psUwKTK9VSXUuCzMEBRphPX9xKKhY_ShlCZD6MkQM3ZJo3-oQtTX8QMCQidA6H8BYsbOku0O_yFSQ9nM2GcypaaZO26NMykBAbtAHFi6E1Vbt-iPYjvOj2rijHNHxR8fwaCpiK6p9TDsdxhHYfxX1KJUWIdQotOKsPtbd9_-j-6-Y8_LqNBBp0Ln7GTc7uE9-kmj_RCnxG_w4BEd
  priority: 102
  providerName: Directory of Open Access Journals
Title An Improved Genetic-Simulated Annealing Algorithm Based on a Hormone Modulation Mechanism for a Flexible Flow-Shop Scheduling Problem
URI https://search.emarefa.net/detail/BIM-447548
https://journals.sagepub.com/doi/full/10.1155/2013/124903
https://search.proquest.com/docview/1448717325
https://doaj.org/article/d3febd5bcc3b4e0fac25eddafede18c1
Volume 2013
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1Lb9NAEF616QUOiFdFSokWCYmTwfbuOvYJOSghQkpVNVT0ttqX20iNXSWOql648b-ZWW8iAhy45LEe2WvPY2fGO98Q8s6oWDid2yjHzWE81ToCr8hEDrskOYQEq7BQeHaWTS_51ytxdUAW21qY8ATXH3BbFczIG2vUbsxGdyouBETsCfuIbZNj9mnTLmWX6N7208ARfDO9WeJLbYNbIR-ibWHbITlKIezjPXJUTi6-74Sf8yGWce6EE4H34iz46t6sMwglfL-vJAPFzCGMC_V-f8xob4XzjQB8ta-C_-pvw7-3g8wvapOn5EnwRmnZic8zcuDq5-TxbxiFL8jPsqZd5sFZiiDVQBrNF0ts-wUjJdhphSXttLy9blaL9mZJR7AyWtrUVNEpuMRN7eissaFPGJ05LDZerJcU_GUgmSAkp7518KO5j-Y3zR2dgyTZjT_redfw5iW5nIy_fZ5GoXdDZHiRtFECfGYu1jHLq6EQhmfOJpXNudbKWCZYprOiylNesSorbK64rgqeOMeEzrSL2THp1TC_V4SaGMSMVYllseJWqwJiMA8jl6VuCDanDxIXnre86yA6pA9thJDIFtmxpU9GyIsdCeJq-4FmdS2DmkrLKqet0HBBzV1cKZMKZ62qnHVJbpI-OQ6c3J0HERN53ifvkbESzUK7UkaF6ga4BQTYkiXLimEBzi7M43SPEtTZ7B1-uxUNiYdwD1ztms0agjQILpMhSwXQoMzIrbL863ZP_oPmNXmU-u4emFE6Jb12tXFvwMdq9YAc5pMvg6Aj8D0an51fDHzGAj5nP8a_AENxJIg
link.rule.ids 315,786,790,870,2115,4043,21994,27884,27954,27955,27956,33407,33778,44978,45366
linkProvider SAGE Publications
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1Lb9QwELZQewAOiFfFlgJGQuIUSGI7mxxTxGqBboXYVvRm2fG4XambVLtZ8Qv438w47ooFDtzyGCVO5pvxjOX5hrE3jUkV2NIlJW0Ok7m1CUZFTQLUJQmIEsxTofDstJiey88X6iIWhVEtTPyD63e0rQpHFJz11rqVwmQ9E--pYzJRfO5LJQrE9X49-fZ9i2Mpx1SRucUZceilRQy7g4cWmBWE1l1ZgTZWYkYWS_f-eMPOZBU4_UPhrsFz87cP39kMFuanyUP2IAaWvB6Q8IjdgfYxu_8b3eAT9rNu-bCIAI4T3zSKJvPFkjp44ZUaXa6h6nReX192q0V_teTHOMk53rXc8ClGt10LfNa52PKLz4DqhhfrJcfQF0UmxK5prwEPuh_J_Kq74XMEhduEp34detc8ZeeTj2cfpklsw5A0ssr6JEOVCUhtKko_VqqRBbjMu1JaaxonUAO2qHyZSy98UbnSSOsrmQEIZQsLqThgey2O7xnjTYqIET5zIjXSWVNhOhUY4Yocxug-Rgie-L_1zcC2oUOWopQmtehBLSN2TLrYihBFdrjQrS51tDjthAfrlMUXWgmpN02uwDnjwUFWNtmIHURNbp9D5IeyHLG3pFhNFt6vTGNioQJ-AnFl6VoU1bjCuBXHcbQjiZbZ7Nx-fQsNTbdoO1sL3WaN-RbmidlY5AplCDP6Fvf_-tzD_5B5xe5Oz2Yn-uTT6Zfn7F4emnbQQtER2-tXG3iBoVNvX0ZL-QWZlg1G
linkToPdf http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1Lj9MwELZWuxKCA-K1orCAkZA4BZLYTpNjFqjKo6sVZcXeLDse71baJlUf4hfwv5lx3IoCB255jBIn8_CM5fk-xl41JlVgS5eUtDlM5tYmmBU1CRBLEhAkmKdG4clZMb6Qny7V5QErt70w8Q-u3tC2KhxRCNbk3Qvnew9XCgv2TLwl1mSC-TySRJJ2yI7q0dfvO1uWckhdmTtbIxy9tIipd4jSAiuDQN-VFehnJVZlsX3vjzfsTVgB1z807xo8N3_H8b0NYWGOGt1jd2NyyeveGu6zA2gfsDu_QQ4-ZD_rlvcLCeA4YU6jaDKdzYnFC6_UGHYNdajz-uaqW87W13N-ihOd413LDR9jhtu1wCedi7RffALUOzxbzTmmvygyIoRNewN40P1Iptfdgk_RMNwmPPW85695xC5GH769GyeRiiFpZJWtkwzVJiC1qSj9UKlGFuAy70pprWmcUKKwReXLXHrhi8qVRlpfyQxAKFtYSMUxO2xxfI8Zb1K0GuEzJ1IjnTUVllQBFa7IYYghZIAGFP-3XvSIGzpUKkppUovu1TJgp6SLnQjBZIcL3fJKR6_TTniwTll8oZWQetPkCpwzHhxkZZMN2HHU5O45BIAoywF7TYrV5OXrpWlMbFbATyC8LF2LohpWmLviOE72JNE7m73bL7emoekWbWlrodussObCWjEbilyhDNmM3tr-vz73yX_IvGC3zt-P9JePZ5-fstt54O2gtaITdrhebuAZZk9r-zw6yi-9cw5f
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=An+Improved+Genetic-Simulated+Annealing+Algorithm+Based+on+a+Hormone+Modulation+Mechanism+for+a+Flexible+Flow-Shop+Scheduling+Problem&rft.jtitle=Advances+in+mechanical+engineering&rft.au=Dai%2C+Min&rft.au=Tang%2C+Dunbing&rft.au=Zheng%2C+Kun&rft.au=Cai%2C+Qixiang&rft.date=2013&rft.pub=SAGE+Publications&rft.issn=1687-8132&rft.eissn=1687-8140&rft.volume=5&rft_id=info:doi/10.1155%2F2013%2F124903&rft.externalDocID=10.1155_2013%2F124903
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1687-8132&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1687-8132&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1687-8132&client=summon