Service-oriented robust parallel machine scheduling

Stochastic scheduling optimisation is a hot and challenging research topic with wide applications. Most existing works on stochastic parallel machine scheduling address uncertain processing time, and assume that its probability distribution is known or can be correctly estimated. This paper investig...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of production research Ročník 57; číslo 12; s. 3814 - 3830
Hlavní autoři: Liu, Ming, Liu, Xin, Chu, Feng, Zheng, Feifeng, Chu, Chengbin
Médium: Journal Article
Jazyk:angličtina
Vydáno: London Taylor & Francis 18.06.2019
Taylor & Francis LLC
Témata:
ISSN:0020-7543, 1366-588X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract Stochastic scheduling optimisation is a hot and challenging research topic with wide applications. Most existing works on stochastic parallel machine scheduling address uncertain processing time, and assume that its probability distribution is known or can be correctly estimated. This paper investigates a stochastic parallel machine scheduling problem, and assumes that only the mean and covariance matrix of the processing times are known, due to the lack of historical data. The objective is to maximise the service level, which measures the probability of all jobs jointly completed before or at their due dates. For the problem, a new distributionally robust formulation is proposed, and two model-based approaches are developed: (1) a sample average approximation method is adapted, (2) a hierarchical approach based on mixed integer second-order cone programming (MI-SOCP) formulation is designed. To evaluate and compare the performance of the two approaches, randomly generated instances are tested. Computational results show that our proposed MI-SOCP-based hierarchical approach can obtain higher solution quality with less computational effect.
AbstractList Stochastic scheduling optimisation is a hot and challenging research topic with wide applications. Most existing works on stochastic parallel machine scheduling address uncertain processing time, and assume that its probability distribution is known or can be correctly estimated. This paper investigates a stochastic parallel machine scheduling problem, and assumes that only the mean and covariance matrix of the processing times are known, due to the lack of historical data. The objective is to maximise the service level, which measures the probability of all jobs jointly completed before or at their due dates. For the problem, a new distributionally robust formulation is proposed, and two model-based approaches are developed: (1) a sample average approximation method is adapted, (2) a hierarchical approach based on mixed integer second-order cone programming (MI-SOCP) formulation is designed. To evaluate and compare the performance of the two approaches, randomly generated instances are tested. Computational results show that our proposed MI-SOCP-based hierarchical approach can obtain higher solution quality with less computational effect.
Author Chu, Feng
Liu, Ming
Liu, Xin
Chu, Chengbin
Zheng, Feifeng
Author_xml – sequence: 1
  givenname: Ming
  surname: Liu
  fullname: Liu, Ming
  organization: School of Economics & Management, Tongji University
– sequence: 2
  givenname: Xin
  surname: Liu
  fullname: Liu, Xin
  organization: School of Economics & Management, Tongji University
– sequence: 3
  givenname: Feng
  surname: Chu
  fullname: Chu, Feng
  email: feng.chu@univ-evry.fr
  organization: IBISC, Univ Évry, University of Paris-Saclay
– sequence: 4
  givenname: Feifeng
  surname: Zheng
  fullname: Zheng, Feifeng
  organization: Glorious Sun School of Business & Management, Donghua University
– sequence: 5
  givenname: Chengbin
  surname: Chu
  fullname: Chu, Chengbin
  organization: Laboratoire Génie Industriel, Centrale Supélec, Université Paris-Saclay
BackLink https://hal.science/hal-01851270$$DView record in HAL
BookMark eNqFkE9LAzEQxYNUsK1-BKHgycPW_Nm0u3ixiFqh4EEFb2GandiUNKnJttJv7y6tHjzoXAaG33sz83qk44NHQs4ZHTJa0CtKOR3LXAw5ZcWQ5eVYMHZEukyMRpksircO6bZM1kInpJfSkjYli7xLxDPGrdWYhWjR11gNYphvUj1YQwTn0A1WoBfW4yDpBVYbZ_37KTk24BKeHXqfvN7fvdxOs9nTw-PtZJbpnJd1liPTKApeaGl4KZCW0kiJBoFVzVUC-QhKyct8LnNt8mrMKAMGhot5BboC0SeXe98FOLWOdgVxpwJYNZ3MVDtr3pWMj-mWNezFnl3H8LHBVKtl2ETfnKc4l1w0y5loKLmndAwpRTQ_toyqNkv1naVqs1SHLBvd9S-dtjXUNvg6gnX_qm_2autNiCv4DNFVqoadC9FE8NomJf62-ALAOI1f
CitedBy_id crossref_primary_10_1016_j_ejor_2022_07_018
crossref_primary_10_1080_00207543_2023_2252937
crossref_primary_10_1080_00207543_2025_2513575
crossref_primary_10_1016_j_ifacol_2022_10_101
crossref_primary_10_1016_j_asoc_2022_109719
crossref_primary_10_1109_TASE_2023_3246223
crossref_primary_10_1016_j_ifacol_2019_11_240
crossref_primary_10_1080_00207543_2022_2053602
crossref_primary_10_1016_j_cor_2020_105017
crossref_primary_10_1080_00207543_2023_2228922
crossref_primary_10_1177_18479790241301164
crossref_primary_10_1080_00207543_2020_1730998
crossref_primary_10_1016_j_cor_2024_106776
crossref_primary_10_1080_00207543_2022_2130589
crossref_primary_10_1080_00207543_2020_1711982
crossref_primary_10_1016_j_omega_2023_102896
crossref_primary_10_1016_j_ifacol_2019_11_518
crossref_primary_10_1016_j_cor_2024_106642
crossref_primary_10_1016_j_ejor_2021_11_023
crossref_primary_10_1016_j_ifacol_2019_11_519
crossref_primary_10_1080_00207543_2020_1812752
crossref_primary_10_1080_00207543_2023_2217279
crossref_primary_10_3390_pr11020371
Cites_doi 10.1287/opre.1090.0741
10.1007/BF02096604
10.1016/j.apm.2017.01.039
10.1016/j.ins.2003.05.012
10.1137/050622328
10.1007/s10107-011-0494-7
10.1007/s11067-014-9236-8
10.1080/00207543.2012.751510
10.1057/palgrave.jors.2601063
10.1016/j.ejor.2013.09.036
10.1080/00207543.2015.1033501
10.1007/s11067-011-9157-8
10.1016/j.ejor.2004.04.002
10.1287/moor.1110.0506
10.1007/s10107-015-0929-7
10.1007/s10107-015-0942-x
10.1016/j.orl.2017.01.010
10.1080/00207543.2014.887865
10.1016/j.ejor.2006.03.028
10.1016/j.ins.2013.10.023
10.1016/j.ejor.2006.05.036
10.1016/j.ejor.2015.06.081
10.1016/j.orl.2007.07.003
10.1016/j.orl.2012.01.002
10.1287/mnsc.1120.1641
10.1287/opre.1090.0712
10.1007/s10957-009-9523-6
10.1016/j.ejor.2009.10.025
10.1287/mnsc.15.1.102
10.1080/00207543.2014.930535
10.1016/j.ins.2011.04.010
10.1080/00207540601042472
10.1016/j.ijpe.2003.07.003
10.1007/s10107-017-1174-z
10.1080/00207543.2015.1108535
10.1016/j.jmsy.2013.03.004
10.1090/S0002-9939-1953-0055639-3
10.1016/S0167-6377(02)00110-4
10.1007/s10107-002-0339-5
10.1515/9781400831050
10.1016/j.omega.2008.01.001
10.1080/00207543.2018.1463473
10.1007/s10898-004-5702-z
10.1016/j.omega.2014.12.007
10.1023/A:1021814225969
10.1137/050640308
10.1016/j.orl.2008.05.003
10.1007/978-1-4614-0237-4
10.1080/00207543.2018.1466063
ContentType Journal Article
Copyright 2018 Informa UK Limited, trading as Taylor & Francis Group 2018
2018 Informa UK Limited, trading as Taylor & Francis Group
Distributed under a Creative Commons Attribution 4.0 International License
Copyright_xml – notice: 2018 Informa UK Limited, trading as Taylor & Francis Group 2018
– notice: 2018 Informa UK Limited, trading as Taylor & Francis Group
– notice: Distributed under a Creative Commons Attribution 4.0 International License
DBID AAYXX
CITATION
7SC
8FD
F28
FR3
JQ2
L7M
L~C
L~D
1XC
DOI 10.1080/00207543.2018.1497311
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ANTE: Abstracts in New Technology & Engineering
Engineering Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
Hyper Article en Ligne (HAL)
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Engineering Research Database
Advanced Technologies Database with Aerospace
ANTE: Abstracts in New Technology & Engineering
Computer and Information Systems Abstracts Professional
DatabaseTitleList

Technology Research Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EISSN 1366-588X
EndPage 3830
ExternalDocumentID oai:HAL:hal-01851270v1
10_1080_00207543_2018_1497311
1497311
Genre Article
GrantInformation_xml – fundername: Fundamental Research Funds for the Central Universities
– fundername: National Natural Science Foundation of China
  grantid: 71531011; 71428002; 71771048; 71571134
  funderid: 10.13039/501100001809
GroupedDBID -~X
.7F
.QJ
0BK
0R~
29J
2DF
30N
4.4
5GY
5VS
8VB
A8Z
AAENE
AAGDL
AAHIA
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
ABCCY
ABFIM
ABHAV
ABJNI
ABLIJ
ABPAQ
ABPEM
ABTAI
ABXUL
ABXYU
ACGEJ
ACGFO
ACGFS
ACGOD
ACIWK
ACNCT
ACTIO
ADCVX
ADGTB
ADXPE
AEGXH
AEISY
AEMOZ
AENEX
AEOZL
AEPSL
AEYOC
AFKVX
AFRVT
AGDLA
AGMYJ
AHDZW
AHQJS
AIAGR
AIJEM
AIYEW
AJWEG
AKBVH
AKOOK
AKVCP
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AQRUH
AQTUD
AVBZW
AWYRJ
BLEHA
CCCUG
CE4
CS3
DGEBU
DKSSO
DU5
EBD
EBE
EBO
EBR
EBS
EBU
EJD
EMK
EPL
ESTFP
E~A
E~B
GTTXZ
H13
HF~
HZ~
H~9
H~P
I-F
IPNFZ
J.P
K1G
KYCEM
LJTGL
M4Z
ML~
NA5
NX~
O9-
P2P
PQQKQ
QWB
RIG
RNANH
ROSJB
RTWRZ
S-T
SNACF
TASJS
TBQAZ
TDBHL
TEN
TFL
TFT
TFW
TH9
TN5
TNC
TTHFI
TUROJ
TWF
UT5
UU3
ZGOLN
ZL0
~S~
AAYXX
CITATION
7SC
8FD
F28
FR3
JQ2
L7M
L~C
L~D
07I
1OL
1TA
1XC
4B5
ABDPE
ABRLO
ACKIV
ACTTO
ADUMR
ADXEU
AEHZU
AEZBV
AFBWG
AFFNX
AFION
AGBKS
AGBLW
AGVKY
AGWUF
AGYFW
AI.
AKHJE
AKMBP
ALRRR
ALXIB
BGSSV
BWMZZ
C0-
C5H
CAG
COF
CYRSC
DAOYK
DEXXA
FETWF
IFELN
L8C
NUSFT
OPCYK
RNS
TAJZE
TAP
UB6
VH1
ZCG
ZY4
ID FETCH-LOGICAL-c429t-4e1ce3828c5f293e095f55efea1d5883e26a95294b54cf4d7101a1af23bdacda3
IEDL.DBID TFW
ISICitedReferencesCount 31
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000474250800003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0020-7543
IngestDate Tue Oct 14 19:53:42 EDT 2025
Wed Aug 13 11:15:40 EDT 2025
Sat Nov 29 05:36:15 EST 2025
Tue Nov 18 22:11:35 EST 2025
Mon Oct 20 23:49:33 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 12
Keywords Service level
Scheduling
Ambiguous processing time
Stochastic optimisation
Distributionally robust
Language English
License Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c429t-4e1ce3828c5f293e095f55efea1d5883e26a95294b54cf4d7101a1af23bdacda3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-1603-4163
0000-0002-1837-4380
0000-0003-3190-5008
0000-0003-3256-2940
0000-0003-1225-8319
PQID 2252309513
PQPubID 30924
PageCount 17
ParticipantIDs crossref_citationtrail_10_1080_00207543_2018_1497311
crossref_primary_10_1080_00207543_2018_1497311
informaworld_taylorfrancis_310_1080_00207543_2018_1497311
proquest_journals_2252309513
hal_primary_oai_HAL_hal_01851270v1
PublicationCentury 2000
PublicationDate 2019-06-18
PublicationDateYYYYMMDD 2019-06-18
PublicationDate_xml – month: 06
  year: 2019
  text: 2019-06-18
  day: 18
PublicationDecade 2010
PublicationPlace London
PublicationPlace_xml – name: London
PublicationTitle International journal of production research
PublicationYear 2019
Publisher Taylor & Francis
Taylor & Francis LLC
Publisher_xml – name: Taylor & Francis
– name: Taylor & Francis LLC
References CIT0030
CIT0032
CIT0031
CIT0033
CIT0036
CIT0035
Calafiore G. C. (CIT0011) 2006; 58
CIT0038
CIT0037
CIT0039
CIT0040
CIT0043
CIT0042
CIT0001
CIT0045
CIT0044
Thoft-Christensen P. (CIT0041) 2012
CIT0003
CIT0047
CIT0002
CIT0046
CIT0005
CIT0049
CIT0004
CIT0048
CIT0007
CIT0006
CIT0009
CIT0008
CIT0050
CIT0052
CIT0010
CIT0054
CIT0053
CIT0012
Gupta D. (CIT0019) 2012; 3
CIT0014
CIT0013
CIT0016
CIT0015
Pinedo M. (CIT0034) 1992
CIT0018
CIT0017
CIT0021
CIT0020
CIT0023
CIT0022
CIT0025
CIT0024
CIT0027
CIT0026
CIT0029
CIT0028
References_xml – ident: CIT0015
  doi: 10.1287/opre.1090.0741
– ident: CIT0017
  doi: 10.1007/BF02096604
– ident: CIT0002
  doi: 10.1016/j.apm.2017.01.039
– ident: CIT0032
  doi: 10.1016/j.ins.2003.05.012
– ident: CIT0030
  doi: 10.1137/050622328
– volume: 3
  start-page: 1020
  issue: 2
  year: 2012
  ident: CIT0019
  publication-title: Advances in Applied Science Research
– ident: CIT0054
  doi: 10.1007/s10107-011-0494-7
– ident: CIT0040
  doi: 10.1007/s11067-014-9236-8
– ident: CIT0047
  doi: 10.1080/00207543.2012.751510
– ident: CIT0035
  doi: 10.1057/palgrave.jors.2601063
– ident: CIT0018
  doi: 10.1016/j.ejor.2013.09.036
– ident: CIT0027
  doi: 10.1080/00207543.2015.1033501
– volume-title: Application of Structural Systems Reliability Theory
  year: 2012
  ident: CIT0041
– ident: CIT0014
  doi: 10.1007/s11067-011-9157-8
– ident: CIT0020
  doi: 10.1016/j.ejor.2004.04.002
– ident: CIT0037
  doi: 10.1287/moor.1110.0506
– ident: CIT0023
  doi: 10.1007/s10107-015-0929-7
– ident: CIT0004
  doi: 10.1007/s10107-015-0942-x
– ident: CIT0052
  doi: 10.1016/j.orl.2017.01.010
– ident: CIT0048
  doi: 10.1080/00207543.2014.887865
– ident: CIT0038
  doi: 10.1016/j.ejor.2006.03.028
– ident: CIT0049
  doi: 10.1016/j.ins.2013.10.023
– ident: CIT0039
  doi: 10.1016/j.ejor.2006.05.036
– ident: CIT0028
  doi: 10.1016/j.ejor.2015.06.081
– ident: CIT0044
  doi: 10.1016/j.orl.2007.07.003
– volume-title: Scheduling: Theory, Algorithms and Systems Development
  year: 1992
  ident: CIT0034
– ident: CIT0009
  doi: 10.1016/j.orl.2012.01.002
– ident: CIT0006
  doi: 10.1287/mnsc.1120.1641
– ident: CIT0013
  doi: 10.1287/opre.1090.0712
– ident: CIT0031
  doi: 10.1007/s10957-009-9523-6
– volume: 58
  start-page: 470
  issue: 2
  year: 2006
  ident: CIT0011
  publication-title: Operation Research
– ident: CIT0021
  doi: 10.1016/j.ejor.2009.10.025
– ident: CIT0029
  doi: 10.1287/mnsc.15.1.102
– ident: CIT0046
  doi: 10.1080/00207543.2014.930535
– ident: CIT0003
  doi: 10.1016/j.ins.2011.04.010
– ident: CIT0033
  doi: 10.1080/00207540601042472
– ident: CIT0025
  doi: 10.1016/j.ijpe.2003.07.003
– ident: CIT0007
  doi: 10.1007/s10107-017-1174-z
– ident: CIT0026
  doi: 10.1080/00207543.2015.1108535
– ident: CIT0036
  doi: 10.1016/j.jmsy.2013.03.004
– ident: CIT0024
  doi: 10.1090/S0002-9939-1953-0055639-3
– ident: CIT0022
  doi: 10.1016/S0167-6377(02)00110-4
– ident: CIT0001
  doi: 10.1007/s10107-002-0339-5
– ident: CIT0005
  doi: 10.1515/9781400831050
– ident: CIT0012
  doi: 10.1016/j.omega.2008.01.001
– ident: CIT0050
  doi: 10.1080/00207543.2018.1463473
– ident: CIT0010
  doi: 10.1007/s10898-004-5702-z
– ident: CIT0016
  doi: 10.1016/j.omega.2014.12.007
– ident: CIT0043
  doi: 10.1023/A:1021814225969
– ident: CIT0042
  doi: 10.1137/050640308
– ident: CIT0045
  doi: 10.1016/j.orl.2008.05.003
– ident: CIT0008
  doi: 10.1007/978-1-4614-0237-4
– ident: CIT0053
  doi: 10.1080/00207543.2018.1466063
SSID ssj0000584
Score 2.4123173
Snippet Stochastic scheduling optimisation is a hot and challenging research topic with wide applications. Most existing works on stochastic parallel machine...
SourceID hal
proquest
crossref
informaworld
SourceType Open Access Repository
Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 3814
SubjectTerms ambiguous processing time
Computation
Computer Science
Covariance matrix
distributionally robust
Job shops
Mixed integer
Operations Research
Optimization
Probability theory
Production scheduling
Scheduling
service level
stochastic optimisation
Title Service-oriented robust parallel machine scheduling
URI https://www.tandfonline.com/doi/abs/10.1080/00207543.2018.1497311
https://www.proquest.com/docview/2252309513
https://hal.science/hal-01851270
Volume 57
WOSCitedRecordID wos000474250800003&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: PRVAWR
  databaseName: Taylor & Francis Online Journals
  customDbUrl:
  eissn: 1366-588X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000584
  issn: 0020-7543
  databaseCode: TFW
  dateStart: 19610101
  isFulltext: true
  titleUrlDefault: https://www.tandfonline.com
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LT8MwDI4AcYADb8RjoApxDSJNsqZHhJg4oInDENyiNHUE0tjQWvb7sdtsDCHEAY6t4lR1Yn9263xm7Dz3YCB1kquiiwlKMJo74wueghe6QIwTmW-aTWT9vnl6yu9jNWEVyyophw4tUUTjq8m4XVHNKuLoBDcCnZJUmGXQ1Kn7EiVACP1kmoPe46cv1ibyMF9yEpmd4flpli_otPzc1EYuMph-89gNDPU2_-EFtthGjEGTq3bTbLMlGO2w9QVmwl0mow_hY-JBxqg0mYyL96pOiCp8OIRh8tpUYUKC2TGiFR1q32MPvZvB9S2P_RW4RxSquQLhQWLK5XVA1AeMtoLWEMCJUhsjIe26XKe5KrTyQZUYjAgnXEhlUTpfOrnPVkbjERywJA1KmDLk3VQQO43LQQBFclnmoMx1dsjUTK_WR_Jx6oExtGLOUdrqxJJObNTJIbuYi7217Bu_CZzhos3HEnf27dWdpXs4StNv9ikOyhfX1NbNt5HQNjKx8pcHdGYbwEZrryz6RMzkMFaVR3-Y-pit4SVxQnBhOmylnrzDCVv10_qlmpw2-_oDvBTv0w
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LT8MwDI54ScCBN-JNhbgGkaZZ0yNCTEOMnYbYLUpTRyCVDW1lvx-77cYQQjvAtU1S1Un82Yn9mbHLxIGG0EoepQ10ULxW3GqX8hCcUClinIhdWWwi7nR0r5fM5sJQWCX50L4iiih1NW1uOoyehMRRCjciXSQpMkvjXqfyS-gBLSvEWuLP7zafv7Sx0jUT8zWnPpMsnt-G-YZPiy9ldOQsh-kPnV0CUXPzP35hi23UZmhwU62bbbYA_R22PkNOuMtkrUb4gKiQ0TANhoP0Y1QExBae55AHb2UgJgToICNgUV77Hntq3nVvW7wuscAdAlHBIxAOJHpdTnkEfkCDyysFHqzIlNYSwoZNVJhEqYqcjzK0R4QV1ocyzazLrNxnS_1BHw5YEPpI6MwnjVAQQY1NQAAZc3FsIUtUfMiiiWCNq_nHqQxGbsSUprSSiSGZmFomh-xq2u29IuCY1-ECZ23aluizWzdtQ8-wlaKb9jE2SmYn1RTl8YivapkYOecDJ5MVYOoNPzKoFtGZQ3NVHv1h6HO22uo-tk37vvNwzNbwFVFEcKFP2FIx_IBTtuLGxetoeFYu8k8DTfP9
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LT8MwDI54CcGBN2I8K8Q1iDTNmh4RMIFAEwcQ3KI0dQTS2Kat7Pdjt9kYQogDXNs4VR3H_tw6nxk7yRxoiK3kSd7EBMVrxa12OY_BCZVjjBOpq5pNpO22fn7O7kM14TCUVVIO7WuiiMpX0-buF35cEUcnuDHQJZIKszRudeq-hAnQPELnJhn5Q-vp0xkrHYiYzzjJjA_x_DTNl_A0-1IVR05TmH5z2VUcaq3-wxussZUAQqPz2mrW2Qx0N9jyFDXhJpPBifAeESEjLI0Gvfx9WEbEFd7pQCd6q8owIcL0GMMVnWrfYo-tq4eLax4aLHCHYajkCQgHEnMupzyGfUC45ZUCD1YUSmsJcdNmKs6SXCXOJwWiEWGF9bHMC-sKK7fZXLfXhR0WxT4RuvBZMxZET2MzEEBQLk0tFJlKGywZ69W4wD5OTTA6RkxISmudGNKJCTppsNOJWL-m3_hN4BgXbTKWyLOvz-8MXcNRiv6zj3BQNr2mpqw-jvi6k4mRvzxgf2wAJmz3oUGniKkcglW5-4epj9ji_WXL3N20b_fYEt4hfggu9D6bKwfvcMAW3Kh8HQ4OKxP_AB2x8q8
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=Service-oriented+robust+parallel+machine+scheduling&rft.jtitle=International+journal+of+production+research&rft.au=Liu%2C+Ming&rft.au=Liu%2C+Xin&rft.au=Chu%2C+Feng&rft.au=Zheng%2C+Feifeng&rft.date=2019-06-18&rft.pub=Taylor+%26+Francis+LLC&rft.issn=0020-7543&rft.eissn=1366-588X&rft.volume=57&rft.issue=12&rft.spage=3814&rft_id=info:doi/10.1080%2F00207543.2018.1497311&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-7543&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-7543&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-7543&client=summon