A PTAS for non-resumable open shop scheduling with an availability constraint

Shop scheduling problem is one of the most classical problems in combinatorial optimization. In this paper, we study two-machine open shop scheduling problem, provided that one machine is subject to maintenance period which has to be performed in a fixed time interval. The target is to minimize the...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of combinatorial optimization Jg. 43; H. 2; S. 350 - 362
Hauptverfasser: Yuan, Yuan, Lan, Yan, Ding, Ning, Han, Xin
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Springer US 01.03.2022
Springer Nature B.V
Schlagworte:
Combinatorial analysis
Combinatorics
Convex and Discrete Geometry
Job shops
Maintenance
Mathematical Modeling and Industrial Mathematics
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Polynomials
Scheduling
Theory of Computation
Open shop scheduling
Machine non-availability
Polynomial time approximation scheme
Approximation algorithm
ISSN:1382-6905, 1573-2886
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract Shop scheduling problem is one of the most classical problems in combinatorial optimization. In this paper, we study two-machine open shop scheduling problem, provided that one machine is subject to maintenance period which has to be performed in a fixed time interval. The target is to minimize the makespan. This paper considers non-resumable scenario, i.e., if a job which starts before the maintenance period cannot be completed before the maintenance period, then it must be restarted after the interval from scratch. We only discuss the case that the maintenance period is performed on the first machine, while the case of the maintenance period on the second machine is symmetric. We obtain a polynomial time approximation scheme, which is better than the best previous result 4 3 .
AbstractList Shop scheduling problem is one of the most classical problems in combinatorial optimization. In this paper, we study two-machine open shop scheduling problem, provided that one machine is subject to maintenance period which has to be performed in a fixed time interval. The target is to minimize the makespan. This paper considers non-resumable scenario, i.e., if a job which starts before the maintenance period cannot be completed before the maintenance period, then it must be restarted after the interval from scratch. We only discuss the case that the maintenance period is performed on the first machine, while the case of the maintenance period on the second machine is symmetric. We obtain a polynomial time approximation scheme, which is better than the best previous result 4 3 .
Shop scheduling problem is one of the most classical problems in combinatorial optimization. In this paper, we study two-machine open shop scheduling problem, provided that one machine is subject to maintenance period which has to be performed in a fixed time interval. The target is to minimize the makespan. This paper considers non-resumable scenario, i.e., if a job which starts before the maintenance period cannot be completed before the maintenance period, then it must be restarted after the interval from scratch. We only discuss the case that the maintenance period is performed on the first machine, while the case of the maintenance period on the second machine is symmetric. We obtain a polynomial time approximation scheme, which is better than the best previous result 43.
Author Ding, Ning
Yuan, Yuan
Han, Xin
Lan, Yan
Author_xml – sequence: 1
  givenname: Yuan
  orcidid: 0000-0001-5403-6576
  surname: Yuan
  fullname: Yuan, Yuan
  email: yuanyuan12430@126.com
  organization: School of Software Technology, Dalian University of Technology
– sequence: 2
  givenname: Yan
  surname: Lan
  fullname: Lan, Yan
  organization: School of Information and Communication Engineering, Dalian Minzu University
– sequence: 3
  givenname: Ning
  surname: Ding
  fullname: Ding, Ning
– sequence: 4
  givenname: Xin
  surname: Han
  fullname: Han, Xin
  organization: School of Software Technology, Dalian University of Technology
BookMark eNp9kEtLAzEUhYNUsK3-AVcB16N5zOSxLMUXVBTsPmTSTJsyTWoyo_TfmzqC4KJkkXPJ_c69ORMw8sFbAK4xusUI8buEkeCiQAQXueS04GdgjKssiBBslDUVpGASVRdgktIWIZR1OQYvM_i2nL3DJkSYPYtoU7_TdWth2FsP0ybsYTIbu-pb59fwy3UbqD3Un9q1unat6w7QBJ-6qJ3vLsF5o9tkr37vKVg-3C_nT8Xi9fF5PlsUhmLZFZrwfGptK0kE0oLVxDAhjaZS0lJXpLRYrvKjwbWsCGOVZtIIzrlFctXQKbgZbPcxfPQ2dWob-ujzREUYLStRCcRyFxm6TAwpRduofXQ7HQ8KI3VMTQ2pqZya-klN8QyJf5Bxne5c8McftqdROqApz_FrG_-2OkF9Aw8Pgk0
CitedBy_id crossref_primary_10_1016_j_engappai_2024_108572
crossref_primary_10_1142_S0217595923400195
crossref_primary_10_1007_s10878_025_01271_w
crossref_primary_10_1016_j_jmsy_2025_06_001
crossref_primary_10_1109_TSMC_2024_3376292
Cites_doi 10.1007/s10288-009-0102-3
10.1007/BF00121681
10.1016/j.ejor.2018.04.019
10.1002/nav.3800010110
10.1016/S0167-6377(96)00041-7
10.1002/nav.20122
10.1016/S0167-6377(00)00033-X
10.1007/s11590-011-0281-7
10.1016/S0377-2217(97)00452-9
10.1016/S0377-2217(01)00083-2
10.1023/A:1018964131329
10.1016/j.cor.2007.10.013
10.1016/0377-2217(93)90250-Q
10.1145/321978.321985
10.1016/j.ipl.2004.03.004
10.1287/ijoc.5.3.321
10.1051/ro:2002008
10.1007/s10852-013-9245-5
10.1016/j.cor.2005.01.004
10.1057/palgrave.jors.2601421
10.1007/s001860200267
10.1016/S0167-6377(01)00079-7
10.1287/moor.18.1.12
10.1002/nav.10107
10.1007/978-94-009-7801-0_9
10.1016/B978-0-444-87358-3.50012-2
ContentType Journal Article
Copyright The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021
The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021.
Copyright_xml – notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021
– notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021.
DBID AAYXX
CITATION
DOI 10.1007/s10878-021-00773-7
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList

DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Mathematics
EISSN 1573-2886
EndPage 362
ExternalDocumentID 10_1007_s10878_021_00773_7
GrantInformation_xml – fundername: National Natural Science Foundation of China
  grantid: 11971091; 11701062
  funderid: http://dx.doi.org/10.13039/501100001809
GroupedDBID -5D
-5G
-BR
-EM
-Y2
-~C
.86
.DC
.VR
06D
0R~
0VY
1N0
1SB
203
29K
2J2
2JN
2JY
2KG
2KM
2LR
2P1
2VQ
2~H
30V
4.4
406
408
409
40D
40E
5GY
5VS
67Z
6NX
8TC
8UJ
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYOK
AAYQN
AAYTO
AAYZH
ABAKF
ABBBX
ABBXA
ABDZT
ABECU
ABFTD
ABFTV
ABHLI
ABHQN
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACHSB
ACHXU
ACIWK
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACZOJ
ADHHG
ADHIR
ADINQ
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AFBBN
AFGCZ
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGGDS
AGJBK
AGMZJ
AGQEE
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHSBF
AHYZX
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJBLW
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARMRJ
ASPBG
AVWKF
AXYYD
AYJHY
AZFZN
B-.
BA0
BAPOH
BDATZ
BGNMA
BSONS
CAG
COF
CS3
CSCUP
D-I
DDRTE
DL5
DNIVK
DPUIP
DU5
EBLON
EBS
EIOEI
EJD
ESBYG
F5P
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNWQR
GQ6
GQ7
GQ8
GXS
H13
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
I09
IHE
IJ-
IKXTQ
IWAJR
IXC
IXD
IXE
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
J9A
JBSCW
JCJTX
JZLTJ
KDC
KOV
LAK
LLZTM
M4Y
MA-
N2Q
NB0
NPVJJ
NQJWS
NU0
O9-
O93
O9J
OAM
OVD
P2P
P9R
PF0
PT4
PT5
QOS
R89
R9I
RNI
RNS
ROL
RPX
RSV
RZC
RZE
RZK
S16
S1Z
S27
S3B
SAP
SDH
SHX
SISQX
SJYHP
SMT
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
TEORI
TSG
TSK
TSV
TUC
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
W23
W48
WK8
YLTOR
Z45
Z7X
Z83
Z88
ZMTXR
AAPKM
AAYXX
ABBRH
ABDBE
ABFSG
ABJCF
ABRTQ
ACSTC
ADHKG
AEZWR
AFDZB
AFFHD
AFHIU
AFKRA
AFOHR
AGQPQ
AHPBZ
AHWEU
AIXLP
ARAPS
ATHPR
AYFIA
AZQEC
BENPR
BGLVJ
CCPQU
CITATION
DWQXO
GNUQQ
HCIFZ
M2P
M7S
PHGZM
PHGZT
PQGLB
PTHSS
ID FETCH-LOGICAL-c319t-a27272bae59280a86b2c689ca39934a524e19d592c1b952665a69c8777e09df3
IEDL.DBID RSV
ISICitedReferencesCount 8
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000669166100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1382-6905
IngestDate Thu Sep 18 00:02:03 EDT 2025
Sat Nov 29 04:54:38 EST 2025
Tue Nov 18 21:26:10 EST 2025
Fri Feb 21 02:47:33 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 2
Keywords Open shop scheduling
Machine non-availability
Polynomial time approximation scheme
Approximation algorithm
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c319t-a27272bae59280a86b2c689ca39934a524e19d592c1b952665a69c8777e09df3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0001-5403-6576
PQID 2634585806
PQPubID 2043856
PageCount 13
ParticipantIDs proquest_journals_2634585806
crossref_primary_10_1007_s10878_021_00773_7
crossref_citationtrail_10_1007_s10878_021_00773_7
springer_journals_10_1007_s10878_021_00773_7
PublicationCentury 2000
PublicationDate 2022-03-01
PublicationDateYYYYMMDD 2022-03-01
PublicationDate_xml – month: 03
  year: 2022
  text: 2022-03-01
  day: 01
PublicationDecade 2020
PublicationPlace New York
PublicationPlace_xml – name: New York
– name: Dordrecht
PublicationTitle Journal of combinatorial optimization
PublicationTitleAbbrev J Comb Optim
PublicationYear 2022
Publisher Springer US
Springer Nature B.V
Publisher_xml – name: Springer US
– name: Springer Nature B.V
References Strusevich (CR27) 1998; 83
Breit (CR2) 2004; 90
Hadda (CR11) 2014; 13
Breit, Schmidt, Strusevich (CR4) 2001; 29
Breit (CR3) 2006; 33
Cheng, Wang (CR7) 2000; 26
Lorigeon, Billaut, Bouquard (CR20) 2002; 53
Lee (CR19) 1999; 114
Hadda (CR10) 2012; 6
Lu, Posner (CR21) 1993; 18
Shakhlevich, Strusevich (CR26) 1993; 70
Kubzin, Potts, Strusevich (CR16) 2009; 36
Ng, Kovalyov (CR23) 2004; 51
Johnson (CR13) 1954; 1
Gonzalez, Sahni (CR9) 1976; 23
Lee (CR18) 1997; 20
Mosheiov, Sarig, Strusevich, Mosheiff (CR22) 2018; 271
Breit, Schmidt, Strusevich (CR5) 2003; 57
CR8
Chen, Strusevich (CR6) 1993; 5
Kubiak, Błazewicz, Formanowicz, Breit, Schmidt (CR14) 2002; 136
Lee (CR17) 1996; 9
CR24
Hadda, Dridi, Hajri-Gabouj (CR12) 2010; 8
Kubzin, Strusevich, Breit, Schmidt (CR15) 2006; 53
Błazewicz, Formanowicz (CR1) 2002; 36
Sevastianov, Woeginger (CR25) 1998; 82
J Błazewicz (773_CR1) 2002; 36
J Breit (773_CR2) 2004; 90
TE Cheng (773_CR7) 2000; 26
H Hadda (773_CR11) 2014; 13
CY Lee (773_CR18) 1997; 20
J Breit (773_CR5) 2003; 57
B Chen (773_CR6) 1993; 5
C Ng (773_CR23) 2004; 51
N Shakhlevich (773_CR26) 1993; 70
W Kubiak (773_CR14) 2002; 136
MA Kubzin (773_CR15) 2006; 53
SM Johnson (773_CR13) 1954; 1
CY Lee (773_CR19) 1999; 114
773_CR24
SV Sevastianov (773_CR25) 1998; 82
CY Lee (773_CR17) 1996; 9
T Lorigeon (773_CR20) 2002; 53
VA Strusevich (773_CR27) 1998; 83
L Lu (773_CR21) 1993; 18
G Mosheiov (773_CR22) 2018; 271
H Hadda (773_CR10) 2012; 6
773_CR8
H Hadda (773_CR12) 2010; 8
J Breit (773_CR3) 2006; 33
MA Kubzin (773_CR16) 2009; 36
J Breit (773_CR4) 2001; 29
T Gonzalez (773_CR9) 1976; 23
References_xml – volume: 8
  start-page: 87
  issue: 1
  year: 2010
  end-page: 99
  ident: CR12
  article-title: An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs
  publication-title: 4OR
  doi: 10.1007/s10288-009-0102-3
– volume: 9
  start-page: 395
  issue: 3–4
  year: 1996
  end-page: 416
  ident: CR17
  article-title: Machine scheduling with an availability constraint
  publication-title: J Global Optim
  doi: 10.1007/BF00121681
– volume: 271
  start-page: 388
  issue: 2
  year: 2018
  end-page: 400
  ident: CR22
  article-title: Two-machine flow shop and open shop scheduling problems with a single maintenance window
  publication-title: Eur J Oper Res
  doi: 10.1016/j.ejor.2018.04.019
– volume: 1
  start-page: 61
  issue: 1
  year: 1954
  end-page: 68
  ident: CR13
  article-title: Optimal two-and three-stage production schedules with setup times included
  publication-title: Naval Res Logist Q
  doi: 10.1002/nav.3800010110
– volume: 20
  start-page: 129
  issue: 3
  year: 1997
  end-page: 139
  ident: CR18
  article-title: Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
  publication-title: Oper Res Lett
  doi: 10.1016/S0167-6377(96)00041-7
– volume: 53
  start-page: 16
  issue: 1
  year: 2006
  end-page: 23
  ident: CR15
  article-title: Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints
  publication-title: Naval Res Logist (NRL)
  doi: 10.1002/nav.20122
– volume: 26
  start-page: 223
  issue: 5
  year: 2000
  end-page: 229
  ident: CR7
  article-title: An improved heuristic for two-machine flowshop scheduling with an availability constraint
  publication-title: Oper Res Lett
  doi: 10.1016/S0167-6377(00)00033-X
– volume: 6
  start-page: 559
  issue: 3
  year: 2012
  end-page: 569
  ident: CR10
  article-title: A polynomial-time approximation scheme for the two machine flow shop problem with several availability constraints
  publication-title: Optim Lett
  doi: 10.1007/s11590-011-0281-7
– volume: 114
  start-page: 420
  issue: 2
  year: 1999
  end-page: 429
  ident: CR19
  article-title: Two-machine flowshop scheduling with availability constraints
  publication-title: Eur J Oper Res
  doi: 10.1016/S0377-2217(97)00452-9
– volume: 136
  start-page: 528
  issue: 3
  year: 2002
  end-page: 540
  ident: CR14
  article-title: Two-machine flow shops with limited machine availability
  publication-title: Eur J Oper Res
  doi: 10.1016/S0377-2217(01)00083-2
– ident: CR8
– volume: 83
  start-page: 253
  year: 1998
  end-page: 270
  ident: CR27
  article-title: A greedy open shop heuristic with job priorities
  publication-title: Annal Oper Res
  doi: 10.1023/A:1018964131329
– volume: 36
  start-page: 379
  issue: 2
  year: 2009
  end-page: 390
  ident: CR16
  article-title: Approximation results for flow shop scheduling problems with machine availability constraints
  publication-title: Computers Oper Res
  doi: 10.1016/j.cor.2007.10.013
– volume: 70
  start-page: 391
  issue: 3
  year: 1993
  end-page: 404
  ident: CR26
  article-title: Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function
  publication-title: Eur J Oper Res
  doi: 10.1016/0377-2217(93)90250-Q
– volume: 23
  start-page: 665
  issue: 4
  year: 1976
  end-page: 679
  ident: CR9
  article-title: Open shop scheduling to minimize finish time
  publication-title: J ACM (JACM)
  doi: 10.1145/321978.321985
– volume: 90
  start-page: 273
  issue: 6
  year: 2004
  end-page: 278
  ident: CR2
  article-title: An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
  publication-title: Information Process Lett
  doi: 10.1016/j.ipl.2004.03.004
– volume: 5
  start-page: 321
  issue: 3
  year: 1993
  end-page: 326
  ident: CR6
  article-title: Approximation algorithms for three-machine open shop scheduling
  publication-title: ORSA J Comput
  doi: 10.1287/ijoc.5.3.321
– volume: 36
  start-page: 149
  issue: 2
  year: 2002
  end-page: 156
  ident: CR1
  article-title: Scheduling jobs in open shops with limited machine availability
  publication-title: RAIRO-Oper Res-Recherche Opérationnelle
  doi: 10.1051/ro:2002008
– volume: 13
  start-page: 511
  issue: 4
  year: 2014
  end-page: 522
  ident: CR11
  article-title: A PTAS for a particular case of the two-machine flow shop with limited machine availability
  publication-title: J Math Model Algorithms Oper Res
  doi: 10.1007/s10852-013-9245-5
– volume: 33
  start-page: 2143
  issue: 8
  year: 2006
  end-page: 2153
  ident: CR3
  article-title: A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint
  publication-title: Computers Oper Res
  doi: 10.1016/j.cor.2005.01.004
– volume: 53
  start-page: 1239
  issue: 11
  year: 2002
  end-page: 1246
  ident: CR20
  article-title: A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint
  publication-title: J Oper Res Soc
  doi: 10.1057/palgrave.jors.2601421
– volume: 57
  start-page: 217
  issue: 2
  year: 2003
  end-page: 234
  ident: CR5
  article-title: Non-preemptive two-machine open shop scheduling with non-availability constraints
  publication-title: Math Methods Oper Res
  doi: 10.1007/s001860200267
– volume: 29
  start-page: 65
  issue: 2
  year: 2001
  end-page: 77
  ident: CR4
  article-title: Two-machine open shop scheduling with an availability constraint
  publication-title: Oper Res Lett
  doi: 10.1016/S0167-6377(01)00079-7
– volume: 18
  start-page: 12
  issue: 1
  year: 1993
  end-page: 38
  ident: CR21
  article-title: An NP-hard open shop scheduling problem with polynomial average time complexity
  publication-title: Math Oper Res
  doi: 10.1287/moor.18.1.12
– volume: 51
  start-page: 307
  issue: 3
  year: 2004
  end-page: 315
  ident: CR23
  article-title: An FPTAS for scheduling a two-machine flowshop with one unavailability interval
  publication-title: Naval Res Logist (NRL)
  doi: 10.1002/nav.10107
– ident: CR24
– volume: 82
  start-page: 191
  issue: 1–2
  year: 1998
  end-page: 198
  ident: CR25
  article-title: Makespan minimization in open shops: a polynomial time approximation scheme
  publication-title: Math Program
– volume: 53
  start-page: 16
  issue: 1
  year: 2006
  ident: 773_CR15
  publication-title: Naval Res Logist (NRL)
  doi: 10.1002/nav.20122
– volume: 29
  start-page: 65
  issue: 2
  year: 2001
  ident: 773_CR4
  publication-title: Oper Res Lett
  doi: 10.1016/S0167-6377(01)00079-7
– ident: 773_CR24
  doi: 10.1007/978-94-009-7801-0_9
– volume: 33
  start-page: 2143
  issue: 8
  year: 2006
  ident: 773_CR3
  publication-title: Computers Oper Res
  doi: 10.1016/j.cor.2005.01.004
– volume: 1
  start-page: 61
  issue: 1
  year: 1954
  ident: 773_CR13
  publication-title: Naval Res Logist Q
  doi: 10.1002/nav.3800010110
– volume: 57
  start-page: 217
  issue: 2
  year: 2003
  ident: 773_CR5
  publication-title: Math Methods Oper Res
  doi: 10.1007/s001860200267
– volume: 136
  start-page: 528
  issue: 3
  year: 2002
  ident: 773_CR14
  publication-title: Eur J Oper Res
  doi: 10.1016/S0377-2217(01)00083-2
– volume: 36
  start-page: 149
  issue: 2
  year: 2002
  ident: 773_CR1
  publication-title: RAIRO-Oper Res-Recherche Opérationnelle
  doi: 10.1051/ro:2002008
– volume: 26
  start-page: 223
  issue: 5
  year: 2000
  ident: 773_CR7
  publication-title: Oper Res Lett
  doi: 10.1016/S0167-6377(00)00033-X
– volume: 70
  start-page: 391
  issue: 3
  year: 1993
  ident: 773_CR26
  publication-title: Eur J Oper Res
  doi: 10.1016/0377-2217(93)90250-Q
– volume: 83
  start-page: 253
  year: 1998
  ident: 773_CR27
  publication-title: Annal Oper Res
  doi: 10.1023/A:1018964131329
– ident: 773_CR8
  doi: 10.1016/B978-0-444-87358-3.50012-2
– volume: 5
  start-page: 321
  issue: 3
  year: 1993
  ident: 773_CR6
  publication-title: ORSA J Comput
  doi: 10.1287/ijoc.5.3.321
– volume: 23
  start-page: 665
  issue: 4
  year: 1976
  ident: 773_CR9
  publication-title: J ACM (JACM)
  doi: 10.1145/321978.321985
– volume: 9
  start-page: 395
  issue: 3–4
  year: 1996
  ident: 773_CR17
  publication-title: J Global Optim
  doi: 10.1007/BF00121681
– volume: 8
  start-page: 87
  issue: 1
  year: 2010
  ident: 773_CR12
  publication-title: 4OR
  doi: 10.1007/s10288-009-0102-3
– volume: 90
  start-page: 273
  issue: 6
  year: 2004
  ident: 773_CR2
  publication-title: Information Process Lett
  doi: 10.1016/j.ipl.2004.03.004
– volume: 82
  start-page: 191
  issue: 1–2
  year: 1998
  ident: 773_CR25
  publication-title: Math Program
– volume: 36
  start-page: 379
  issue: 2
  year: 2009
  ident: 773_CR16
  publication-title: Computers Oper Res
  doi: 10.1016/j.cor.2007.10.013
– volume: 6
  start-page: 559
  issue: 3
  year: 2012
  ident: 773_CR10
  publication-title: Optim Lett
  doi: 10.1007/s11590-011-0281-7
– volume: 18
  start-page: 12
  issue: 1
  year: 1993
  ident: 773_CR21
  publication-title: Math Oper Res
  doi: 10.1287/moor.18.1.12
– volume: 271
  start-page: 388
  issue: 2
  year: 2018
  ident: 773_CR22
  publication-title: Eur J Oper Res
  doi: 10.1016/j.ejor.2018.04.019
– volume: 20
  start-page: 129
  issue: 3
  year: 1997
  ident: 773_CR18
  publication-title: Oper Res Lett
  doi: 10.1016/S0167-6377(96)00041-7
– volume: 114
  start-page: 420
  issue: 2
  year: 1999
  ident: 773_CR19
  publication-title: Eur J Oper Res
  doi: 10.1016/S0377-2217(97)00452-9
– volume: 53
  start-page: 1239
  issue: 11
  year: 2002
  ident: 773_CR20
  publication-title: J Oper Res Soc
  doi: 10.1057/palgrave.jors.2601421
– volume: 13
  start-page: 511
  issue: 4
  year: 2014
  ident: 773_CR11
  publication-title: J Math Model Algorithms Oper Res
  doi: 10.1007/s10852-013-9245-5
– volume: 51
  start-page: 307
  issue: 3
  year: 2004
  ident: 773_CR23
  publication-title: Naval Res Logist (NRL)
  doi: 10.1002/nav.10107
SSID ssj0009054
Score 2.3098087
Snippet Shop scheduling problem is one of the most classical problems in combinatorial optimization. In this paper, we study two-machine open shop scheduling problem,...
SourceID proquest
crossref
springer
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 350
SubjectTerms Combinatorial analysis
Combinatorics
Convex and Discrete Geometry
Job shops
Maintenance
Mathematical Modeling and Industrial Mathematics
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Polynomials
Scheduling
Theory of Computation
Title A PTAS for non-resumable open shop scheduling with an availability constraint
URI https://link.springer.com/article/10.1007/s10878-021-00773-7
https://www.proquest.com/docview/2634585806
Volume 43
WOSCitedRecordID wos000669166100001&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: PRVAVX
  databaseName: SpringerLINK Contemporary 1997-Present
  customDbUrl:
  eissn: 1573-2886
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0009054
  issn: 1382-6905
  databaseCode: RSV
  dateStart: 19970301
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1bS8MwFA46fdAH7-J0Sh5800CXtrk8DnH44MZwQ_ZW0jTFgXZj7Qb-e096WaeooI8lF8LJ5ftOk_MdhK4jbQDkeEwYkGHiGc8lAmgRCQErDNcKzuU8a8kj7_fFeCwHZVBYWr12r64k85N6LdhNWDVYCu6vw7lL-CbaArgTdjs-DZ9rqV3HL1LZAncE388vQ2W-7-MzHNUc88u1aI423f3_jfMA7ZXsEneK5XCINkxyhHbXNAfhq7cSak2PUa-DB6POEAN1xck0IeB8L95sNBW2abVw-jKdYfB_AY9s2Dq2f22xSrBaqslrofD9jrWlmDbTRHaCRt370d0DKTMsEA1bLyOK2nvYUBlfUuEowUKqmZBaWdriKZ96pi0jKNTtUPqA5b5iUlsJQePIKHZPUQPGZs4QjqVuG-YaE3LHixQTDvRKQ64oOMFUxk3Uruwc6FJ93A7tNah1k63dArBbkNst4E10s2ozK7Q3fq3dqqYvKPdhGlDmeuAQCYc10W01XXXxz72d_636BdqhNi4if5zWQo1svjCXaFsvs0k6v8rX5wdLXd0l
linkProvider Springer Nature
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LSwMxEB60CurBt1itmoM3DexmH9kci1gU21LsIr0t2TTFQm1Lty34753so62igh6XPAiTx_fNJvMNwHVXaQQ53qM-kmHqatehAdIiGiNWaK4knstp1pI6bzaDTke08qCwpHjtXlxJpif1SrBbYNRgGbq_FucO5euw4SJimYd8z-2XpdSu5WWpbJE7ou_n5aEy3_fxGY6WHPPLtWiKNrW9_41zH3Zzdkmq2XI4gDU9PISdFc1B_GoshFqTI2hUSSustglSVzIcDSk637M3E01FTFotkryOxgT9X8QjE7ZOzF9bIodEzmV_kCl8vxNlKKbJNDE9hrB2H9490DzDAlW49aZUMnMPG0vtCRZYMvBjpvxAKGloiys95mpbdLFQ2bHwEMs96QtlJAS1Jbo95wRKODZ9CqQnlK19R-uYW25X-oGFvbKYS4ZOMBO9MtiFnSOVq4-boQ2ipW6ysVuEdotSu0W8DDeLNuNMe-PX2pVi-qJ8HyYR8x0XHaLA8stwW0zXsvjn3s7-Vv0Kth7CRj2qPzafzmGbmRiJ9KFaBUrTyUxfwKaaT_vJ5DJdqx-x7OAJ
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1bS8MwFD7oFNEH7-K85sE3DXbpJc3jUIfiNgYO8a2kaYqCdmPrBv57T3pZp6ggPpakIZwkPd_Xk_MdgLNIaXRyPKYegmHqaMemPsIiGqKv0FxJ_C5nVUvavNv1n55Eby6LP7vtXoYk85wGo9KUpJfDKL6cS3zzjTIsQypscW5TvghLjikaZPj6w2Mlu2u5eVlbxJHIA90ibeb7MT67pgpvfgmRZp6ntfH_OW_CeoE6STPfJluwoJNtWJvTIsSnzkzAdbwDnSbp9ZsPBCEtSQYJRVI-eTNZVsSU2yLj58GQIC9GP2XS2Yn5m0tkQuRUvrzmyt_vRBnoaSpQpLvQb930r25pUXmBKjySKZXMxGdDqV3BfEv6XsiU5wslDZxxpMsc3RARNqpGKFz08a70hDLSgtoSUWzvQQ3npveBxEI1tGdrHXLLiaTnWzgqC7lkSI6ZiOvQKG0eqEKV3EztNaj0lI3dArRbkNkt4HU4n70zzDU5fu19VC5lUJzPccA820Gi5FteHS7Kpauafx7t4G_dT2Gld90K2nfd-0NYZSZ1Iru_dgS1dDTRx7CspunLeHSSbdsPUfPo7Q
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+PTAS+for+non-resumable+open+shop+scheduling+with+an+availability+constraint&rft.jtitle=Journal+of+combinatorial+optimization&rft.au=Yuan%2C+Yuan&rft.au=Yan%2C+Lan&rft.au=Ding%2C+Ning&rft.au=Han%2C+Xin&rft.date=2022-03-01&rft.pub=Springer+Nature+B.V&rft.issn=1382-6905&rft.eissn=1573-2886&rft.volume=43&rft.issue=2&rft.spage=350&rft.epage=362&rft_id=info:doi/10.1007%2Fs10878-021-00773-7&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1382-6905&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1382-6905&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1382-6905&client=summon