A general variable neighborhood search based on path relinking algorithm for multi-skill resource-constrained project scheduling problem with multiple restrictions

This paper proposes a general variable neighborhood search based path relinking algorithm (GVNS-PR) to solving the multi-skill resources-constrained project scheduling problem with multiple restrictions. Integrating a local refinement procedure and a path relinking framework, the proposed GVNS-PR is...

Full description

Saved in:
Bibliographic Details
Published inJournal of physics. Conference series Vol. 1341; no. 5; pp. 52006 - 52015
Main Authors Dai, H, Cheng, W
Format Journal Article
LanguageEnglish
Published Bristol IOP Publishing 01.10.2019
Subjects
Online AccessGet full text
ISSN1742-6588
1742-6596
1742-6596
DOI10.1088/1742-6596/1341/5/052006

Cover

Abstract This paper proposes a general variable neighborhood search based path relinking algorithm (GVNS-PR) to solving the multi-skill resources-constrained project scheduling problem with multiple restrictions. Integrating a local refinement procedure and a path relinking framework, the proposed GVNS-PR is assessed on two datasets and achieves highly competitive results. One set of benchmark instances which are known in the literature can be used to demonstrate the capability of the proposed algorithm to seek for the high quality schedules, in comparison with the existed state-of-the-art algorithms. The other one revises the previous through adding the researched restrictions into instances information. Two critical components of the proposed algorithm are shed light on to confirm their key role to the successful method.
AbstractList This paper proposes a general variable neighborhood search based path relinking algorithm (GVNS-PR) to solving the multi-skill resources-constrained project scheduling problem with multiple restrictions. Integrating a local refinement procedure and a path relinking framework, the proposed GVNS-PR is assessed on two datasets and achieves highly competitive results. One set of benchmark instances which are known in the literature can be used to demonstrate the capability of the proposed algorithm to seek for the high quality schedules, in comparison with the existed state-of-the-art algorithms. The other one revises the previous through adding the researched restrictions into instances information. Two critical components of the proposed algorithm are shed light on to confirm their key role to the successful method.
Author Dai, H
Cheng, W
Author_xml – sequence: 1
  givenname: H
  surname: Dai
  fullname: Dai, H
  email: ann@my.swjtu.edu.cn
  organization: , PRC
– sequence: 2
  givenname: W
  surname: Cheng
  fullname: Cheng, W
  organization: Technology and Equipment of Rail Transit Operation and Maintenance Key Laboratory of Sichuan Province , PR China
BookMark eNqVkF9r1TAYxoNMcJt-BgPeCd3Jn6ZNL7wYB3XKYIJ6HdI0Pc1ZTlKTdmOfZ190b6lsKIKam4Tk-T3vk-cEHYUYLEKvKTmjRMoNrUtWVKKpNpSXdCM2RDBCqmfo-PHl6PEs5Qt0kvOeEA6rPkb353hng03a4xudnG69xcG63dDGNMTY4Wx1MgNudbYdjgGPehpwst6Faxd2WPtdTG4aDriPCR9mP7kiXzvvQZPjnIwtTAx5StoFMBhT3Fsz4WwG281-cYArGHrAt-CyGoyQAegpOTM5gF-i57322b76uZ-i7x_ef9teFJdXHz9tzy8Lw5msCt6RTrJWM2EbKwWtJCfClFLKqmtKSkUtNO_7ljHSyI7Kmras7i3pOWskb2t-iuTqO4dR391q79WY3EGnO0WJWspWS41qqVQtZSuh1rIBfbOi8JsfM2RXe_h8gLSKiUoSSFNSUNWryqSYc7L9f_i_-400btJLO0uz_h_4tyvv4vgU7fOX7ddfhWrsehDzP4j_NuIBQDjEPw
CitedBy_id crossref_primary_10_2478_mspe_2024_0012
Cites_doi 10.1051/ro:2007015
10.1016/j.ejor.2007.02.002
10.1111/itor.12419
10.1016/j.future.2018.04.029
10.1007/s00291-010-0233-0
10.1504/IJISE.2017.085216
10.1007/s00500-014-1455-x
10.1504/IJPOM.2018.090372
10.1109/TEVC.2002.804914
10.1007/s00500-015-1866-3
10.1016/S0377-2217(98)00204-5
10.1016/j.asoc.2017.06.042
10.1007/s00291-015-0402-2
10.1016/j.ejor.2005.01.065
10.1016/j.cor.2018.01.001
10.1016/j.cor.2011.08.022
10.1007/s10951-008-0079-3
10.1016/j.cie.2017.07.028
10.1016/j.ejor.2012.01.036
10.1016/j.engappai.2014.10.024
10.1016/j.ejor.2012.07.012
10.1007/s11750-011-0188-6
ContentType Journal Article
Copyright Published under licence by IOP Publishing Ltd
2019. This work is published under http://creativecommons.org/licenses/by/3.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: Published under licence by IOP Publishing Ltd
– notice: 2019. This work is published under http://creativecommons.org/licenses/by/3.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID O3W
TSCCA
AAYXX
CITATION
8FD
8FE
8FG
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
H8D
HCIFZ
L7M
P5Z
P62
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
ADTOC
UNPAY
DOI 10.1088/1742-6596/1341/5/052006
DatabaseName Institute of Physics Open Access Journal Titles
IOPscience (Open Access)
CrossRef
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central
Technology Collection
ProQuest One Community College
ProQuest Central Korea
Aerospace Database
SciTech Premium Collection (via ProQuest)
Advanced Technologies Database with Aerospace
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic
ProQuest One Academic UKI Edition
ProQuest Central China
Unpaywall for CDI: Periodical Content
Unpaywall
DatabaseTitle CrossRef
Publicly Available Content Database
Advanced Technologies & Aerospace Collection
Technology Collection
Technology Research Database
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest One Academic Eastern Edition
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Central China
ProQuest Central
Advanced Technologies & Aerospace Database
ProQuest One Applied & Life Sciences
Aerospace Database
ProQuest One Academic UKI Edition
ProQuest Central Korea
ProQuest Central (New)
ProQuest One Academic
Advanced Technologies Database with Aerospace
ProQuest One Academic (New)
DatabaseTitleList CrossRef

Publicly Available Content Database
Database_xml – sequence: 1
  dbid: O3W
  name: Institute of Physics Open Access Journal Titles
  url: http://iopscience.iop.org/
  sourceTypes:
    Enrichment Source
    Publisher
– sequence: 2
  dbid: UNPAY
  name: Unpaywall
  url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/
  sourceTypes: Open Access Repository
– sequence: 3
  dbid: 8FG
  name: ProQuest Technology Collection
  url: https://search.proquest.com/technologycollection1
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Physics
DocumentTitleAlternate A general variable neighborhood search based on path relinking algorithm for multi-skill resource-constrained project scheduling problem with multiple restrictions
EISSN 1742-6596
ExternalDocumentID 10.1088/1742-6596/1341/5/052006
10_1088_1742_6596_1341_5_052006
JPCS_1341_5_052006
GroupedDBID 1JI
29L
2WC
4.4
5B3
5GY
5PX
5VS
7.Q
AAJIO
AAJKP
ABHWH
ACAFW
ACHIP
AEFHF
AEJGL
AFKRA
AFYNE
AIYBF
AKPSB
ALMA_UNASSIGNED_HOLDINGS
ARAPS
ASPBG
ATQHT
AVWKF
AZFZN
BENPR
BGLVJ
CCPQU
CEBXE
CJUJL
CRLBU
CS3
DU5
E3Z
EBS
EDWGO
EQZZN
F5P
FRP
GROUPED_DOAJ
GX1
HCIFZ
HH5
IJHAN
IOP
IZVLO
J9A
KNG
KQ8
LAP
N5L
N9A
O3W
OK1
P2P
PIMPY
PJBAE
RIN
RNS
RO9
ROL
SY9
T37
TR2
TSCCA
UCJ
W28
XSB
~02
AAYXX
AEINN
CITATION
OVT
PHGZM
PHGZT
PQGLB
PUEGO
8FD
8FE
8FG
ABUWG
AZQEC
DWQXO
H8D
L7M
P62
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
02O
1WK
AALHV
ACARI
ADTOC
AERVB
AGQPQ
AHSEE
ARNYC
BBWZM
C1A
EJD
FEDTE
H13
HVGLF
JCGBZ
M48
Q02
S3P
UNPAY
ID FETCH-LOGICAL-c3286-3d0d82ba25e9e85168305c48886d9411575a3ffb22098d1871b27fe0f32983b73
IEDL.DBID BENPR
ISSN 1742-6588
1742-6596
IngestDate Sun Sep 07 10:51:04 EDT 2025
Sun Jul 13 04:30:22 EDT 2025
Wed Oct 01 01:15:36 EDT 2025
Thu Apr 24 22:52:40 EDT 2025
Thu Jan 07 13:52:02 EST 2021
Wed Aug 21 03:33:45 EDT 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 5
Language English
License Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.
cc-by
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c3286-3d0d82ba25e9e85168305c48886d9411575a3ffb22098d1871b27fe0f32983b73
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
OpenAccessLink https://www.proquest.com/docview/2568051641?pq-origsite=%requestingapplication%&accountid=15518
PQID 2568051641
PQPubID 4998668
PageCount 10
ParticipantIDs crossref_primary_10_1088_1742_6596_1341_5_052006
proquest_journals_2568051641
unpaywall_primary_10_1088_1742_6596_1341_5_052006
crossref_citationtrail_10_1088_1742_6596_1341_5_052006
iop_journals_10_1088_1742_6596_1341_5_052006
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 20191001
PublicationDateYYYYMMDD 2019-10-01
PublicationDate_xml – month: 10
  year: 2019
  text: 20191001
  day: 01
PublicationDecade 2010
PublicationPlace Bristol
PublicationPlace_xml – name: Bristol
PublicationTitle Journal of physics. Conference series
PublicationTitleAlternate J. Phys.: Conf. Ser
PublicationYear 2019
Publisher IOP Publishing
Publisher_xml – name: IOP Publishing
References Đumić (JPCS_1341_5_052006bib8) 2018; 86
Bellenguez (JPCS_1341_5_052006bib13) 2004
Hindi (JPCS_1341_5_052006bib3) 2002; 6
Gonzalez-Pardo (JPCS_1341_5_052006bib10) 2017; 60
Li (JPCS_1341_5_052006bib16) 2009; 12
Myszkowski (JPCS_1341_5_052006bib21) 2017
Farughi (JPCS_1341_5_052006bib7) 2018; 31
Myszkowski (JPCS_1341_5_052006bib19) 2016
Chen (JPCS_1341_5_052006bib11) 2017; 53
Kolisch (JPCS_1341_5_052006bib12) 2006; 174
Kirlik (JPCS_1341_5_052006bib31) 2012; 39
Myszkowski (JPCS_1341_5_052006bib14) 2015
Lei (JPCS_1341_5_052006bib33) 2012; 20
Poppenborg (JPCS_1341_5_052006bib5) 2016; 38
Laurent (JPCS_1341_5_052006bib6) 2017; 112
Al-Anzi (JPCS_1341_5_052006bib2) 2010; 03
Myszkowski (JPCS_1341_5_052006bib20) 2017; 62
Hansen (JPCS_1341_5_052006bib30) 2008; 191
Glover (JPCS_1341_5_052006bib24) 2000; 29
Akeshtech (JPCS_1341_5_052006bib4) 2017; 17
Brucker (JPCS_1341_5_052006bib1) 1999; 112
Berthaut (JPCS_1341_5_052006bib29) 2018; 10
Dai (JPCS_1341_5_052006bib23) 2017; 26
Ruben (JPCS_1341_5_052006bib25) 2017; 24
Ata (JPCS_1341_5_052006bib9) 2015
Myszkowski (JPCS_1341_5_052006bib18) 2015; 19
Correia (JPCS_1341_5_052006bib17) 2012; 34
Lacomme (JPCS_1341_5_052006bib26) 2015; 38
Nenad (JPCS_1341_5_052006bib32) 2012; 220
Muritiba (JPCS_1341_5_052006bib28) 2018; 92
Zheng (JPCS_1341_5_052006bib22) 2017; 21
Glover (JPCS_1341_5_052006bib34) 1997
Bellenguez-Morineau (JPCS_1341_5_052006bib15) 2007; 41
Wang (JPCS_1341_5_052006bib27) 2012; 223
References_xml – start-page: 402
  year: 2016
  ident: JPCS_1341_5_052006bib19
– volume: 41
  start-page: 155
  year: 2007
  ident: JPCS_1341_5_052006bib15
  publication-title: J. RAIRO-Operations Research
  doi: 10.1051/ro:2007015
– volume: 191
  start-page: 593
  year: 2008
  ident: JPCS_1341_5_052006bib30
  publication-title: J. EJOR.
  doi: 10.1016/j.ejor.2007.02.002
– volume: 24
  start-page: 1307
  year: 2017
  ident: JPCS_1341_5_052006bib25
  publication-title: J. Int. Transcations in Operational Research
  doi: 10.1111/itor.12419
– volume: 86
  start-page: 211
  year: 2018
  ident: JPCS_1341_5_052006bib8
  publication-title: J. Future Generation Computer System
  doi: 10.1016/j.future.2018.04.029
– volume: 17
  start-page: 125
  year: 2017
  ident: JPCS_1341_5_052006bib4
  publication-title: J. Int. J. of Computer Science and Network Securtiy
– volume: 34
  start-page: 635
  year: 2012
  ident: JPCS_1341_5_052006bib17
  publication-title: J. Or Spectrum.
  doi: 10.1007/s00291-010-0233-0
– volume: 62
  year: 2017
  ident: JPCS_1341_5_052006bib20
  publication-title: J. Applied Soft Computing
– year: 2015
  ident: JPCS_1341_5_052006bib14
– volume: 53
  start-page: 249
  year: 2017
  ident: JPCS_1341_5_052006bib11
  publication-title: J. Computer Engineering and Appl.
– volume: 26
  start-page: 508
  year: 2017
  ident: JPCS_1341_5_052006bib23
  publication-title: J. Int. J. of Industrial & Systems Engineering
  doi: 10.1504/IJISE.2017.085216
– start-page: 2014
  year: 2015
  ident: JPCS_1341_5_052006bib9
– volume: 19
  start-page: 3599
  year: 2015
  ident: JPCS_1341_5_052006bib18
  publication-title: J. Soft Computing
  doi: 10.1007/s00500-014-1455-x
– volume: 10
  start-page: 1
  year: 2018
  ident: JPCS_1341_5_052006bib29
  publication-title: J. Int. J. of Project Organisation and Management
  doi: 10.1504/IJPOM.2018.090372
– volume: 6
  start-page: 512
  year: 2002
  ident: JPCS_1341_5_052006bib3
  publication-title: J. IEEE Transactions on Evolutionary Computation
  doi: 10.1109/TEVC.2002.804914
– volume: 21
  start-page: 1537
  year: 2017
  ident: JPCS_1341_5_052006bib22
  publication-title: J. Soft Computing
  doi: 10.1007/s00500-015-1866-3
– volume: 112
  start-page: 3
  year: 1999
  ident: JPCS_1341_5_052006bib1
  publication-title: J. EJOR.
  doi: 10.1016/S0377-2217(98)00204-5
– volume: 60
  year: 2017
  ident: JPCS_1341_5_052006bib10
  publication-title: J. Applied Soft Computing.
  doi: 10.1016/j.asoc.2017.06.042
– volume: 38
  start-page: 305
  year: 2016
  ident: JPCS_1341_5_052006bib5
  publication-title: J. Or Spectrum
  doi: 10.1007/s00291-015-0402-2
– volume: 31
  start-page: 780
  year: 2018
  ident: JPCS_1341_5_052006bib7
  publication-title: J. Int. J. of Engineering
– volume: 174
  start-page: 23
  year: 2006
  ident: JPCS_1341_5_052006bib12
  publication-title: J. EJOR.
  doi: 10.1016/j.ejor.2005.01.065
– volume: 29
  start-page: 653
  year: 2000
  ident: JPCS_1341_5_052006bib24
  publication-title: J. Control & Cybernetics
– volume: 92
  start-page: 145
  year: 2018
  ident: JPCS_1341_5_052006bib28
  publication-title: J Computers & Operations Research
  doi: 10.1016/j.cor.2018.01.001
– volume: 39
  start-page: 1506
  year: 2012
  ident: JPCS_1341_5_052006bib31
  publication-title: J. Computers & Operations Research
  doi: 10.1016/j.cor.2011.08.022
– volume: 12
  start-page: 281
  year: 2009
  ident: JPCS_1341_5_052006bib16
  publication-title: J. J. of Scheduling.
  doi: 10.1007/s10951-008-0079-3
– volume: 112
  start-page: 634
  year: 2017
  ident: JPCS_1341_5_052006bib6
  publication-title: J. Computers & Industrial Engineering
  doi: 10.1016/j.cie.2017.07.028
– volume: 220
  start-page: 270
  year: 2012
  ident: JPCS_1341_5_052006bib32
  publication-title: J. EJOR.
  doi: 10.1016/j.ejor.2012.01.036
– volume: 38
  start-page: 237
  year: 2015
  ident: JPCS_1341_5_052006bib26
  publication-title: J. Engineering Applications of Artificial Intelligence
  doi: 10.1016/j.engappai.2014.10.024
– volume: 223
  start-page: 595
  year: 2012
  ident: JPCS_1341_5_052006bib27
  publication-title: J. EJOR.
  doi: 10.1016/j.ejor.2012.07.012
– start-page: 1
  year: 1997
  ident: JPCS_1341_5_052006bib34
– volume: 03
  start-page: 1125
  year: 2010
  ident: JPCS_1341_5_052006bib2
  publication-title: J. Communications & Network
– volume: 20
  start-page: 99
  year: 2012
  ident: JPCS_1341_5_052006bib33
  publication-title: J. TOP.
  doi: 10.1007/s11750-011-0188-6
– year: 2004
  ident: JPCS_1341_5_052006bib13
– start-page: 2017
  year: 2017
  ident: JPCS_1341_5_052006bib21
SSID ssj0033337
Score 2.217205
Snippet This paper proposes a general variable neighborhood search based path relinking algorithm (GVNS-PR) to solving the multi-skill resources-constrained project...
SourceID unpaywall
proquest
crossref
iop
SourceType Open Access Repository
Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 52006
SubjectTerms Algorithms
Constrictions
Critical components
Physics
Project management
Resource scheduling
Schedules
SummonAdditionalLinks – databaseName: IOP Science Platform
  dbid: IOP
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3daxQxEA-2Ivrit3haJaCP5m4vyWaTx1IspaAWtNC3kE2ytXS7d9yHov-O_6gzm2ztCVLFe7qHmSXZSWZ-yc78hpDXqq6i5KFhgpeOycA9074wLEC4cFKEWAa8Gnj3Xh0cy8OT8uRqLcxsnl3_GP4mouD0CnNCnJ4AhuZMlUZNkIxsUk566iC1RW4KDfgYi_g-HA3eWMCvSkWRqKT1kOP15wdtRKgtGMUG-Ly97ubu21fXtlfi0P494ocZpPST8_F6VY_999_IHf9vivfJ3QxT6W7SeEBuxO4hudWni_rlI_Jjl54mvmr6BQ7bWH5FO7xkhRWFPMk0bSCKMTLQWUex8TFdxNypgbr2dLY4W32-oICZaZ_UyJbnZ20LMulzAvMIXLF_BTwgXxdROIlDZMQCepob4VC8R6ZDViRqY8eBfi89Jsf7bz_tHbDc7oF5wbViIhRB89rxMpoIQFBp8EUeHIxWwUgkBSqdaJqa88LoMIWTXs2rJhaN4EaLuhJPyHY36-JTQp1WLnLPeeOMDKLRvjJa-siNjFgqPCJqMLH1mQsdp9Ta_pu81hYtYNECFi1gS5ssMCLFpeI80YFcr_IGzGyza1heL_5qQ_zwaO_jpoSdh2ZEdoYl-UsU0KsGH6vkdESml8v0b8f57N_G-ZzcAexoUl7jDtleLdbxBeCzVf2y34A_AfiGKS0
  priority: 102
  providerName: IOP Publishing
– databaseName: Unpaywall
  dbid: UNPAY
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3daxQxEB_aK6IvfounVQL6aHp72WwueTyKpRQsB3pQn5Zskq1Ht3vHfSj23-k_6sx-nN2CVH1dZkKWmcn8JpkPgPcqGwUpfM5jkVguvXBcu8hwj-7CytiHxNPVwKdTdTyVJ2fJ2Q4M2lqYzvs9BmcImAVXiVED6jw2SAZVnyC1C3v0MerB3vR0Mv5alz0SZTVpcsvVZnT9eaWOP9qdzRcdqHl_Uy7szx-2KG54naNHMGn3WyebXBxs1tmBu7rVyvEffugxPGwQKBvXKvMEdkL5FO5VmaBu9Qyux-y8bkXNvmMcTZVVrKT7U1QWaoHMattg5P48m5eMZhqzZWiGMDBbnM-Xs_W3S4ZwmFX5inx1MSsKpKlfCrgjTEqjKXCB5iaIYZCNTo9q41kz44bRFTFrEx6Jm4YJVGbyHKZHH78cHvNmkgN3sdCKxz7yWmRWJMEExHhK4zHj8OzQyhtJ_X4SG-d5JkRktB9iEJeJUR6iPBZGx9kofgG9cl6Gl8CsVjYIJ0RujfRxrt3IaOmCMDJQFXAfVCvP1DVtzumXirR6btc6JQmkJIGUJJAmaS2BPkRbxkXd6eNulg-oMGlj9au7yd91yE8mh5-7FOnC533Yb_XvNykCU43Hp5LDPgy3Ovm3-3z1Hzyv4QFiQ1PnLe5Db73chDeIv9bZ28bmfgGTGBzF
  priority: 102
  providerName: Unpaywall
Title A general variable neighborhood search based on path relinking algorithm for multi-skill resource-constrained project scheduling problem with multiple restrictions
URI https://iopscience.iop.org/article/10.1088/1742-6596/1341/5/052006
https://www.proquest.com/docview/2568051641
https://doi.org/10.1088/1742-6596/1341/5/052006
UnpaywallVersion publishedVersion
Volume 1341
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVFSB
  databaseName: Free Full-Text Journals in Chemistry
  customDbUrl:
  eissn: 1742-6596
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0033337
  issn: 1742-6596
  databaseCode: HH5
  dateStart: 20040101
  isFulltext: true
  titleUrlDefault: http://abc-chemistry.org/
  providerName: ABC ChemistRy
– providerCode: PRVAFT
  databaseName: Open Access Digital Library
  customDbUrl:
  eissn: 1742-6596
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0033337
  issn: 1742-6596
  databaseCode: KQ8
  dateStart: 20040101
  isFulltext: true
  titleUrlDefault: http://grweb.coalliance.org/oadl/oadl.html
  providerName: Colorado Alliance of Research Libraries
– providerCode: PRVFQY
  databaseName: GFMER Free Medical Journals
  customDbUrl:
  eissn: 1742-6596
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0033337
  issn: 1742-6596
  databaseCode: GX1
  dateStart: 0
  isFulltext: true
  titleUrlDefault: http://www.gfmer.ch/Medical_journals/Free_medical.php
  providerName: Geneva Foundation for Medical Education and Research
– providerCode: PRVIOP
  databaseName: Institute of Physics Open Access Journal Titles
  customDbUrl:
  eissn: 1742-6596
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0033337
  issn: 1742-6596
  databaseCode: O3W
  dateStart: 20040101
  isFulltext: true
  titleUrlDefault: http://iopscience.iop.org/
  providerName: IOP Publishing
– providerCode: PRVIOP
  databaseName: IOP Science Platform
  customDbUrl:
  eissn: 1742-6596
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0033337
  issn: 1742-6596
  databaseCode: IOP
  dateStart: 20040601
  isFulltext: true
  titleUrlDefault: https://iopscience.iop.org/
  providerName: IOP Publishing
– providerCode: PRVPQU
  databaseName: ProQuest One Academic
  customDbUrl: http://www.proquest.com/pqcentral?accountid=15518
  eissn: 1742-6596
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0033337
  issn: 1742-6596
  databaseCode: BENPR
  dateStart: 20040801
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3fb9MwELbWTgheJn6KbmOyBI9YTe3EsR_QVKaVMYmuAirGU-TYzpjI0rB2Q_w9_KPcJc5GXxh9qNToHKW5y935cvd9hLySeepj7gomeGJY7LhlykaaOQgXJhbOJw5LAx-m8mgeH58mpxtk2s3CYFtl5xMbR-0WFmvkQwjNCgxIxqP9-gdD1ih8u9pRaJhAreDeNBBjPbLJERmrTzbfHk5nHzvfLOCTtiOSnEHsVV3HF2wDwzEth4hxNkyGDSKRXItXvfNFvZaK3r-qavPrpynLv6LS5CHZCukkHbf6f0Q2fPWY3GvaOu3yCfk9pmctrjS9hk0xjknRCouhoHnEM6atoVOMZY4uKooExfTSB0YFasozuAerbxcUclvaNB-y5ffzsgSZtuzPLCaYyDMBJwhlHQo7ZohgOOhOA2ENxXov7boXcTUyAzQ2_5TMJ4efD45YoGVgVnAlmXCRUzw3PPHaQ8ImFfgMC45ASadjBO9JjCiKnPNIKzeCHVnO08JHheBaiTwVz0i_WlT-OaFGSeO55bwwOnaiUDbVKrae69jjSO-AyO7mZzZgluNfKrPm3blSGWotQ61lqLUsyVqtDUh0s7BuYTvuXvIatJuFR3h5t_jLNfHj2cGndYmsdsWA7HbGcit6a8oDMroxoP-9zu1_n3KHPICcTrf9hrukv7q88i8gb1rle6SnJu_2wiMBv96fzOD7RHyBY_PpbPz1D_orE_8
linkProvider ProQuest
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LbxMxELb6ECoXxFMEClgCblhJbO-ufahQKa3SV1RBK_VmvLa3VCybpUmp-nv4H_w2Zna9LblQLs0xGluJZ8bz8Mx8hLxJ8yxI7gsmeGKZ9Nwx5QaaeTAXVgofEo-pgf1xOjqSO8fJ8QL53fXCYFlldyc2F7WfOMyR98E0KxCgVA7f1z8Yokbh62oHoWEjtIJfa0aMxcaO3XB5ASHcdG37I_D7Ledbm4cbIxZRBpgTXKVM-IFXPLc8CTqA_5EqUAEHcq1SryXOokmsKIqc84FWfggBRs6zIgwKwbUSeSZg30WyLIXUEPwtf9gcH3zqbIGAT9a2ZHIGtl51FWYQdsbvdNrHmWr9pN9MQErn7OPi6aSec31XzqvaXl7YsvzLCm7dJ_ei-0rXW3l7QBZC9ZDcacpI3fQR-bVOT9o51vQnBOHYlkUrTL6CpOH8ZNqeGEXb6emkogiITM9CRHCgtjyBM599_U7Bl6ZNsSObfjstS6BpnxmYQ4cWcS1gg5hGohChg8XExnoaAXIo5pdpVy2JqxGJoNGxx-ToVhj0hCxVkyo8JdSq1AbuOC-sll4UymVaSRe4lgFbiHsk7Q7fuDgjHf9SaZq3eqUMcs0g1wxyzSSm5VqPDK4W1u2YkJuXvAPumnhlTG8mfz1HvnOw8XmewtS-6JHVTliuSa9Vp0eGVwL0v7_z2b-3fEVWRof7e2Zve7z7nNwFf1K3tY6rZGl2dh5egM82y19GxaDky23r4h_yNEmS
linkToPdf http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3db9MwELe2IT5e-EYrDLAEj7hJ7cS1H6dBNQaMSjBpb5ZjO2Vallb9AMG_wz_KXZwUioQGok99uIvsnH33s3P3O0Key2IYMu5LJnhuWea5Y8qlmnkIFzYTPuQerwbeHcvDk-zoND_dIqN1Lcx01rr-PvyNRMHxFbYJcSoBDM2ZzLVMkIwsyZOGOkgmM19ukysNXQkW8r0fdx5ZwG8YCyNRUakuz-vPD9uIUtswkg0Aen1Vz-zXL7aqfolFo1tk0s0ipqCc91fLou--_Ubw-P_TvE1utnCV7ketO2Qr1HfJ1SZt1C3uke_7dBJ5q-lnOHRjGRat8bIVVhbyJdO4kSjGSk-nNcUGyHQe2o4N1FaT6fxs-emCAnamTXIjW5yfVRXIxM8KzCGAxT4W8ID22ojCiRwiJBbS07YhDsX7ZNplR6I2dh5o9tR9cjJ69fHgkLVtH5gTXEkmfOoVLyzPgw4ACKUCn-TA0SjpdYbkQLkVZVlwnmrlB3DiK_iwDGkpuFaiGIoHZKee1mGXUKukDdxxXlqdeVEqN9Qqc4HrLGDJcI_IzszGtZzoOKXKNN_mlTJoBYNWMGgFk5tohR5J14qzSAtyucoLMLVpXcTicvFnG-JH44MPmxIGVkKP7HXL8qcooFgFvlZmgx4ZrJfq347z4b-N8ym5Nn45Mm9fH795RG4AnNQx1XGP7Cznq_AYINuyeNLsxx-2RS6O
linkToUnpaywall http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3daxQxEB_aK6IvfounVQL6aHp72WwueTyKpRQsB3pQn5Zskq1Ht3vHfSj23-k_6sx-nN2CVH1dZkKWmcn8JpkPgPcqGwUpfM5jkVguvXBcu8hwj-7CytiHxNPVwKdTdTyVJ2fJ2Q4M2lqYzvs9BmcImAVXiVED6jw2SAZVnyC1C3v0MerB3vR0Mv5alz0SZTVpcsvVZnT9eaWOP9qdzRcdqHl_Uy7szx-2KG54naNHMGn3WyebXBxs1tmBu7rVyvEffugxPGwQKBvXKvMEdkL5FO5VmaBu9Qyux-y8bkXNvmMcTZVVrKT7U1QWaoHMattg5P48m5eMZhqzZWiGMDBbnM-Xs_W3S4ZwmFX5inx1MSsKpKlfCrgjTEqjKXCB5iaIYZCNTo9q41kz44bRFTFrEx6Jm4YJVGbyHKZHH78cHvNmkgN3sdCKxz7yWmRWJMEExHhK4zHj8OzQyhtJ_X4SG-d5JkRktB9iEJeJUR6iPBZGx9kofgG9cl6Gl8CsVjYIJ0RujfRxrt3IaOmCMDJQFXAfVCvP1DVtzumXirR6btc6JQmkJIGUJJAmaS2BPkRbxkXd6eNulg-oMGlj9au7yd91yE8mh5-7FOnC533Yb_XvNykCU43Hp5LDPgy3Ovm3-3z1Hzyv4QFiQ1PnLe5Db73chDeIv9bZ28bmfgGTGBzF
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+general+variable+neighborhood+search+based+on+path+relinking+algorithm+for+multi-skill+resource-constrained+project+scheduling+problem+with+multiple+restrictions&rft.jtitle=Journal+of+physics.+Conference+series&rft.au=Dai%2C+H&rft.au=Cheng%2C+W&rft.date=2019-10-01&rft.pub=IOP+Publishing&rft.issn=1742-6588&rft.eissn=1742-6596&rft.volume=1341&rft.issue=5&rft_id=info:doi/10.1088%2F1742-6596%2F1341%2F5%2F052006
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1742-6588&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1742-6588&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1742-6588&client=summon