A Boltzmann-Based Estimation of Distribution Algorithm for a General Resource Scheduling Model

Most researchers employed common functional models when managing scheduling problems with controllable processing times. However, in many complicated manufacturing systems with a high diversity of jobs, these functional resource models fail to reflect their specific characteristics. To fulfill these...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on evolutionary computation Vol. 19; no. 6; pp. 793 - 806
Main Authors: Xinle Liang, Huaping Chen, Lozano, Jose A.
Format: Journal Article
Language:English
Published: New York IEEE 01.12.2015
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
ISSN:1089-778X, 1941-0026
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Most researchers employed common functional models when managing scheduling problems with controllable processing times. However, in many complicated manufacturing systems with a high diversity of jobs, these functional resource models fail to reflect their specific characteristics. To fulfill these requirements, we apply a more general model, the discrete model. Traditional functional models can be viewed as special cases of such model. In this paper, the discrete model is implemented on a problem of minimizing the weighted resource allocation subject to a common deadline on a single machine. By reducing the problem to a partition problem, we demonstrate that it is NP-complete, which addresses the difficult issue of the guarantee of both the solution quality and time cost. In order to tackle the problem, we develop an estimation of distribution algorithm based on an approximation of the Boltzmann distribution. The approximation strategy represents a tradeoff between complexity and solution accuracy. The results of the experiments conducted on benchmarks show that, compared with other alternative approaches, the proposed algorithm has competitive behavior, obtaining 74 best solutions out of 90 instances.
AbstractList Most researchers employed common functional models when managing scheduling problems with controllable processing times. However, in many complicated manufacturing systems with a high diversity of jobs, these functional resource models fail to reflect their specific characteristics. To fulfill these requirements, we apply a more general model, the discrete model. Traditional functional models can be viewed as special cases of such model. In this paper, the discrete model is implemented on a problem of minimizing the weighted resource allocation subject to a common deadline on a single machine. By reducing the problem to a partition problem, we demonstrate that it is NP-complete, which addresses the difficult issue of the guarantee of both the solution quality and time cost. In order to tackle the problem, we develop an estimation of distribution algorithm based on an approximation of the Boltzmann distribution. The approximation strategy represents a tradeoff between complexity and solution accuracy. The results of the experiments conducted on benchmarks show that, compared with other alternative approaches, the proposed algorithm has competitive behavior, obtaining 74 best solutions out of 90 instances.
Author Lozano, Jose A.
Xinle Liang
Huaping Chen
Author_xml – sequence: 1
  surname: Xinle Liang
  fullname: Xinle Liang
  email: shindler@mail.ustc.edu.cn
  organization: Sch. of Comput. Sci. & Technol., Univ. of Sci. & Technol. of China, Hefei, China
– sequence: 2
  surname: Huaping Chen
  fullname: Huaping Chen
  organization: Sch. of Comput. Sci. & Technol., Univ. of Sci. & Technol. of China, Hefei, China
– sequence: 3
  givenname: Jose A.
  surname: Lozano
  fullname: Lozano, Jose A.
  organization: Dept. of Comput. Sci. & Artificial IntelligenceIntelligent Syst. Group, Univ. of the Basque Country, Leioa, Spain
BookMark eNp9kE1PAjEQhhuDiYD-AOOliefFfuyy7REQ0QRjomg8uSndKZQsW2zLQX-9y0c8ePA0M8n7zrzzdFCrdjUgdElJj1Iib2bjt1GPEZr2GBeM8uwEtalMaUII67eangiZ5Ll4P0OdEFakUWZUttHHAA9dFb_Xqq6ToQpQ4nGIdq2idTV2Bt_aEL2db_fzoFo4b-NyjY3zWOEJ1OBVhZ8huK3XgF_0EsptZesFfnQlVOfo1KgqwMWxdtHr3Xg2uk-mT5OH0WCaaCZ5TCiIlBoDUvezJpjOOMzLPihFtSEMTGZKlktZciOlFkKyFGSWQklTnpZaaN5F14e9G-8-txBisWoC1c3JguZciCwljDeq_KDS3oXgwRTaxv2n0StbFZQUO5jFDmaxg1kcYTZO-se58Q0k__Wv5-rgsQDwq-9LkXOW8R_r34KE
CODEN ITEVF5
CitedBy_id crossref_primary_10_1016_j_ejor_2016_06_066
crossref_primary_10_1016_j_asoc_2018_08_036
crossref_primary_10_1016_j_ins_2017_02_021
crossref_primary_10_1109_TAES_2022_3224694
crossref_primary_10_1109_TCYB_2016_2523000
crossref_primary_10_1371_journal_pone_0302207
crossref_primary_10_1016_j_future_2019_01_006
crossref_primary_10_1109_TEVC_2019_2910721
crossref_primary_10_1109_TEVC_2019_2932624
crossref_primary_10_1016_j_asoc_2017_04_066
crossref_primary_10_1016_j_apm_2017_11_018
crossref_primary_10_1016_j_patcog_2017_09_001
crossref_primary_10_1109_ACCESS_2020_3027559
crossref_primary_10_1016_j_ins_2022_07_016
crossref_primary_10_1109_TII_2020_2999328
crossref_primary_10_1016_j_swevo_2024_101502
crossref_primary_10_1016_j_knosys_2023_111059
crossref_primary_10_1016_j_ins_2020_05_108
crossref_primary_10_1007_s10489_025_06237_3
Cites_doi 10.1016/0167-6377(95)00011-8
10.1007/s10951-007-0044-6
10.1007/978-3-540-30547-7_39
10.18637/jss.v035.i07
10.1287/opre.28.5.1155
10.1016/S0959-6526(03)00104-5
10.1016/S0925-5273(00)00040-2
10.1007/s10951-005-6813-1
10.1016/S0378-7796(03)00016-6
10.1109/TEVC.2013.2260548
10.1103/PhysRev.106.620
10.1007/s11633-007-0262-6
10.1016/j.enpol.2007.06.014
10.1016/0377-2217(96)00129-4
10.1007/3-540-61723-X_983
10.1007/s10479-004-5030-1
10.1109/4235.585892
10.1007/s10951-007-0025-9
10.1109/TEVC.2007.906095
10.1002/ceat.200900456
10.1162/evco.1997.5.3.303
10.1016/j.esd.2010.02.001
10.1016/j.tcs.2005.05.020
10.7551/mitpress/1090.001.0001
10.1109/71.265940
10.1287/ijoc.6.2.154
10.1007/978-1-4615-1507-4_24
10.1023/B:ANOR.0000030685.31167.11
10.1007/s00170-002-1477-x
10.1016/S0888-613X(02)00093-2
10.1002/0471200611
10.1016/j.ejor.2004.12.008
10.1016/j.ijpe.2009.03.003
10.1016/S0377-2217(02)00732-4
10.1111/j.1540-5915.2000.tb00945.x
10.1016/0166-218X(90)90105-L
10.1007/978-1-4615-1539-5
10.1080/00207543.2011.649800
10.1016/j.cie.2007.08.008
10.1109/TSMCB.2006.887946
10.1109/4235.797971
10.1016/j.dam.2007.02.003
10.1080/05695558008974515
10.1016/0377-2217(93)90245-I
10.1287/ijoc.1.3.190
10.1145/321127.321128
10.1016/S0305-0548(03)00081-9
10.1016/0305-0548(93)E0014-K
10.1007/3-540-32494-1
10.1016/S0377-2217(00)00312-X
10.1016/S0167-6377(97)00010-2
10.1287/ijoc.2.1.4
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Dec 2015
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Dec 2015
DBID 97E
RIA
RIE
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
DOI 10.1109/TEVC.2014.2382135
DatabaseName IEEE Xplore (IEEE)
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Technology Research Database
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EISSN 1941-0026
EndPage 806
ExternalDocumentID 3883754881
10_1109_TEVC_2014_2382135
6987325
Genre orig-research
GrantInformation_xml – fundername: Basque Government Research Groups 2013–2018
  grantid: IT-609-13
– fundername: European Union Seventh Framework Programme
  grantid: 247619
– fundername: 973 Program of China
  grantid: 2011CB707006
– fundername: Ministerio de Economia y Competitividad
  grantid: TIN2013-41272P
– fundername: National Natural Science Foundation of China
  grantid: 61329302; 71171184
  funderid: 10.13039/501100001809
GroupedDBID -~X
.DC
0R~
29I
4.4
5GY
5VS
6IF
6IK
6IL
6IN
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABJNI
ABQJQ
ABVLG
ACGFO
ACGFS
ACIWK
ADZIZ
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CHZPO
CS3
EBS
EJD
HZ~
H~9
IEGSK
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
O9-
OCL
P2P
PQQKQ
RIA
RIE
RIL
RNS
TN5
VH1
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c293t-1e841ffe9c65145c53ebd6eaa1cf02ef5fd2799d3f99c88924e954ed1434dc8c3
IEDL.DBID RIE
ISICitedReferencesCount 22
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000366105600003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1089-778X
IngestDate Sun Nov 09 06:59:28 EST 2025
Tue Nov 18 22:32:49 EST 2025
Sat Nov 29 03:13:47 EST 2025
Tue Aug 26 16:40:05 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 6
Keywords Boltzmann distribution
scheduling
controllable processing times
discrete model
estimation of distribution algorithm (EDA)
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c293t-1e841ffe9c65145c53ebd6eaa1cf02ef5fd2799d3f99c88924e954ed1434dc8c3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
PQID 1738854023
PQPubID 85418
PageCount 14
ParticipantIDs crossref_primary_10_1109_TEVC_2014_2382135
proquest_journals_1738854023
crossref_citationtrail_10_1109_TEVC_2014_2382135
ieee_primary_6987325
PublicationCentury 2000
PublicationDate 2015-Dec.
2015-12-00
20151201
PublicationDateYYYYMMDD 2015-12-01
PublicationDate_xml – month: 12
  year: 2015
  text: 2015-Dec.
PublicationDecade 2010
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE transactions on evolutionary computation
PublicationTitleAbbrev TEVC
PublicationYear 2015
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref56
ref12
ref59
ref15
lozano (ref28) 2006; 192
ref58
ref53
ref55
ref11
bosman (ref42) 1999
ref10
ref17
ref16
ref19
ref18
russell (ref57) 1995; 25
ref51
michael (ref26) 1979
goldberg (ref61) 1989
ref45
ref47
ref41
ref43
mühlenbein (ref52) 2003
ref8
ref7
ref9
ref4
ref3
ref6
ref40
ng (ref14) 2004; 153
ref35
de bonet (ref46) 1997
ref34
ref37
ref36
ref31
ref30
ref33
ref32
baluja (ref44) 1994
ref2
ref1
ref39
ref38
baluja (ref48) 1997
holland (ref63) 1992
etxeberria (ref50) 1999
ref24
ref23
ref25
ref20
holland (ref64) 1975
ref66
ref22
ref65
ref21
janiak (ref5) 1987; 23
ref27
harik (ref49) 1999; 51
larrañaga (ref29) 2000
borwein (ref54) 1987
ref60
ref62
References_xml – ident: ref15
  doi: 10.1016/0167-6377(95)00011-8
– ident: ref24
  doi: 10.1007/s10951-007-0044-6
– ident: ref30
  doi: 10.1007/978-3-540-30547-7_39
– volume: 25
  year: 1995
  ident: ref57
  publication-title: Artificial Intelligence A Modern Approach
– year: 1975
  ident: ref64
  publication-title: Adaptation in Natural and Artificial Systems An Introductory Analysis With Applications to Biology Control and Artificial Intelligence
– year: 1994
  ident: ref44
  article-title: Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning
– ident: ref47
  doi: 10.18637/jss.v035.i07
– ident: ref8
  doi: 10.1287/opre.28.5.1155
– ident: ref1
  doi: 10.1016/S0959-6526(03)00104-5
– ident: ref6
  doi: 10.1016/S0925-5273(00)00040-2
– start-page: 343
  year: 2000
  ident: ref29
  article-title: Combinatorial optimization by learning and simulation of Bayesian networks
  publication-title: Proc 16th Conf Uncertainty Artif Intell
– start-page: 525
  year: 2003
  ident: ref52
  article-title: Evolutionary algorithms and the Boltzmann distribution
  publication-title: Foundations of Genetic Algorithms 7
– ident: ref7
  doi: 10.1007/s10951-005-6813-1
– year: 1997
  ident: ref48
  article-title: Combining multiple optimization runs with optimal dependency trees
– ident: ref39
  doi: 10.1016/S0378-7796(03)00016-6
– ident: ref32
  doi: 10.1109/TEVC.2013.2260548
– ident: ref65
  doi: 10.1103/PhysRev.106.620
– ident: ref58
  doi: 10.1007/s11633-007-0262-6
– start-page: 60
  year: 1999
  ident: ref42
  article-title: Linkage information processing in distribution estimation algorithms
  publication-title: Proc Genet Evol Comput Conf (GECCO)
– ident: ref4
  doi: 10.1016/j.enpol.2007.06.014
– ident: ref13
  doi: 10.1016/0377-2217(96)00129-4
– start-page: 424
  year: 1997
  ident: ref46
  article-title: MIMIC: Finding optima by estimating probability densities
  publication-title: Advances in neural information processing systems
– ident: ref41
  doi: 10.1007/3-540-61723-X_983
– ident: ref16
  doi: 10.1007/s10479-004-5030-1
– ident: ref59
  doi: 10.1109/4235.585892
– year: 1987
  ident: ref54
  publication-title: Pi and the AGM A Study in the Analytic Number Theory and Computational Complexity
– ident: ref23
  doi: 10.1007/s10951-007-0025-9
– ident: ref31
  doi: 10.1109/TEVC.2007.906095
– ident: ref2
  doi: 10.1002/ceat.200900456
– ident: ref43
  doi: 10.1162/evco.1997.5.3.303
– ident: ref3
  doi: 10.1016/j.esd.2010.02.001
– ident: ref60
  doi: 10.1016/j.tcs.2005.05.020
– year: 1992
  ident: ref63
  publication-title: Adaptation in Natural and Artificial Systems
  doi: 10.7551/mitpress/1090.001.0001
– ident: ref33
  doi: 10.1109/71.265940
– ident: ref34
  doi: 10.1287/ijoc.6.2.154
– year: 1989
  ident: ref61
  publication-title: Genetic Algorithms in Search Optimization and Machine Learning
– ident: ref53
  doi: 10.1007/978-1-4615-1507-4_24
– ident: ref18
  doi: 10.1023/B:ANOR.0000030685.31167.11
– ident: ref38
  doi: 10.1007/s00170-002-1477-x
– ident: ref51
  doi: 10.1016/S0888-613X(02)00093-2
– ident: ref66
  doi: 10.1002/0471200611
– ident: ref22
  doi: 10.1016/j.ejor.2004.12.008
– year: 1979
  ident: ref26
  publication-title: Computers and Intractability A Guide to the Theory of NP-Completeness
– ident: ref25
  doi: 10.1016/j.ijpe.2009.03.003
– volume: 153
  start-page: 211
  year: 2004
  ident: ref14
  article-title: Single machine batch scheduling with jointly compressible setup and processing times
  publication-title: Eur J Oper Res
  doi: 10.1016/S0377-2217(02)00732-4
– ident: ref36
  doi: 10.1111/j.1540-5915.2000.tb00945.x
– ident: ref10
  doi: 10.1016/0166-218X(90)90105-L
– ident: ref27
  doi: 10.1007/978-1-4615-1539-5
– ident: ref19
  doi: 10.1080/00207543.2011.649800
– ident: ref37
  doi: 10.1016/j.cie.2007.08.008
– ident: ref40
  doi: 10.1109/TSMCB.2006.887946
– ident: ref45
  doi: 10.1109/4235.797971
– ident: ref11
  doi: 10.1016/j.dam.2007.02.003
– start-page: 332
  year: 1999
  ident: ref50
  article-title: Global optimization using Bayesian networks
  publication-title: Proc 2nd Symp Artif Intell (CIMAF)
– ident: ref9
  doi: 10.1080/05695558008974515
– ident: ref17
  doi: 10.1016/0377-2217(93)90245-I
– volume: 51
  start-page: 801
  year: 1999
  ident: ref49
  article-title: Linkage learning via probabilistic modeling in the ECGA
  publication-title: Urbana
– ident: ref55
  doi: 10.1287/ijoc.1.3.190
– ident: ref62
  doi: 10.1145/321127.321128
– ident: ref21
  doi: 10.1016/S0305-0548(03)00081-9
– ident: ref35
  doi: 10.1016/0305-0548(93)E0014-K
– volume: 192
  year: 2006
  ident: ref28
  publication-title: Towards a New Evolutionary Computation Advances on Estimation of Distribution Algorithms
  doi: 10.1007/3-540-32494-1
– ident: ref20
  doi: 10.1016/S0377-2217(00)00312-X
– ident: ref12
  doi: 10.1016/S0167-6377(97)00010-2
– ident: ref56
  doi: 10.1287/ijoc.2.1.4
– volume: 23
  start-page: 289
  year: 1987
  ident: ref5
  article-title: One-machine scheduling with allocation of continuously-divisible resource and with no precedence constraints
  publication-title: Kybernetika
SSID ssj0014519
Score 2.2791278
Snippet Most researchers employed common functional models when managing scheduling problems with controllable processing times. However, in many complicated...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 793
SubjectTerms Approximation methods
Boltzmann distribution
Complexity theory
Controllable processing times
Discrete model
Estimation
Estimation of distribution algorithm
Production scheduling
Resource management
Scheduling
Simulation
Sociology
Title A Boltzmann-Based Estimation of Distribution Algorithm for a General Resource Scheduling Model
URI https://ieeexplore.ieee.org/document/6987325
https://www.proquest.com/docview/1738854023
Volume 19
WOSCitedRecordID wos000366105600003&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: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  customDbUrl:
  eissn: 1941-0026
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0014519
  issn: 1089-778X
  databaseCode: RIE
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwED6VigEG3ojykgcmRCAPJ7HHFooYUMUAqBORY5-hUpugNjDw67ETtyCBkNgyOA_li3Pf2XffB3ASoa8Syqjnp0J6NNTCyzGWnk5ztILnSV4X0TzepoMBGw75XQvOFr0wiFgXn-G5Paz38lUp3-xS2UViEuQojJdgKU2TpldrsWNgZVKaYnpuGCMbuh3MwOcX9_3HS1vERc9NfAqD2tntKwbVpio__sR1eLle_9-DbcCao5Gk2-C-CS0stmB9btFA3IzdgtVveoPb8NQlvXJcfUxEUXg9E78U6Zsp3nQvklKTKyuj6xywSHf8XE5H1cuEGGJLBHEK1WS-4m_u8mICle1nJ9ZSbbwDD9f9-8sbzxkseNJE-coLkNFAa-QyMbwplnGEuUpQiEBqP0QdaxWmnKtIcy4ZM6ka8piiMhyLKslktAvtoixwDwhLMVZhbshfEtKcyRw1j5jg1KSDgRCiA_78lWfSqY9bE4xxVmchPs8sSplFKXModeB0ccprI73x1-BtC8tioEOkA4dzXDM3OWdZkEaMGaYaRvu_n3UAK-bacVO1cgjtavqGR7As36vRbHpcf3efLbXWAw
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT9swFH6CDontMMaPiW5s-MBpIpA4dmIfCytioqs4dKgnIsd-BqSSoDbssL9-duJ2kzZN2i0HW47yxXnfi9_7PoCjFGOTMcGiOFc6YtSqqESuI5uX6AXPs7ItorkZ5eOxmE7l9Rocr3phELEtPsMTf9me5ZtaP_tfZaeZS5BTytfhBWeMxl231urMwAuldOX00nFGMQ1nmEksTyfDm3NfxsVOXISiSevt9isKtbYqf3yL2wBzsfV_t_YGXgciSQYd8tuwhtUObC1NGkjYszvw6jfFwV24HZCzetb8eFRVFZ25CGbI0G3yrn-R1JZ89kK6wQOLDGZ39fyhuX8kjtoSRYJGNVn-83er3LtQ5TvaiTdVm-3Bt4vh5PwyChYLkXZxvokSFCyxFqXOHHPimqdYmgyVSrSNKVpuDc2lNKmVUgvhkjWUnKFxLIsZLXT6FnpVXeE-EJEjN7R09C-jrBS6RCtToSRzCWGilOpDvHzkhQ76494GY1a0eUgsC49S4VEqAkp9-LSa8tSJb_xr8K6HZTUwINKHgyWuRdieiyLJUyEcV6Xpu7_POoTNy8nXUTH6Mr56Dy_dOryrYTmAXjN_xg-wob83D4v5x_Yd_Al22tlK
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+Boltzmann-Based+Estimation+of+Distribution+Algorithm+for+a+General+Resource+Scheduling+Model&rft.jtitle=IEEE+transactions+on+evolutionary+computation&rft.au=Liang%2C+Xinle&rft.au=Chen%2C+Huaping&rft.au=Lozano%2C+Jose+A.&rft.date=2015-12-01&rft.issn=1089-778X&rft.eissn=1941-0026&rft.volume=19&rft.issue=6&rft.spage=793&rft.epage=806&rft_id=info:doi/10.1109%2FTEVC.2014.2382135&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TEVC_2014_2382135
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1089-778X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1089-778X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1089-778X&client=summon