Job shop scheduling with a combination of four buffering constraints

In this paper, a new scheduling problem is investigated in order to optimise a more generalised Job Shop Scheduling system with a Combination of four Buffering constraints (i.e. no-wait, no-buffer, limited-buffer and infinite-buffer) called CBJSS. In practice, the CBJSS is significant in modelling a...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of production research Ročník 56; číslo 9; s. 3274 - 3293
Hlavní autoři: Liu, Shi Qiang, Kozan, Erhan, Masoud, Mahmoud, Zhang, Yu, Chan, Felix T.S.
Médium: Journal Article
Jazyk:angličtina
Vydáno: London Taylor & Francis 03.05.2018
Taylor & Francis LLC
Témata:
Algorithms
best-insertion-heuristic algorithm
blocking
buffer management
Buffers
constructive algorithm
Gantt charts
Heuristic methods
Integer programming
Job shop scheduling
Job shops
Mixed integer
mixed integer programming
no-wait
Organic chemistry
Production scheduling
Scheduling
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 In this paper, a new scheduling problem is investigated in order to optimise a more generalised Job Shop Scheduling system with a Combination of four Buffering constraints (i.e. no-wait, no-buffer, limited-buffer and infinite-buffer) called CBJSS. In practice, the CBJSS is significant in modelling and analysing many real-world scheduling systems in chemical, food, manufacturing, railway, health care and aviation industries. Critical problem properties are thoroughly analysed in terms of the Gantt charts. Based on these properties, an applicable mixed integer programming model is formulated and an efficient heuristic algorithm is developed. Computational experiments show that the proposed heuristic algorithm is satisfactory for solving the CBJSS in real time.
AbstractList In this paper, a new scheduling problem is investigated in order to optimise a more generalised Job Shop Scheduling system with a Combination of four Buffering constraints (i.e. no-wait, no-buffer, limited-buffer and infinite-buffer) called CBJSS. In practice, the CBJSS is significant in modelling and analysing many real-world scheduling systems in chemical, food, manufacturing, railway, health care and aviation industries. Critical problem properties are thoroughly analysed in terms of the Gantt charts. Based on these properties, an applicable mixed integer programming model is formulated and an efficient heuristic algorithm is developed. Computational experiments show that the proposed heuristic algorithm is satisfactory for solving the CBJSS in real time.
Author Chan, Felix T.S.
Kozan, Erhan
Zhang, Yu
Masoud, Mahmoud
Liu, Shi Qiang
Author_xml – sequence: 1
  givenname: Shi Qiang
  surname: Liu
  fullname: Liu, Shi Qiang
  organization: School of Economics and Management, Fuzhou University
– sequence: 2
  givenname: Erhan
  orcidid: 0000-0002-3208-702X
  surname: Kozan
  fullname: Kozan, Erhan
  organization: School of Mathematical Sciences, Queensland University of Technology
– sequence: 3
  givenname: Mahmoud
  surname: Masoud
  fullname: Masoud, Mahmoud
  organization: School of Mathematical Sciences, Queensland University of Technology
– sequence: 4
  givenname: Yu
  surname: Zhang
  fullname: Zhang, Yu
  organization: Civil and Environmental Engineering, University of South Florida
– sequence: 5
  givenname: Felix T.S.
  surname: Chan
  fullname: Chan, Felix T.S.
  email: f.chan@polyu.edu.hk
  organization: Department of Industrial & Systems Engineering, Hong Kong Polytechnic University
BookMark eNqFkM1OwzAQhC1UJNrCIyBZ4pyyTuzYERdQ-VclLiBxsxwnpq5Su9iJqr49CS0XDrCXvXwzuzMTNHLe1QidE5gREHAJkAJnNJulQPiMUCAphSM0JlmeJ0yI9xEaD0wyQCdoEuMK-mGCjtHtsy9xXPoNjnpZV11j3Qfe2naJFdZ-XVqnWusd9gYb3wVcdsbUYYC0d7ENyro2nqJjo5pYnx32FL3d373OH5PFy8PT_GaR6IxDmwhS6kJnBaG8YJBnqUlrUXKlTCGMKJhQVUVJRZkSNc-rHFSuSg6K5VBSmuXZFF3sfTfBf3Z1bOWq_8n1J2UKDCinHERPsT2lg48x1EZugl2rsJME5FCY_ClMDoXJQ2G97uqXTtv2O_0Qs_lXfb1XW2d8WKutD00lW7VrfDBBOW2jzP62-AI8kYTS
CitedBy_id crossref_primary_10_1080_00207543_2023_2294114
crossref_primary_10_3390_mining2040043
crossref_primary_10_1080_00207543_2018_1521532
crossref_primary_10_1109_ACCESS_2021_3096263
crossref_primary_10_3390_app15179339
crossref_primary_10_1016_j_ejor_2024_08_010
crossref_primary_10_1080_00207543_2018_1524165
crossref_primary_10_1080_00207543_2020_1735667
crossref_primary_10_1016_j_suscom_2023_100901
crossref_primary_10_7736_JKSPE_022_100
crossref_primary_10_1080_00207543_2025_2503465
crossref_primary_10_1007_s12559_018_9595_4
crossref_primary_10_1109_TASE_2024_3421889
crossref_primary_10_3390_machines10100847
crossref_primary_10_1016_j_engappai_2021_104411
crossref_primary_10_3390_math7080688
crossref_primary_10_3390_su13147684
crossref_primary_10_3390_jmse11081517
crossref_primary_10_1080_00207543_2022_2112989
crossref_primary_10_1109_ACCESS_2020_3022655
crossref_primary_10_1007_s11081_022_09741_4
crossref_primary_10_1016_j_tre_2021_102273
crossref_primary_10_1080_02286203_2021_1931770
crossref_primary_10_1080_0305215X_2019_1577407
crossref_primary_10_3233_JIFS_191072
crossref_primary_10_1016_j_engappai_2025_110537
Cites_doi 10.1016/j.asoc.2014.08.028
10.1016/j.jclepro.2015.09.097
10.1080/00207543.2016.1177671
10.1080/23302674.2017.1344330
10.1287/trsc.1100.0332
10.1016/j.cor.2016.09.011
10.1007/s10732-014-9279-5
10.1080/00207540701528750
10.1016/j.cie.2016.06.002
10.1016/j.cor.2014.08.006
10.1016/j.ejor.2006.03.059
10.1016/j.ijpe.2008.11.007
10.1007/s00291-005-0008-1
10.1016/S0377-2217(01)00338-1
10.1016/S0377-2217(02)00834-2
10.1080/17480930.2016.1160818
10.1007/s10696-010-9069-9
10.1142/S0217595904000072
10.1108/IMDS-09-2016-0358
10.1007/s10845-017-1350-2
10.1016/j.cie.2015.02.011
10.1080/00207543.2011.645953
10.1016/j.cor.2010.11.008
10.1016/j.dam.2009.02.020
10.1080/00207543.2016.1174344
10.1016/j.omega.2005.07.004
10.1080/00207540210136478
10.4236/jilsa.2011.33018
10.1016/j.cie.2017.08.031
10.1016/j.trb.2009.02.005
10.1016/j.omega.2017.05.010
10.1016/j.trc.2007.07.006
10.1016/j.ejor.2005.12.025
10.1016/j.cor.2005.09.004
10.1016/0305-0483(83)90088-9
10.1016/j.dss.2012.08.012
10.1080/00207543.2014.957870
10.1016/j.cor.2008.12.012
10.1057/jors.2011.4
10.1109/TASE.2017.2749429
10.1109/TASE.2004.829440
10.1016/S0360-8352(97)00325-2
10.1016/j.advengsoft.2004.10.002
10.1080/00207543.2016.1268730
10.1016/S0925-5273(03)00065-3
10.4236/jtts.2016.62008
10.1016/j.omega.2016.04.003
10.1007/s10479-007-0276-z
10.1016/S0167-6377(03)00005-1
10.1007/s10479-012-1197-z
10.1007/s10951-017-0526-0
10.1016/j.ejor.2006.10.034
10.1016/j.eswa.2011.01.078
10.1016/S0019-0578(07)60039-1
10.1007/s10878-009-9278-x
10.1023/A:1012260622596
10.1007/s11590-016-1041-5
10.1016/j.tre.2016.07.015
10.1080/00207543.2015.1120899
10.1080/00207541003733775
10.1080/00207549008942855
10.1007/s00170-012-4169-1
10.1080/00207543.2011.565813
10.1016/j.ejor.2008.12.005
10.1016/j.ejor.2007.01.062
10.1080/00207543.2015.1076941
10.1016/j.trc.2016.12.010
10.1057/jors.1990.166
10.1287/mnsc.35.2.164
10.5120/ijca2016912158
10.1080/00207543.2012.711968
10.1017/CBO9781107415324.004
10.1007/s10696-011-9092-5
10.1007/s10878-014-9723-3
10.1016/j.ijpe.2011.07.008
10.1287/opre.44.3.510
10.1179/1743286315Y.0000000031
10.7232/iems.2012.11.1.094
ContentType Journal Article
Copyright 2017 Informa UK Limited, trading as Taylor & Francis Group 2017
2017 Informa UK Limited, trading as Taylor & Francis Group
Copyright_xml – notice: 2017 Informa UK Limited, trading as Taylor & Francis Group 2017
– notice: 2017 Informa UK Limited, trading as Taylor & Francis Group
DBID AAYXX
CITATION
7SC
8FD
F28
FR3
JQ2
L7M
L~C
L~D
DOI 10.1080/00207543.2017.1401240
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
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
EISSN 1366-588X
EndPage 3293
ExternalDocumentID 10_1080_00207543_2017_1401240
1401240
Genre Article
GrantInformation_xml – fundername: National Natural Science Foundation of China
  grantid: 71531003; 71571032; 71572156
  funderid: 10.13039/501100001809
– fundername: Australian Government's Cooperative Research Centres Programme
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
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
ID FETCH-LOGICAL-c370t-81bc9c39147950632f2e8b7aaf98f8958add41d45a8e76d60a6ab70a560b44363
IEDL.DBID TFW
ISICitedReferencesCount 33
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000434401700015&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 Wed Aug 13 11:17:57 EDT 2025
Tue Nov 18 21:50:53 EST 2025
Sat Nov 29 05:36:14 EST 2025
Mon Oct 20 23:49:48 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 9
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c370t-81bc9c39147950632f2e8b7aaf98f8958add41d45a8e76d60a6ab70a560b44363
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-3208-702X
PQID 2050474708
PQPubID 30924
PageCount 20
ParticipantIDs crossref_primary_10_1080_00207543_2017_1401240
crossref_citationtrail_10_1080_00207543_2017_1401240
proquest_journals_2050474708
informaworld_taylorfrancis_310_1080_00207543_2017_1401240
PublicationCentury 2000
PublicationDate 2018-05-03
PublicationDateYYYYMMDD 2018-05-03
PublicationDate_xml – month: 05
  year: 2018
  text: 2018-05-03
  day: 03
PublicationDecade 2010
PublicationPlace London
PublicationPlace_xml – name: London
PublicationTitle International journal of production research
PublicationYear 2018
Publisher Taylor & Francis
Taylor & Francis LLC
Publisher_xml – name: Taylor & Francis
– name: Taylor & Francis LLC
References CIT0072
CIT0071
CIT0030
CIT0074
CIT0073
CIT0032
CIT0076
CIT0031
CIT0075
CIT0034
CIT0078
CIT0033
CIT0077
CIT0070
CIT0036
CIT0035
CIT0079
CIT0038
CIT0037
CIT0039
CIT0082
CIT0041
CIT0040
CIT0043
CIT0042
CIT0001
CIT0045
CIT0044
Gholami O. (CIT0024) 2013; 2
CIT0081
CIT0080
CIT0003
CIT0047
CIT0002
CIT0046
CIT0005
CIT0049
CIT0004
CIT0048
CIT0007
CIT0006
CIT0008
CIT0050
CIT0052
CIT0051
CIT0010
CIT0054
CIT0053
CIT0012
CIT0056
CIT0011
CIT0055
CIT0014
CIT0058
CIT0013
CIT0057
CIT0016
CIT0015
CIT0059
CIT0018
CIT0017
Fisher H. (CIT0022) 1963
CIT0019
CIT0061
CIT0060
CIT0063
CIT0062
CIT0021
CIT0065
CIT0020
CIT0064
CIT0023
CIT0067
CIT0066
CIT0025
CIT0069
CIT0068
CIT0027
CIT0026
CIT0029
Burdett R. (CIT0009) 2017
CIT0028
References_xml – ident: CIT0078
  doi: 10.1016/j.asoc.2014.08.028
– ident: CIT0080
  doi: 10.1016/j.jclepro.2015.09.097
– ident: CIT0030
  doi: 10.1080/00207543.2016.1177671
– ident: CIT0044
  doi: 10.1080/23302674.2017.1344330
– ident: CIT0040
  doi: 10.1287/trsc.1100.0332
– ident: CIT0043
  doi: 10.1016/j.cor.2016.09.011
– ident: CIT0062
  doi: 10.1007/s10732-014-9279-5
– ident: CIT0063
  doi: 10.1080/00207540701528750
– ident: CIT0054
  doi: 10.1016/j.cie.2016.06.002
– ident: CIT0060
  doi: 10.1016/j.cor.2014.08.006
– ident: CIT0061
  doi: 10.1016/j.ejor.2006.03.059
– ident: CIT0037
  doi: 10.1016/j.ijpe.2008.11.007
– ident: CIT0004
  doi: 10.1007/s00291-005-0008-1
– ident: CIT0050
  doi: 10.1016/S0377-2217(01)00338-1
– ident: CIT0006
– ident: CIT0021
  doi: 10.1016/S0377-2217(02)00834-2
– ident: CIT0034
  doi: 10.1080/17480930.2016.1160818
– ident: CIT0039
  doi: 10.1007/s10696-010-9069-9
– ident: CIT0046
  doi: 10.1142/S0217595904000072
– ident: CIT0020
  doi: 10.1108/IMDS-09-2016-0358
– ident: CIT0081
  doi: 10.1007/s10845-017-1350-2
– ident: CIT0001
  doi: 10.1016/j.cie.2015.02.011
– ident: CIT0077
  doi: 10.1080/00207543.2011.645953
– ident: CIT0014
  doi: 10.1016/j.cor.2010.11.008
– ident: CIT0027
  doi: 10.1016/j.dam.2009.02.020
– ident: CIT0066
  doi: 10.1080/00207543.2016.1174344
– ident: CIT0025
  doi: 10.1016/j.omega.2005.07.004
– ident: CIT0059
  doi: 10.1080/00207540210136478
– ident: CIT0070
  doi: 10.4236/jilsa.2011.33018
– ident: CIT0002
  doi: 10.1016/j.cie.2017.08.031
– ident: CIT0007
  doi: 10.1016/j.trb.2009.02.005
– ident: CIT0065
  doi: 10.1016/j.omega.2017.05.010
– ident: CIT0017
  doi: 10.1016/j.trc.2007.07.006
– ident: CIT0026
  doi: 10.1016/j.ejor.2005.12.025
– ident: CIT0075
  doi: 10.1016/j.cor.2005.09.004
– ident: CIT0058
  doi: 10.1016/0305-0483(83)90088-9
– ident: CIT0032
  doi: 10.1016/j.dss.2012.08.012
– ident: CIT0053
  doi: 10.1080/00207543.2014.957870
– ident: CIT0038
  doi: 10.1016/j.cor.2008.12.012
– ident: CIT0041
  doi: 10.1057/jors.2011.4
– ident: CIT0076
  doi: 10.1109/TASE.2017.2749429
– ident: CIT0073
  doi: 10.1109/TASE.2004.829440
– start-page: 225
  year: 1963
  ident: CIT0022
  publication-title: Industrial Scheduling
– ident: CIT0072
  doi: 10.1016/S0360-8352(97)00325-2
– ident: CIT0047
  doi: 10.1016/j.advengsoft.2004.10.002
– ident: CIT0082
  doi: 10.1080/00207543.2016.1268730
– ident: CIT0064
  doi: 10.1016/S0925-5273(03)00065-3
– ident: CIT0051
  doi: 10.4236/jtts.2016.62008
– ident: CIT0067
  doi: 10.1016/j.omega.2016.04.003
– ident: CIT0005
  doi: 10.1007/s10479-007-0276-z
– ident: CIT0071
  doi: 10.1016/S0167-6377(03)00005-1
– ident: CIT0074
  doi: 10.1007/s10479-012-1197-z
– ident: CIT0035
  doi: 10.1007/s10951-017-0526-0
– ident: CIT0016
  doi: 10.1016/j.ejor.2006.10.034
– ident: CIT0012
  doi: 10.1016/j.eswa.2011.01.078
– ident: CIT0031
  doi: 10.1016/S0019-0578(07)60039-1
– ident: CIT0028
  doi: 10.1007/s10878-009-9278-x
– ident: CIT0057
  doi: 10.1023/A:1012260622596
– ident: CIT0055
  doi: 10.1007/s11590-016-1041-5
– ident: CIT0079
  doi: 10.1016/j.tre.2016.07.015
– ident: CIT0049
  doi: 10.1080/00207543.2015.1120899
– ident: CIT0056
  doi: 10.1080/00207541003733775
– ident: CIT0036
  doi: 10.1080/00207549008942855
– ident: CIT0069
  doi: 10.1007/s00170-012-4169-1
– ident: CIT0023
  doi: 10.1080/00207543.2011.565813
– ident: CIT0008
  doi: 10.1016/j.ejor.2008.12.005
– ident: CIT0015
  doi: 10.1016/j.ejor.2007.01.062
– ident: CIT0019
  doi: 10.1080/00207543.2015.1076941
– ident: CIT0068
  doi: 10.1016/j.trc.2016.12.010
– ident: CIT0003
  doi: 10.1057/jors.1990.166
– ident: CIT0011
  doi: 10.1287/mnsc.35.2.164
– ident: CIT0048
  doi: 10.5120/ijca2016912158
– ident: CIT0018
  doi: 10.1080/00207543.2012.711968
– ident: CIT0045
  doi: 10.1017/CBO9781107415324.004
– ident: CIT0052
  doi: 10.1007/s10696-011-9092-5
– ident: CIT0010
  doi: 10.1007/s10878-014-9723-3
– ident: CIT0013
  doi: 10.1016/j.ijpe.2011.07.008
– ident: CIT0029
  doi: 10.1287/opre.44.3.510
– year: 2017
  ident: CIT0009
  publication-title: European Journal of Operational Research
– ident: CIT0033
  doi: 10.1179/1743286315Y.0000000031
– volume: 2
  start-page: 19
  year: 2013
  ident: CIT0024
  publication-title: International Journal of Operational Research
– ident: CIT0042
  doi: 10.7232/iems.2012.11.1.094
SSID ssj0000584
Score 2.3845193
Snippet In this paper, a new scheduling problem is investigated in order to optimise a more generalised Job Shop Scheduling system with a Combination of four Buffering...
SourceID proquest
crossref
informaworld
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 3274
SubjectTerms Algorithms
best-insertion-heuristic algorithm
blocking
buffer management
Buffers
constructive algorithm
Gantt charts
Heuristic methods
Integer programming
Job shop scheduling
Job shops
Mixed integer
mixed integer programming
no-wait
Organic chemistry
Production scheduling
Scheduling
Title Job shop scheduling with a combination of four buffering constraints
URI https://www.tandfonline.com/doi/abs/10.1080/00207543.2017.1401240
https://www.proquest.com/docview/2050474708
Volume 56
WOSCitedRecordID wos000434401700015&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/eLvHCXMwrV3PS8MwFA4yPOjB3-J0Sg5eO5omaZKjqEM8DA8TdytJ2qAg61g7_35f2nRuiHjQYyEvDe8l73svvHwPoWtJpVaOsIjniY2YsiwynOiIxnmuJSGWO9c0mxDjsZxO1VOoJqxCWaXPoV1LFNH4an-4tam6ijj_ghuAjlFfmCWGPkMAWAIvDNDvj-Zk9PLli7kMPMxx5EW6Nzw_zbKBThvcpd98dQNAo_1_WPoB2gvRJ75pt8sh2ipmR2h3jZPwGN09lgZXr-UcQ94LOOSfq2N_W4s1hn9BIt3YEpcOO5gOm6XvsOIHWR9q-o4TdXWCnkf3k9uHKLRaiCwVcR1B8GqVpYowoThELYlLCmmE1k5JJxWX4AYZyRnXshBpnsY61UbEGuIlwxhN6SnqzcpZcYawMTYXBKAxlwVzVEktISZmzlijaZHoPmKdijMbeMj94t4zsqIrbZWUeSVlQUl9NFyJzVsijt8E1Lr9srq5AXFtu5KM_iI76IydhTNdwQAeM8i-Ynn-h6kv0A58yqZmkg5Qr14si0u0bT_qt2px1ezeT9uz6MA
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LT8MwDI5gIAEH3ojBgBy4dmqXpE2OCJgGjJ2G2K1K0kYgoW3aOn4_dh9jE0I7wLlxGjmJPzuyPxNyLZnUygXcE0nLelxZ7hkRaI_5SaJlEFjhXN5sIur15GCgFmthMK0SY2hXEEXkthovNz5GVylxWMINSMcZZmZFTQwRAJfWyYYArEX-_H779dsaC1kyMfseylRVPL9Ns4RPS-ylP6x1DkHtvf9Y_D7ZLR1QelOcmAOylg4Pyc4CLeERuXscGTp9G40phL4ARVixTvHBlmoKP4NYOt9OOnLUwXTUzLDJCg6y6G1i04lsekxe2vf9245XdlvwLIv8zAP_1SrLVMAjJcBxablWKk2ktVPSSSUkWEIeJFxomUZhEvo61CbyNbhMhnMWshNSG46G6SmhxtgkCgAdE5lyx5TUEtxi7ow1mqUtXSe80nFsSypyXNxHHMwZSwslxaikuFRSnTTnYuOCi2OVgFrcwDjLH0Fc0bEkZitkG9Vux-W1nsIA4XMIwHx59oepr8hWp__cjbsPvadzsg2fZJ5CyRqklk1m6QXZtJ_Z-3RymR_lL69X7Oo
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LT8MwDI5gIAQH3ojBgBy4dmqbpE2OiFHx0rTDELtVSdoIJLROa8fvx-ljbEJoBzg3TiM7sT9HzmeErjnhUhiPOizxtUOFpo5innSImySSe55mxpTNJsJ-n49GYlBXE-Z1WaXNoU1FFFH6anu4J4lpKuLsC24IdJTYwqywazMECEvraAOgc2A3-TB6_XbGjNdEzK5jZZpHPL9NsxSelshLfzjrMgJFe_-w9n20W8NPfFPtlwO0lo4P0c4CKeER6j1mCudv2QRD4guByL5Xx_a6FksM_4JMujQmzgw2MB1WM9tixQ7SFmvalhNFfoxeorvh7b1T91pwNAndwgH0qoUmwqOhYABbfOOnXIVSGsENF4yDH6ReQpnkaRgkgSsDqUJXAmBSlJKAnKDWOBunpwgrpZPQg9iY8JQaIrjkAIqpUVpJkvqyjWij4ljXROR2cR-xN-crrZQUWyXFtZLaqDsXm1RMHKsExKL94qK8AjFVv5KYrJDtNMaO60OdwwDmUki_XH72h6mv0NagF8XPD_2nc7QNX3hZP0k6qFVMZ-kF2tSfxXs-vSw38hfn4-uc
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=Job+shop+scheduling+with+a+combination+of+four+buffering+constraints&rft.jtitle=International+journal+of+production+research&rft.au=Liu%2C+Shi+Qiang&rft.au=Kozan%2C+Erhan&rft.au=Masoud%2C+Mahmoud&rft.au=Zhang%2C+Yu&rft.date=2018-05-03&rft.pub=Taylor+%26+Francis&rft.issn=0020-7543&rft.eissn=1366-588X&rft.volume=56&rft.issue=9&rft.spage=3274&rft.epage=3293&rft_id=info:doi/10.1080%2F00207543.2017.1401240&rft.externalDocID=1401240
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