Exact and Hybrid Metaheuristic Algorithms to Solve Bi-Objective Permutation Flow Shop Scheduling Problem

In this paper, we consider 2-machine permutation flow shop scheduling problem with bi-objective of minimizing the makespan ( C max ) and maximum tardiness ( T max ). The aim is to minimize the two objective functions lexicographicaly, which is minimize maximum tardiness subject to that the makespan...

Full description

Saved in:
Bibliographic Details
Published inJournal of physics. Conference series Vol. 1818; no. 1; p. 12042
Main Author Motair, Hafed M.
Format Journal Article
LanguageEnglish
Published Bristol IOP Publishing 01.03.2021
Subjects
Algorithms
Heuristic methods
Job shop scheduling
Job shops
Mathematical analysis
Permutations
Physics
Simulated annealing
Online AccessGet full text

Cover

Abstract In this paper, we consider 2-machine permutation flow shop scheduling problem with bi-objective of minimizing the makespan ( C max ) and maximum tardiness ( T max ). The aim is to minimize the two objective functions lexicographicaly, which is minimize maximum tardiness subject to that the makespan is optimal. We introduce a Branch and bound algorithm with two dominance conditions to find the optimal solution of the problem for job sequence with up to 14 jobs. For moderate and large sized problems we apply a simulated annealing algorithm to develop a metaheuristic algorithme based on the first level branch and bound and variable neighborhood search. To compare with the original algorithm, numerical experiments provided, the rusults shows the efficiency of the dominance conditions also the efficiency of proposed modification of the original metaheuristic algorithm.
AbstractList In this paper, we consider 2-machine permutation flow shop scheduling problem with bi-objective of minimizing the makespan ( C max ) and maximum tardiness ( T max ). The aim is to minimize the two objective functions lexicographicaly, which is minimize maximum tardiness subject to that the makespan is optimal. We introduce a Branch and bound algorithm with two dominance conditions to find the optimal solution of the problem for job sequence with up to 14 jobs. For moderate and large sized problems we apply a simulated annealing algorithm to develop a metaheuristic algorithme based on the first level branch and bound and variable neighborhood search. To compare with the original algorithm, numerical experiments provided, the rusults shows the efficiency of the dominance conditions also the efficiency of proposed modification of the original metaheuristic algorithm.
In this paper, we consider 2-machine permutation flow shop scheduling problem with bi-objective of minimizing the makespan (C max ) and maximum tardiness (T max ). The aim is to minimize the two objective functions lexicographicaly, which is minimize maximum tardiness subject to that the makespan is optimal. We introduce a Branch and bound algorithm with two dominance conditions to find the optimal solution of the problem for job sequence with up to 14 jobs. For moderate and large sized problems we apply a simulated annealing algorithm to develop a metaheuristic algorithme based on the first level branch and bound and variable neighborhood search. To compare with the original algorithm, numerical experiments provided, the rusults shows the efficiency of the dominance conditions also the efficiency of proposed modification of the original metaheuristic algorithm.
Author Motair, Hafed M.
Author_xml – sequence: 1
  givenname: Hafed M.
  surname: Motair
  fullname: Motair, Hafed M.
BookMark eNqFkE1PwzAMhiM0JLbBbyAS57Ik_cyBw5g2hjS0SYNz5KbpmqltRpoC-_e0KuLABV_sV_Zry88EjWpTK4RuKbmnJElmNA6YF4U8mtGEdnJGKCMBu0Dj387ot06SKzRpmiMhfhfxGBXLL5AOQ53h9Tm1OsMvykGhWqsbpyWelwdjtSuqBjuD96b8UPhRe9v0qKTTndgpW7UOnDY1XpXmE-8Lc8J7WaisLXV9wDtr0lJV1-gyh7JRNz95it5Wy9fF2ttsn54X840nGY-ZR1UIgeI8p3GUsijuahnRJExSSCHnkcp9oMwPQoAs4xmkObAwBz8gnBEg4E_R3bD3ZM17qxonjqa1dXdSsJAyHjFG4m4qHqakNU1jVS5OVldgz4IS0WMVPTDRwxM9VkHFgLVzPvxxSj287yzo8l__N8jsgKU
CitedBy_id crossref_primary_10_1051_ro_2022191
crossref_primary_10_3390_math10071200
crossref_primary_10_3390_sym15071409
crossref_primary_10_3389_fieng_2025_1540022
Cites_doi 10.1007/s00170-003-1731-x
10.1016/j.ijpe.2009.07.003
10.1023/B:HEUR.0000045320.79875.e3
10.1109/TEM.2016.2645790
10.1016/S0377-2217(03)00192-9
10.1016/j.ejor.2006.06.010
10.1080/00207160701331376
10.1109/TEVC.2003.810752
10.1080/002077201300029746
10.1023/A:1008935027685
10.1016/j.swevo.2016.06.002
10.1016/j.omega.2013.07.004
10.1016/S0305-0548(00)00061-7
10.1016/j.jclepro.2017.01.011
10.1002/1520-6750(199012)37:6<981::AID-NAV3220370617>3.0.CO;2-H
10.1057/jors.1992.126
10.1016/j.parco.2006.01.003
10.1002/nav.3800010110
10.1007/s00170-010-3100-x
10.1080/00207540500446394
ContentType Journal Article
Copyright 2021. 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: 2021. 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 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
DOI 10.1088/1742-6596/1818/1/012042
DatabaseName CrossRef
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Central
Technology Collection
ProQuest One Community College
ProQuest Central Korea
Aerospace Database
SciTech Premium Collection
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
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: 8FG
  name: ProQuest Technology Collection
  url: https://search.proquest.com/technologycollection1
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Physics
EISSN 1742-6596
ExternalDocumentID 10_1088_1742_6596_1818_1_012042
Genre Conference Proceeding
GroupedDBID 1JI
29L
2WC
4.4
5B3
5GY
5PX
5VS
7.Q
AAJIO
AAJKP
AAYXX
ABHWH
ACAFW
ACHIP
AEFHF
AEJGL
AFKRA
AFYNE
AIYBF
AKPSB
ALMA_UNASSIGNED_HOLDINGS
ARAPS
ASPBG
ATQHT
AVWKF
AZFZN
BENPR
BGLVJ
CCPQU
CEBXE
CITATION
CJUJL
CRLBU
CS3
DU5
E3Z
EBS
EDWGO
EQZZN
F5P
FRP
GX1
HCIFZ
HH5
IJHAN
IOP
IZVLO
J9A
KQ8
LAP
N5L
N9A
O3W
OK1
OVT
P2P
PHGZM
PHGZT
PIMPY
PJBAE
RIN
RNS
RO9
ROL
SY9
T37
TR2
W28
XSB
~02
8FD
8FE
8FG
ABUWG
AZQEC
DWQXO
H8D
L7M
P62
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
ID FETCH-LOGICAL-c2972-1e5a4e99f176b2674e9c61858babaf96ef3a12345aadd9dabfa25fa340920a0a3
IEDL.DBID BENPR
ISSN 1742-6588
IngestDate Fri Jul 25 04:16:52 EDT 2025
Tue Jul 01 00:39:33 EDT 2025
Thu Apr 24 22:58:36 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c2972-1e5a4e99f176b2674e9c61858babaf96ef3a12345aadd9dabfa25fa340920a0a3
Notes ObjectType-Conference Proceeding-1
SourceType-Scholarly Journals-1
content type line 14
OpenAccessLink https://www.proquest.com/docview/2512962207?pq-origsite=%requestingapplication%
PQID 2512962207
PQPubID 4998668
ParticipantIDs proquest_journals_2512962207
crossref_primary_10_1088_1742_6596_1818_1_012042
crossref_citationtrail_10_1088_1742_6596_1818_1_012042
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 20210301
PublicationDateYYYYMMDD 2021-03-01
PublicationDate_xml – month: 03
  year: 2021
  text: 20210301
  day: 01
PublicationDecade 2020
PublicationPlace Bristol
PublicationPlace_xml – name: Bristol
PublicationTitle Journal of physics. Conference series
PublicationYear 2021
Publisher IOP Publishing
Publisher_xml – name: IOP Publishing
References Mesgarpour (JPCS_1818_1_012042bib13) 2010
Suresh (JPCS_1818_1_012042bib12) 2004; 2
Ponnambalam (JPCS_1818_1_012042bib21) 2004; 23
Lee (JPCS_1818_1_012042bib6) 2001; 32
Li (JPCS_1818_1_012042bib25) 2017; 64
T’kindt (JPCS_1818_1_012042bib26) 1999; 6
Abdul–Razaq (JPCS_1818_1_012042bib28) 2018; 5
Geiger (JPCS_1818_1_012042bib16) 2007; 181
Deng (JPCS_1818_1_012042bib24) 2017; 32
Shahul Hamid Khan (JPCS_1818_1_012042bib17) 2007; 84
Ishibuchi (JPCS_1818_1_012042bib20) 2003; 7
Johnson (JPCS_1818_1_012042bib2) 1954; 1
T’Kindt (JPCS_1818_1_012042bib7) 2001
Yenisey (JPCS_1818_1_012042bib27) 2014; 45
Cavalieri (JPCS_1818_1_012042bib19) 1998; 9
Lin (JPCS_1818_1_012042bib9) 2006; 44
Arroyo (JPCS_1818_1_012042bib18) 2011; 55
Melab (JPCS_1818_1_012042bib22) 2006; 32
Khan (JPCS_1818_1_012042bib14) 2011; 3
Talbi (JPCS_1818_1_012042bib11) 2009; 74
Gupta (JPCS_1818_1_012042bib29) 2002; 29
Toktaş (JPCS_1818_1_012042bib8) 2004; 157
Lu (JPCS_1818_1_012042bib23) 2017; 144
Daniels (JPCS_1818_1_012042bib4) 1990; 37
Pinedo (JPCS_1818_1_012042bib3) 2012; 5
Rajendran (JPCS_1818_1_012042bib5) 1993; 43
Framiñán (JPCS_1818_1_012042bib1) 2014
Armentano (JPCS_1818_1_012042bib15) 2004; 10
Moslehi (JPCS_1818_1_012042bib10) 2009; 122
References_xml – volume: 2
  start-page: 712
  year: 2004
  ident: JPCS_1818_1_012042bib12
  article-title: Pareto archived simulated annealing for permutation flow shop scheduling with multiple objectives
– volume: 23
  start-page: 909
  year: 2004
  ident: JPCS_1818_1_012042bib21
  article-title: A TSP-GA multi-objective algorithm for flow-shop scheduling
  publication-title: Int. J. Adv. Manuf. Technol.
  doi: 10.1007/s00170-003-1731-x
– start-page: 166
  year: 2010
  ident: JPCS_1818_1_012042bib13
  article-title: Bicriteria scheduling problem on the two-machine flowshop using simulated annealing
– volume: 122
  start-page: 763
  year: 2009
  ident: JPCS_1818_1_012042bib10
  article-title: Two-machine flow shop scheduling to minimize the sum of maximum earliness and tardiness
  publication-title: Int. J. Prod. Econ.
  doi: 10.1016/j.ijpe.2009.07.003
– volume: 10
  start-page: 463
  year: 2004
  ident: JPCS_1818_1_012042bib15
  article-title: An application of a multi-objective tabu search algorithm to a bicriteria flowshop problem
  publication-title: J. Heuristics
  doi: 10.1023/B:HEUR.0000045320.79875.e3
– volume: 64
  start-page: 149
  year: 2017
  ident: JPCS_1818_1_012042bib25
  article-title: Multiobjective discrete artificial bee colony algorithm for multiobjective permutation flow shop scheduling problem with sequence dependent setup times
  publication-title: IEEE Trans. Eng. Manag.
  doi: 10.1109/TEM.2016.2645790
– volume: 157
  start-page: 286
  year: 2004
  ident: JPCS_1818_1_012042bib8
  article-title: Two-machine flow shop scheduling with two criteria: Maximum earliness and makespan
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/S0377-2217(03)00192-9
– volume: 181
  start-page: 195
  year: 2007
  ident: JPCS_1818_1_012042bib16
  article-title: On operators and search space topology in multi-objective flow shop scheduling
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2006.06.010
– volume: 84
  start-page: 1731
  year: 2007
  ident: JPCS_1818_1_012042bib17
  article-title: A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
  publication-title: Int. J. Comput. Math.
  doi: 10.1080/00207160701331376
– volume: 7
  start-page: 204
  year: 2003
  ident: JPCS_1818_1_012042bib20
  article-title: Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling
  publication-title: IEEE Trans. Evol. Comput.
  doi: 10.1109/TEVC.2003.810752
– volume: 3
  start-page: 88
  year: 2011
  ident: JPCS_1818_1_012042bib14
  article-title: A multi-objective simulated annealing algorithm for permutation flow shop scheduling problem
  publication-title: Int. J. Adv. Oper. Manag.
– volume: 32
  start-page: 365
  year: 2001
  ident: JPCS_1818_1_012042bib6
  article-title: Minimizing the total flow time and the tardiness in a two-machine flow shop
  publication-title: Int. J. Syst. Sci.
  doi: 10.1080/002077201300029746
– volume: 9
  start-page: 361
  year: 1998
  ident: JPCS_1818_1_012042bib19
  article-title: Hybrid genetic algorithmsfor a multiple-objective scheduling problem
  publication-title: J. Intell. Manuf.
  doi: 10.1023/A:1008935027685
– start-page: 51
  year: 2014
  ident: JPCS_1818_1_012042bib1
  article-title: Manufacturing scheduling systems, an integrated view on models
– volume: 5
  year: 2012
  ident: JPCS_1818_1_012042bib3
– volume: 32
  start-page: 121
  year: 2017
  ident: JPCS_1818_1_012042bib24
  article-title: A competitive memetic algorithm for multi-objective distributed permutation flow shop scheduling problem
  publication-title: Swarm Evol. Comput.
  doi: 10.1016/j.swevo.2016.06.002
– volume: 45
  start-page: 119
  year: 2014
  ident: JPCS_1818_1_012042bib27
  article-title: Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends
  publication-title: Omega
  doi: 10.1016/j.omega.2013.07.004
– volume: 29
  start-page: 123
  year: 2002
  ident: JPCS_1818_1_012042bib29
  article-title: Local search heuristics for two-stage flow shop problems with secondary criterion
  publication-title: Comput. Oper. Res.
  doi: 10.1016/S0305-0548(00)00061-7
– volume: 6
  start-page: 463
  year: 1999
  ident: JPCS_1818_1_012042bib26
  article-title: Some guidelines to solve multicriteria scheduling problems
– volume: 74
  year: 2009
  ident: JPCS_1818_1_012042bib11
– volume: 144
  start-page: 228
  year: 2017
  ident: JPCS_1818_1_012042bib23
  article-title: Energy-efficient permutation flow shop scheduling problem using a hybrid multi-objective backtracking search algorithm
  publication-title: J. Clean. Prod.
  doi: 10.1016/j.jclepro.2017.01.011
– volume: 37
  start-page: 981
  year: 1990
  ident: JPCS_1818_1_012042bib4
  article-title: Multiobjective flow-shop scheduling
  publication-title: Nav. Res. Logist.
  doi: 10.1002/1520-6750(199012)37:6<981::AID-NAV3220370617>3.0.CO;2-H
– volume: 43
  start-page: 871
  year: 1993
  ident: JPCS_1818_1_012042bib5
  article-title: Two-stage flowshop scheduling problem with bicriteria
  publication-title: J. Oper. Res. Soc.
  doi: 10.1057/jors.1992.126
– volume: 5
  year: 2018
  ident: JPCS_1818_1_012042bib28
  article-title: On the Two Machine Permutation Flowshop Scheduling Problems Using Variable Neighborhood Search Algorithms
  publication-title: Almuthanna J. Pure Sci.
– volume: 32
  start-page: 643
  year: 2006
  ident: JPCS_1818_1_012042bib22
  article-title: Parallel cooperative meta-heuristics on the computational grid.: A case study: the bi-objective flow-shop problem
  publication-title: Parallel Comput.
  doi: 10.1016/j.parco.2006.01.003
– year: 2001
  ident: JPCS_1818_1_012042bib7
  article-title: A branch-and-bound algorithm to solve a two-machine bicriteria flowshop scheduling problem
– volume: 1
  start-page: 61
  year: 1954
  ident: JPCS_1818_1_012042bib2
  article-title: Optimal two-and three-stage production schedules with setup times included
  publication-title: Nav. Res. Logist. Q.
  doi: 10.1002/nav.3800010110
– volume: 55
  start-page: 741
  year: 2011
  ident: JPCS_1818_1_012042bib18
  article-title: A GRASP heuristic for the multi-objective permutation flowshop scheduling problem
  publication-title: Int. J. Adv. Manuf. Technol.
  doi: 10.1007/s00170-010-3100-x
– volume: 44
  start-page: 2299
  year: 2006
  ident: JPCS_1818_1_012042bib9
  article-title: Bicriteria scheduling in a two-machine permutation flowshop
  publication-title: Int. J. Prod. Res.
  doi: 10.1080/00207540500446394
SSID ssj0033337
Score 2.2664328
Snippet In this paper, we consider 2-machine permutation flow shop scheduling problem with bi-objective of minimizing the makespan ( C max ) and maximum tardiness ( T...
In this paper, we consider 2-machine permutation flow shop scheduling problem with bi-objective of minimizing the makespan (C max ) and maximum tardiness (T...
SourceID proquest
crossref
SourceType Aggregation Database
Enrichment Source
Index Database
StartPage 12042
SubjectTerms Algorithms
Heuristic methods
Job shop scheduling
Job shops
Mathematical analysis
Permutations
Physics
Simulated annealing
Title Exact and Hybrid Metaheuristic Algorithms to Solve Bi-Objective Permutation Flow Shop Scheduling Problem
URI https://www.proquest.com/docview/2512962207
Volume 1818
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwhV07T8MwELagCIkF8RTlJQ-sVhM7cewJAWqpkICKgsRmOY5DQaUpNOXx7zknDogFMiWOPOTO-b47-x4IHUkd5VEeUxJyKUgENgdJbagJ0zrQBrzm2LoE58sr3r-LLu7je7_hNvNhlQ0mVkCdFcbtkXccD0tOaZAcT1-I6xrlTld9C41FtAQQLEQLLZ12rwY3DRYzuJI6JZIS4FrRRHiB2-fHJO8AycFjx6WRRvQ3P_2G54pzemto1RuL-KTW7jpasJMNtFwFbZrZJhp1P7QpsZ5kuP_pMq_wpS31yM7r6sv4ZPwAX1COnme4LPCwGL9ZfPpIrtOnGuXwAGB5Xp_F4964eMfDUTHFQ9Bj5gLUH_Cgbjezhe563duzPvGdE4ihMgHB21hHVso8THhKeQL3hgMzi1SnOpfc5kwDZUWxBniTmU5zTeNcM3D2aABKYtuoNSkmdseFPoUmDlwVuBQ8RybAXgmklTZh1LAoY23EG3kp48uKu-4WY1UdbwuhnKCVE7RyglahqgXdRsH3xGldWeP_KfuNQpT_1WbqZ2Hs_v16D61QF5BSBZDto1b5OrcHYFGU6SFaFL3zQ794vgCk_cYN
linkProvider ProQuest
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELbaoqpcEJQiCi340B6tTWzHiQ8ItaXL9rGl0rZSb8ZxnC5o2SxsltI_1d_ITJyAeoFTc8pDiZLxeL6Z-JsZQna0laUsE85ipTMmwedguY8tE9ZG1kHUnHhMcB6eqcGlPL5KrpbIXZcLg7TKziY2hrqoHP4j7yEOa8V5lL6ffWfYNQpXV7sWGkEtTvztDYRs83dHH2B8dznvH14cDFjbVYA5rlN4KZ9Y6bUu41TlXKWw7xSgVpbb3JZa-VJYMOcysTD1dWHz0vKktAICIR7BBwh47jJ5JAUgOWam9z92ll_AloYETM4A2bOOTwZBZntOqx5AKhz2MGlV8vtoeB8MGoTrPyVPWteU7gVdekaW_HSdrDYUUTd_TsaHv6yrqZ0WdHCLeV506Gs79otQ65nuTa5BXvX425zWFR1Vk5-e7n9hn_KvwabScwCBRVj5p_1JdUNH42pGR6A1BdLhr-l5aG6zQS4fRKIvyMq0mvqXSLSKXRJhzbkc4lSRgXcUaa99KrgTshCbRHXyMq4tYo69NCamWUzPMoOCNihog4I2sQmC3iTRnxtnoY7H_2_Z6gbEtBN7bv6q4at_X35L1gYXw1NzenR28po85kiFaahrW2Sl_rHw2-DL1PmbRoEo-fzQGvsbBzwBbA
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=Exact+and+Hybrid+Metaheuristic+Algorithms+to+Solve+Bi-Objective+Permutation+Flow+Shop+Scheduling+Problem&rft.jtitle=Journal+of+physics.+Conference+series&rft.au=Motair%2C+Hafed+M&rft.date=2021-03-01&rft.pub=IOP+Publishing&rft.issn=1742-6588&rft.eissn=1742-6596&rft.volume=1818&rft.issue=1&rft_id=info:doi/10.1088%2F1742-6596%2F1818%2F1%2F012042
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