Scheduling resumable simple linear deteriorating jobs on a single machine with an availability constraint to minimize makespan

We consider a single-machine scheduling problem in which the processing time of each job is a simple linear deteriorating function of its waiting time. The machine is subject to an availability constraint. Jobs interrupted by machine unavailability can resume their processing. The objective is to mi...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Computers & industrial engineering Ročník 59; číslo 4; s. 794 - 798
Hlavní autori: Ji, Min, Cheng, T.C.E.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York Elsevier Ltd 01.11.2010
Pergamon Press Inc
Predmet:
0–1 integer programming
Approximation
Availability
Availability constraint
Computational complexity
Deterioration
FPTAS
Industrial engineering
Integer programming
Job shops
Mathematical analysis
Optimization
Polynomials
Production scheduling
Scheduling
Studies
Time management
Availability constraint
Scheduling
FPTAS
Computational complexity
0–1 integer programming
ISSN:0360-8352, 1879-0550
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract We consider a single-machine scheduling problem in which the processing time of each job is a simple linear deteriorating function of its waiting time. The machine is subject to an availability constraint. Jobs interrupted by machine unavailability can resume their processing. The objective is to minimize the makespan. We first show that the problem can be solved optimally by 0–1 integer programming. We then prove that the problem is NP-hard in the ordinary sense and there exists a fully polynomial time approximation scheme for it.
AbstractList We consider a single-machine scheduling problem in which the processing time of each job is a simple linear deteriorating function of its waiting time. The machine is subject to an availability constraint. Jobs interrupted by machine unavailability can resume their processing. The objective is to minimize the makespan. We first show that the problem can be solved optimally by 0-1 integer programming. We then prove that the problem is NP-hard in the ordinary sense and there exists a fully polynomial time approximation scheme for it.
We consider a single-machine scheduling problem in which the processing time of each job is a simple linear deteriorating function of its waiting time. The machine is subject to an availability constraint. Jobs interrupted by machine unavailability can resume their processing. The objective is to minimize the makespan. We first show that the problem can be solved optimally by 0-1 integer programming. We then prove that the problem is NP-hard in the ordinary sense and there exists a fully polynomial time approximation scheme for it. [PUBLICATION ABSTRACT]
Author Ji, Min
Cheng, T.C.E.
Author_xml – sequence: 1
  givenname: Min
  surname: Ji
  fullname: Ji, Min
  email: jimkeen@163.com
  organization: School of Computer Science and Information Engineering, Zhejiang Gongshang University, Hangzhou 310018, PR China
– sequence: 2
  givenname: T.C.E.
  surname: Cheng
  fullname: Cheng, T.C.E.
  email: lgtcheng@polyu.edu.hk
  organization: Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Kowloon, Hong Kong
BookMark eNp9kU1v1DAQhi1UJLaFH8DN4sQly9iJPyJOqKKAVIkDcLYcZ7brkNiL7RSVA78dR8uph55GHj_PyJ73klyEGJCQ1wz2DJh8N-2dxz2Hega9BxDPyI5p1TcgBFyQHbQSGt0K_oJc5jwBQCd6tiN_v7kjjuvswx1NmNfFDjPS7JdTLbWLNtERCyYfky0bNcUh0xiorVS4q9Ri3bGC9LcvR2rrxb31sx387MsDdTHkkqwPhZZIFx_84v9szk_MJxtekucHO2d89b9ekR83H79ff25uv376cv3htnGtUKXBcXCjluiYHsaODwPXuh0PUuoDKAm96jopZceU5J3SIxe2d7LrnGg5H7ST7RV5e557SvHXirmYxWeH82wDxjUbJhXjuuUdq-ibR-gU1xTq64wG1QsNfJunzpBLMeeEB-N8qfuJYfvsbBiYLRYz1T6aLRYD2tRYqskemafkF5sennTenx2sK7r3mEyuSHA4-oSumDH6J-x_ddGowA
CODEN CINDDL
CitedBy_id crossref_primary_10_1016_j_amc_2013_07_003
crossref_primary_10_1016_j_cie_2011_05_010
crossref_primary_10_1007_s12351_022_00720_2
crossref_primary_10_1016_j_apm_2013_11_031
crossref_primary_10_1016_j_amc_2013_10_034
crossref_primary_10_1007_s13369_018_3525_3
crossref_primary_10_1142_S0217595912500194
crossref_primary_10_1016_j_cie_2011_06_004
crossref_primary_10_1007_s11590_011_0362_7
crossref_primary_10_1016_j_ejor_2025_05_024
crossref_primary_10_1016_j_ipl_2014_08_011
crossref_primary_10_1016_j_disopt_2015_11_002
crossref_primary_10_1007_s10951_019_00630_w
crossref_primary_10_1007_s12652_020_02162_0
crossref_primary_10_1142_S021759591350022X
crossref_primary_10_1016_j_amc_2010_08_064
Cites_doi 10.1016/S0377-2217(02)00909-8
10.1016/j.tcs.2006.06.006
10.1016/S0020-0190(03)00262-X
10.1007/BF00121681
10.1023/A:1018909801944
10.1016/j.camwa.2007.12.006
10.1002/(SICI)1520-6750(199910)46:7<845::AID-NAV6>3.0.CO;2-#
10.1057/palgrave.jors.2600740
10.1016/0377-2217(90)90089-T
10.1016/0196-6774(81)90037-7
10.1016/0360-8352(88)90041-1
10.1287/opre.38.3.495
10.1016/0305-0548(94)90080-9
10.1287/ijoc.12.1.57.11901
ContentType Journal Article
Copyright 2010 Elsevier Ltd
Copyright Pergamon Press Inc. Nov 2010
Copyright_xml – notice: 2010 Elsevier Ltd
– notice: Copyright Pergamon Press Inc. Nov 2010
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1016/j.cie.2010.08.005
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology 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
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts

Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Applied Sciences
Engineering
EISSN 1879-0550
EndPage 798
ExternalDocumentID 2195253461
10_1016_j_cie_2010_08_005
S0360835210002299
Genre Feature
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1RT
1~.
1~5
29F
4.4
457
4G.
5GY
5VS
7-5
71M
8P~
9JN
9JO
AAAKG
AABNK
AACTN
AAEDT
AAEDW
AAFWJ
AAIKC
AAIKJ
AAKOC
AALRI
AAMNW
AAOAW
AAQFI
AAQXK
AARIN
AATTM
AAXKI
AAXUO
ABAOU
ABDPE
ABJNI
ABMAC
ABUCO
ABWVN
ABXDB
ACDAQ
ACGFO
ACGFS
ACNCT
ACNNM
ACRLP
ACRPL
ADBBV
ADEZE
ADGUI
ADMUD
ADNMO
ADRHT
ADTZH
AEBSH
AECPX
AEIPS
AEKER
AENEX
AFJKZ
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHJVU
AIEXJ
AIGVJ
AIKHN
AITUG
AKRWK
ALMA_UNASSIGNED_HOLDINGS
AMRAJ
ANKPU
APLSM
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BJAXD
BKOJK
BKOMP
BLXMC
BNPGV
CS3
DU5
EBS
EFJIC
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
GBLVA
HAMUX
HLZ
HVGLF
HZ~
H~9
IHE
J1W
JJJVA
KOM
LX9
LY1
LY7
M41
MHUIS
MO0
MS~
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PQQKQ
Q38
R2-
RIG
RNS
ROL
RPZ
RXW
SBC
SDF
SDG
SDP
SDS
SES
SET
SEW
SPC
SPCBC
SSB
SSD
SSH
SST
SSW
SSZ
T5K
TAE
TN5
WUQ
XPP
ZMT
~G-
9DU
AAYWO
AAYXX
ACLOT
ACVFH
ADCNI
AEUPX
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKYEP
APXCP
CITATION
EFKBS
EFLBG
~HD
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c357t-edbcd86ec18bd42bb2883df668f0760974466641762478d25a9c644c5322b8c63
ISICitedReferencesCount 16
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000284747000036&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0360-8352
IngestDate Thu Oct 02 10:01:30 EDT 2025
Sun Oct 05 00:21:54 EDT 2025
Tue Nov 18 22:04:21 EST 2025
Sat Nov 29 01:39:44 EST 2025
Sun Apr 06 06:54:00 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 4
Keywords Availability constraint
Scheduling
FPTAS
Computational complexity
0–1 integer programming
Language English
License https://www.elsevier.com/tdm/userlicense/1.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c357t-edbcd86ec18bd42bb2883df668f0760974466641762478d25a9c644c5322b8c63
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
PQID 807958026
PQPubID 9545
PageCount 5
ParticipantIDs proquest_miscellaneous_1671283241
proquest_journals_807958026
crossref_citationtrail_10_1016_j_cie_2010_08_005
crossref_primary_10_1016_j_cie_2010_08_005
elsevier_sciencedirect_doi_10_1016_j_cie_2010_08_005
PublicationCentury 2000
PublicationDate 2010-11-01
PublicationDateYYYYMMDD 2010-11-01
PublicationDate_xml – month: 11
  year: 2010
  text: 2010-11-01
  day: 01
PublicationDecade 2010
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle Computers & industrial engineering
PublicationYear 2010
Publisher Elsevier Ltd
Pergamon Press Inc
Publisher_xml – name: Elsevier Ltd
– name: Pergamon Press Inc
References Kunnathur, Gupta (b0050) 1990; 47
Woeginger (b0085) 2000; 12
Low, Hsu, Su (b0065) 2008; 56
Mosheiov (b0070) 1994; 21
Mosheiov (b0075) 1998; 36
Ji, He, Cheng (b0040) 2006; 362
Lee (b0055) 1996; 8
Lee, Lei, Pinedo (b0060) 1997; 70
Pinedo (b0080) 2002
Garey, Johnson (b0020) 1979
Alidaee, Womer (b0005) 1999; 50
Graves, Lee (b0030) 1999; 46
Gupta, Gupta (b0035) 1988; 14
Cheng, Ding, Lin (b0015) 2004; 152
Graham, Lawler, Lenstra, Rinnooy Kan (b0025) 1979; 5
Wu, Lee (b0090) 2003; 87
Johnson (b0045) 1981; 2
Brown, Yechiali (b0010) 1990; 38
Garey (10.1016/j.cie.2010.08.005_b0020) 1979
Graham (10.1016/j.cie.2010.08.005_b0025) 1979; 5
Lee (10.1016/j.cie.2010.08.005_b0055) 1996; 8
Mosheiov (10.1016/j.cie.2010.08.005_b0075) 1998; 36
Pinedo (10.1016/j.cie.2010.08.005_b0080) 2002
Alidaee (10.1016/j.cie.2010.08.005_b0005) 1999; 50
Graves (10.1016/j.cie.2010.08.005_b0030) 1999; 46
Johnson (10.1016/j.cie.2010.08.005_b0045) 1981; 2
Woeginger (10.1016/j.cie.2010.08.005_b0085) 2000; 12
Ji (10.1016/j.cie.2010.08.005_b0040) 2006; 362
Wu (10.1016/j.cie.2010.08.005_b0090) 2003; 87
Mosheiov (10.1016/j.cie.2010.08.005_b0070) 1994; 21
Kunnathur (10.1016/j.cie.2010.08.005_b0050) 1990; 47
Lee (10.1016/j.cie.2010.08.005_b0060) 1997; 70
Cheng (10.1016/j.cie.2010.08.005_b0015) 2004; 152
Low (10.1016/j.cie.2010.08.005_b0065) 2008; 56
Brown (10.1016/j.cie.2010.08.005_b0010) 1990; 38
Gupta (10.1016/j.cie.2010.08.005_b0035) 1988; 14
References_xml – volume: 70
  start-page: 1
  year: 1997
  end-page: 42
  ident: b0060
  article-title: Current trend in deterministic scheduling
  publication-title: Annals of Operations Research
– volume: 38
  start-page: 495
  year: 1990
  end-page: 498
  ident: b0010
  article-title: Scheduling deteriorating jobs on a single process
  publication-title: Operations Research
– volume: 362
  start-page: 115
  year: 2006
  end-page: 126
  ident: b0040
  article-title: Scheduling linear deteriorating jobs with an availability constraint on a single machine
  publication-title: Theoretical Computer Science
– volume: 87
  start-page: 89
  year: 2003
  end-page: 93
  ident: b0090
  article-title: Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
  publication-title: Information Processing Letters
– volume: 36
  start-page: 205
  year: 1998
  end-page: 214
  ident: b0075
  article-title: Multi-machine scheduling with linear deterioration
  publication-title: INFOR
– volume: 14
  start-page: 387
  year: 1988
  end-page: 393
  ident: b0035
  article-title: Single facility scheduling with nonlinear processing times
  publication-title: Computers and Industrial Engineering
– volume: 56
  start-page: 257
  year: 2008
  end-page: 265
  ident: b0065
  article-title: Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration
  publication-title: Computers and Mathematics with Applications
– volume: 152
  start-page: 1
  year: 2004
  end-page: 13
  ident: b0015
  article-title: A concise survey of scheduling with time-dependent processing times
  publication-title: European Journal of Operational Research
– year: 2002
  ident: b0080
  article-title: Scheduling: Theory, algorithms, and systems
– volume: 21
  start-page: 653
  year: 1994
  end-page: 659
  ident: b0070
  article-title: Scheduling jobs under simple linear deterioration
  publication-title: Computers and Operations Research
– year: 1979
  ident: b0020
  article-title: Computers and intractability: A guide to the theory of NP-completeness
– volume: 8
  start-page: 395
  year: 1996
  end-page: 417
  ident: b0055
  article-title: Machine scheduling with an availability constraint
  publication-title: Journal of Global Optimization
– volume: 50
  start-page: 711
  year: 1999
  end-page: 720
  ident: b0005
  article-title: Scheduling with time dependent processing times: Review and extensions
  publication-title: Journal of the Operational Research Society
– volume: 12
  start-page: 57
  year: 2000
  end-page: 74
  ident: b0085
  article-title: When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)?
  publication-title: INFORMS Journal on Computing
– volume: 47
  start-page: 56
  year: 1990
  end-page: 64
  ident: b0050
  article-title: Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
  publication-title: European Journal of Operational Research
– volume: 2
  start-page: 393
  year: 1981
  end-page: 405
  ident: b0045
  article-title: The NP-complete columns: An ongoing guide
  publication-title: Journal of Algorithms
– volume: 46
  start-page: 845
  year: 1999
  end-page: 863
  ident: b0030
  article-title: Scheduling maintenance and semi-resumable jobs on a single machine
  publication-title: Naval Research Logistics
– volume: 5
  start-page: 287
  year: 1979
  end-page: 326
  ident: b0025
  article-title: Optimization and approximation in deterministic sequencing and scheduling: A survey
  publication-title: Annals of Operations Research
– volume: 152
  start-page: 1
  year: 2004
  ident: 10.1016/j.cie.2010.08.005_b0015
  article-title: A concise survey of scheduling with time-dependent processing times
  publication-title: European Journal of Operational Research
  doi: 10.1016/S0377-2217(02)00909-8
– year: 1979
  ident: 10.1016/j.cie.2010.08.005_b0020
– volume: 5
  start-page: 287
  year: 1979
  ident: 10.1016/j.cie.2010.08.005_b0025
  article-title: Optimization and approximation in deterministic sequencing and scheduling: A survey
  publication-title: Annals of Operations Research
– volume: 362
  start-page: 115
  year: 2006
  ident: 10.1016/j.cie.2010.08.005_b0040
  article-title: Scheduling linear deteriorating jobs with an availability constraint on a single machine
  publication-title: Theoretical Computer Science
  doi: 10.1016/j.tcs.2006.06.006
– volume: 36
  start-page: 205
  year: 1998
  ident: 10.1016/j.cie.2010.08.005_b0075
  article-title: Multi-machine scheduling with linear deterioration
  publication-title: INFOR
– volume: 87
  start-page: 89
  year: 2003
  ident: 10.1016/j.cie.2010.08.005_b0090
  article-title: Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine
  publication-title: Information Processing Letters
  doi: 10.1016/S0020-0190(03)00262-X
– volume: 8
  start-page: 395
  year: 1996
  ident: 10.1016/j.cie.2010.08.005_b0055
  article-title: Machine scheduling with an availability constraint
  publication-title: Journal of Global Optimization
  doi: 10.1007/BF00121681
– volume: 70
  start-page: 1
  year: 1997
  ident: 10.1016/j.cie.2010.08.005_b0060
  article-title: Current trend in deterministic scheduling
  publication-title: Annals of Operations Research
  doi: 10.1023/A:1018909801944
– volume: 56
  start-page: 257
  year: 2008
  ident: 10.1016/j.cie.2010.08.005_b0065
  article-title: Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration
  publication-title: Computers and Mathematics with Applications
  doi: 10.1016/j.camwa.2007.12.006
– year: 2002
  ident: 10.1016/j.cie.2010.08.005_b0080
– volume: 46
  start-page: 845
  year: 1999
  ident: 10.1016/j.cie.2010.08.005_b0030
  article-title: Scheduling maintenance and semi-resumable jobs on a single machine
  publication-title: Naval Research Logistics
  doi: 10.1002/(SICI)1520-6750(199910)46:7<845::AID-NAV6>3.0.CO;2-#
– volume: 50
  start-page: 711
  year: 1999
  ident: 10.1016/j.cie.2010.08.005_b0005
  article-title: Scheduling with time dependent processing times: Review and extensions
  publication-title: Journal of the Operational Research Society
  doi: 10.1057/palgrave.jors.2600740
– volume: 47
  start-page: 56
  year: 1990
  ident: 10.1016/j.cie.2010.08.005_b0050
  article-title: Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
  publication-title: European Journal of Operational Research
  doi: 10.1016/0377-2217(90)90089-T
– volume: 2
  start-page: 393
  year: 1981
  ident: 10.1016/j.cie.2010.08.005_b0045
  article-title: The NP-complete columns: An ongoing guide
  publication-title: Journal of Algorithms
  doi: 10.1016/0196-6774(81)90037-7
– volume: 14
  start-page: 387
  year: 1988
  ident: 10.1016/j.cie.2010.08.005_b0035
  article-title: Single facility scheduling with nonlinear processing times
  publication-title: Computers and Industrial Engineering
  doi: 10.1016/0360-8352(88)90041-1
– volume: 38
  start-page: 495
  year: 1990
  ident: 10.1016/j.cie.2010.08.005_b0010
  article-title: Scheduling deteriorating jobs on a single process
  publication-title: Operations Research
  doi: 10.1287/opre.38.3.495
– volume: 21
  start-page: 653
  year: 1994
  ident: 10.1016/j.cie.2010.08.005_b0070
  article-title: Scheduling jobs under simple linear deterioration
  publication-title: Computers and Operations Research
  doi: 10.1016/0305-0548(94)90080-9
– volume: 12
  start-page: 57
  year: 2000
  ident: 10.1016/j.cie.2010.08.005_b0085
  article-title: When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)?
  publication-title: INFORMS Journal on Computing
  doi: 10.1287/ijoc.12.1.57.11901
SSID ssj0004591
Score 2.0296164
Snippet We consider a single-machine scheduling problem in which the processing time of each job is a simple linear deteriorating function of its waiting time. The...
SourceID proquest
crossref
elsevier
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 794
SubjectTerms 0–1 integer programming
Approximation
Availability
Availability constraint
Computational complexity
Deterioration
FPTAS
Industrial engineering
Integer programming
Job shops
Mathematical analysis
Optimization
Polynomials
Production scheduling
Scheduling
Studies
Time management
Title Scheduling resumable simple linear deteriorating jobs on a single machine with an availability constraint to minimize makespan
URI https://dx.doi.org/10.1016/j.cie.2010.08.005
https://www.proquest.com/docview/807958026
https://www.proquest.com/docview/1671283241
Volume 59
WOSCitedRecordID wos000284747000036&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: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1879-0550
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0004591
  issn: 0360-8352
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3db9MwELfKxgN74GOAKANkJPZCFZQPO04ep9EKUFUm0aG-RYnjjpQu7Zq2GjzwT_EPchfHSTtEBQ-8RJUdW0nu17uz73w_Ql5JR3iCSWb5qZ1YTHHPCrxUWIkrpeRjcHhLHrLPfTEYBKNReNZq_TRnYdZTkefB9XU4_6-ihjYQNh6d_Qdx15NCA_wGocMVxA7XvxL8JxBDuipPmcNSenVZno0qMqwC3EGfMkZKcKzQXAof7prMkjJmEHdw32CKGa2YYKnMubdOvI6zqa7n_Q3T1IuSV2KJbitWJrnMvuOYrwqUU77p7BrGiKLEV9aQhKimCGKdwZPpJP4aq6dflFZDQ00WZbYmMM1ja2viTC0ukDJJZ5NsJ3aC4bQt9P60HdLKNxChZXNdiNZo56peeLa59VCqWqHJkX8zAXo3YvIGVGOVuYfZsryxdybGP_gY9c77_WjYHQ23e0vzDqqcu9xjvnPs9eZXFhKVYUD_2HurQXOL7LuCh6BK90_ed0cfNorUa6JG84ommF6mFd54rD-5Qzccg9LbGd4nd6tlCj3R8HpAWio_JPeqJQutDEJxSA426lk-JD8a7NEae1Rjj2rs0S3sUcQeneU0php7tMIeRezRGDo2sEcb7NHljBrsUYO9R-S81x2evrMqgg9LelwsLZUmMg18JZ0gSZmbJEh9nY59PxhjwBiWugxW18wBg81EkLo8DiX475KDFUoC6XuPyV4-y9UTQrHCredLZru-YonrJG4Ks8e-q2JPKO60iW2-cySr6vf4wNPIpDlOoF1FKJoIiVlt3iav6yFzXfpl183MCC-qfFftk0aAy13Djoygo0qHFFFgi5AH8CZt8rLuBa2Pobw4V7NVETm-cJBkjDlPd85wRO40f8xnZG-5WKnn5LZcL7Ni8aIC7i8X_dBA
linkProvider Elsevier
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=Scheduling+resumable+simple+linear+deteriorating+jobs+on+a+single+machine+with+an+availability+constraint+to+minimize+makespan&rft.jtitle=Computers+%26+industrial+engineering&rft.au=Ji%2C+Min&rft.au=Cheng%2C+TCE&rft.date=2010-11-01&rft.pub=Pergamon+Press+Inc&rft.issn=0360-8352&rft.eissn=1879-0550&rft.volume=59&rft.issue=4&rft.spage=794&rft_id=info:doi/10.1016%2Fj.cie.2010.08.005&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=2195253461
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0360-8352&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0360-8352&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0360-8352&client=summon