Single-machine scheduling with trade-off between number of tardy jobs and compression cost

We consider a single-machine scheduling problem, in which the job processing times are controllable or compressible. The performance criteria are the compression cost and the number of tardy jobs. For the problem, where no tardy jobs are allowed and the objective is to minimize the total compression...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of scheduling Ročník 10; číslo 4-5; s. 303 - 310
Hlavní autoři: He, Yong, Wei, Qi, Cheng, T. C. E.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer Nature B.V 01.10.2007
Témata:
ISSN:1094-6136, 1099-1425
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 We consider a single-machine scheduling problem, in which the job processing times are controllable or compressible. The performance criteria are the compression cost and the number of tardy jobs. For the problem, where no tardy jobs are allowed and the objective is to minimize the total compression cost, we present a strongly polynomial time algorithm. For the problem to construct the trade-off curve between the number of tardy jobs and the maximum compression cost, we present a polynomial time algorithm. Furthermore, we extend the problem to the case of discrete controllable processing times, where the processing time of a job can only take one of several given discrete values. We show that even some special cases of the discrete controllable version with the objective of minimizing the total compression cost are NP-hard, but the general case is solvable in pseudo-polynomial time. Moreover, we present a strongly polynomial time algorithm to construct the trade-off curve between the number of tardy jobs and the maximum compression cost for the discrete controllable version. [PUBLICATION ABSTRACT]
AbstractList We consider a single-machine scheduling problem, in which the job processing times are controllable or compressible. The performance criteria are the compression cost and the number of tardy jobs. For the problem, where no tardy jobs are allowed and the objective is to minimize the total compression cost, we present a strongly polynomial time algorithm. For the problem to construct the trade-off curve between the number of tardy jobs and the maximum compression cost, we present a polynomial time algorithm. Furthermore, we extend the problem to the case of discrete controllable processing times, where the processing time of a job can only take one of several given discrete values. We show that even some special cases of the discrete controllable version with the objective of minimizing the total compression cost are NP-hard, but the general case is solvable in pseudo-polynomial time. Moreover, we present a strongly polynomial time algorithm to construct the trade-off curve between the number of tardy jobs and the maximum compression cost for the discrete controllable version.
We consider a single-machine scheduling problem, in which the job processing times are controllable or compressible. The performance criteria are the compression cost and the number of tardy jobs. For the problem, where no tardy jobs are allowed and the objective is to minimize the total compression cost, we present a strongly polynomial time algorithm. For the problem to construct the trade-off curve between the number of tardy jobs and the maximum compression cost, we present a polynomial time algorithm. Furthermore, we extend the problem to the case of discrete controllable processing times, where the processing time of a job can only take one of several given discrete values. We show that even some special cases of the discrete controllable version with the objective of minimizing the total compression cost are NP-hard, but the general case is solvable in pseudo-polynomial time. Moreover, we present a strongly polynomial time algorithm to construct the trade-off curve between the number of tardy jobs and the maximum compression cost for the discrete controllable version. [PUBLICATION ABSTRACT]
Author Wei, Qi
He, Yong
Cheng, T. C. E.
Author_xml – sequence: 1
  givenname: Yong
  surname: He
  fullname: He, Yong
– sequence: 2
  givenname: Qi
  surname: Wei
  fullname: Wei, Qi
– sequence: 3
  givenname: T. C. E.
  surname: Cheng
  fullname: Cheng, T. C. E.
BookMark eNp9kE1LAzEQhoNUsK3-AG_Bg7doPnY37VHELxA8qBcvIZtM7JbdpCZZSv-9qfXkwcMwLy_vDDPPDE188IDQOaNXjFJ5nRhd1owUWYpLIo_QtFhLwipeT350RRommhM0S2lNKV1Izqbo47Xznz2QQZtV5wEnswI79sXE2y6vcI7aAgnO4RbyFsBjPw4tRBwczjraHV6HNmHtLTZh2ERIqQu-6JRP0bHTfYKz3z5H7_d3b7eP5Pnl4en25pkYQUUmuuVCi9pRkKZd8MY5IUwrnZRgeNNSxt2yklo3THNrOWjJbdXU1VIujBXUijm6POzdxPA1Qspq6JKBvtcewpiUKBgErWUJXvwJrsMYfblNccErXlVUlJA8hEwMKUVwynRZ5_JUQdH1ilG1B64OwNVe7oGr_Xr2Z3ITu0HH3T8z330thYA
CitedBy_id crossref_primary_10_1155_2015_826318
crossref_primary_10_1016_j_ejor_2023_01_026
crossref_primary_10_1007_s11518_016_5323_3
crossref_primary_10_1016_j_ijpe_2009_03_003
crossref_primary_10_1007_s10951_020_00658_3
Cites_doi 10.1016/S0377-2217(82)80008-8
10.1287/opre.28.5.1155
10.1016/S0167-6377(96)00035-1
10.1016/0377-2217(94)00187-H
10.1287/moor.23.4.909
10.1287/opre.45.2.302
10.1287/opre.37.6.981
10.1016/0166-218X(90)90105-L
10.1016/S0167-6377(97)00010-2
10.1287/mnsc.15.1.102
ContentType Journal Article
Copyright Springer Science+Business Media, LLC 2007
Copyright_xml – notice: Springer Science+Business Media, LLC 2007
DBID AAYXX
CITATION
3V.
7TA
7TB
7WY
7WZ
7X7
7XB
87Z
88C
8AL
8AO
8FD
8FE
8FG
8FI
8FJ
8FK
8FL
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BEZIV
BGLVJ
CCPQU
DWQXO
FR3
FRNLG
FYUFA
F~G
GHDGH
GNUQQ
HCIFZ
JG9
JQ2
K60
K6~
K7-
K9.
L.-
L.0
M0C
M0N
M0S
M0T
P5Z
P62
PHGZM
PHGZT
PJZUB
PKEHL
PPXIY
PQBIZ
PQBZA
PQEST
PQGLB
PQQKQ
PQUKI
PYYUZ
Q9U
DOI 10.1007/s10951-007-0027-7
DatabaseName CrossRef
ProQuest Central (Corporate)
Materials Business File
Mechanical & Transportation Engineering Abstracts
ABI/INFORM Collection
ABI/INFORM Global (PDF only)
Health & Medical Collection
ProQuest Central (purchase pre-March 2016)
ABI/INFORM Global (Alumni Edition)
Healthcare Administration Database (Alumni)
Computing Database (Alumni Edition)
ProQuest Pharma Collection
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
Hospital Premium Collection
Hospital Premium Collection (Alumni Edition)
ProQuest Central (Alumni) (purchase pre-March 2016)
ABI/INFORM Collection (Alumni Edition)
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central
Business Premium Collection
Technology collection
ProQuest One Community College
ProQuest Central Korea
Engineering Research Database
Business Premium Collection (Alumni)
Health Research Premium Collection
ABI/INFORM Global (Corporate)
Health Research Premium Collection (Alumni)
ProQuest Central Student
SciTech Premium Collection
Materials Research Database
ProQuest Computer Science Collection
ProQuest Business Collection (Alumni Edition)
ProQuest Business Collection
Computer Science Database
ProQuest Health & Medical Complete (Alumni)
ABI/INFORM Professional Advanced
ABI/INFORM Professional Standard
ABI/INFORM Global
Computing Database
Health & Medical Collection (Alumni Edition)
Healthcare Administration Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic
ProQuest Health & Medical Research Collection
ProQuest One Academic Middle East (New)
ProQuest One Health & Nursing
ProQuest One Business
ProQuest One Business (Alumni)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ABI/INFORM Collection China
ProQuest Central Basic
DatabaseTitle CrossRef
Materials Research Database
ProQuest Business Collection (Alumni Edition)
Computer Science Database
ProQuest Central Student
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
SciTech Premium Collection
ABI/INFORM Complete
Materials Business File
ProQuest One Applied & Life Sciences
Health Research Premium Collection
Health & Medical Research Collection
ProQuest Central (New)
Advanced Technologies & Aerospace Collection
Business Premium Collection
ABI/INFORM Global
ProQuest One Academic Eastern Edition
ProQuest Hospital Collection
ProQuest Technology Collection
Health Research Premium Collection (Alumni)
ProQuest Business Collection
ProQuest Hospital Collection (Alumni)
ProQuest Health & Medical Complete
ProQuest One Academic UKI Edition
ProQuest Health Management (Alumni Edition)
Engineering Research Database
ProQuest One Academic
ProQuest One Academic (New)
ABI/INFORM Global (Corporate)
ProQuest One Business
Technology Collection
Technology Research Database
ProQuest One Academic Middle East (New)
Mechanical & Transportation Engineering Abstracts
ProQuest Health & Medical Complete (Alumni)
ProQuest Central (Alumni Edition)
ProQuest One Community College
ProQuest One Health & Nursing
ProQuest Pharma Collection
ProQuest Central
ABI/INFORM Professional Advanced
ProQuest Health & Medical Research Collection
Health and Medicine Complete (Alumni Edition)
ABI/INFORM Professional Standard
ProQuest Central Korea
ABI/INFORM Complete (Alumni Edition)
ProQuest Computing
ABI/INFORM Global (Alumni Edition)
ProQuest Central Basic
ProQuest Computing (Alumni Edition)
ProQuest Health Management
ABI/INFORM China
ProQuest SciTech Collection
Advanced Technologies & Aerospace Database
ProQuest One Business (Alumni)
ProQuest Central (Alumni)
Business Premium Collection (Alumni)
DatabaseTitleList Materials Research Database
Materials Research Database
Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
Business
EISSN 1099-1425
EndPage 310
ExternalDocumentID 1344164611
10_1007_s10951_007_0027_7
Genre Feature
GroupedDBID -Y2
.4S
.86
.VR
06D
0R~
0VY
1N0
1OC
203
29L
2J2
2JN
2JY
2KG
2LR
2VQ
2~H
30V
4.4
406
408
409
40D
40E
5GY
5VS
67Z
6NX
7WY
7X7
8AO
8FE
8FG
8FI
8FJ
8FL
8TC
8UJ
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AAPKM
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYTO
AAYXX
ABAKF
ABBBX
ABBRH
ABBXA
ABDBE
ABDZT
ABECU
ABFSG
ABFTD
ABFTV
ABHLI
ABHQN
ABIJN
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABRTQ
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABUWG
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACHSB
ACHXU
ACIWK
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACSTC
ACZOJ
ADBBV
ADHHG
ADHIR
ADHKG
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMSY
AENEX
AEOHA
AEPYU
AETLH
AEVLU
AEXYK
AEZWR
AFBBN
AFDZB
AFFHD
AFGCZ
AFHIU
AFKRA
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGJBK
AGMZJ
AGQEE
AGQMX
AGQPQ
AGRTI
AGWIL
AGWZB
AGYKE
AHBYD
AHMBA
AHPBZ
AHWEU
AHYZX
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AIXLP
AJBLW
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
AQUVI
ARAPS
ARMRJ
ASPBG
ATHPR
AVWKF
AXYYD
AYFIA
AYQZM
AZFZN
AZQEC
B-.
BA0
BAPOH
BDATZ
BENPR
BEZIV
BGLVJ
BGNMA
BPHCQ
BSONS
BVXVI
CAG
CCPQU
CITATION
COF
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
DU5
DWQXO
EBLON
EBS
EIOEI
EJD
ESBYG
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRNLG
FRRFC
FSGXE
FWDCC
FYUFA
GGCAI
GGRSB
GJIRD
GNUQQ
GNWQR
GQ7
GQ8
GXS
HCIFZ
HF~
HG5
HG6
HLICF
HMCUK
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
I09
IHE
IJ-
IKXTQ
ITM
IWAJR
IXC
IXE
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
J9A
JBSCW
JCJTX
JZLTJ
K60
K6V
K6~
K7-
KDC
KOV
LAW
LLZTM
M0C
M0T
M4Y
MA-
N2Q
NB0
NPVJJ
NQJWS
NU0
O9-
O93
O9G
OAM
P2P
P62
P9M
PF0
PHGZM
PHGZT
PJZUB
PPXIY
PQBIZ
PQBZA
PQGLB
PQQKQ
PROAC
PT4
Q2X
QOS
R89
R9I
ROL
RPX
RSV
S16
S27
S3B
SAP
SBE
SDH
SHX
SISQX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
TSG
TSK
TSV
TUC
U2A
UG4
UKHRP
UOJIU
UTJUX
UZXMN
VC2
VFIZW
W23
W48
WK8
XPP
YLTOR
Z45
ZMTXR
~A9
3V.
7TA
7TB
7XB
8AL
8FD
8FK
AESKC
FR3
JG9
JQ2
K9.
L.-
L.0
M0N
PKEHL
PQEST
PQUKI
Q9U
ID FETCH-LOGICAL-c303t-ab23a35f0e7cb826ff33cb7f77ec26b012f947aa61a2dd2ea72d4654978cd30d3
IEDL.DBID M0C
ISICitedReferencesCount 7
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000249793100007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1094-6136
IngestDate Sun Nov 09 13:23:16 EST 2025
Tue Nov 04 17:00:56 EST 2025
Tue Nov 18 21:29:38 EST 2025
Sat Nov 29 01:47:21 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 4-5
Language English
License http://www.springer.com/tdm
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c303t-ab23a35f0e7cb826ff33cb7f77ec26b012f947aa61a2dd2ea72d4654978cd30d3
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
PQID 232424403
PQPubID 43675
PageCount 8
ParticipantIDs proquest_miscellaneous_30993057
proquest_journals_232424403
crossref_citationtrail_10_1007_s10951_007_0027_7
crossref_primary_10_1007_s10951_007_0027_7
PublicationCentury 2000
PublicationDate 2007-10-01
PublicationDateYYYYMMDD 2007-10-01
PublicationDate_xml – month: 10
  year: 2007
  text: 2007-10-01
  day: 01
PublicationDecade 2000
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle Journal of scheduling
PublicationYear 2007
Publisher Springer Nature B.V
Publisher_xml – name: Springer Nature B.V
References R. L. Daniels (27_CR5) 1989; 37
R. G. Vickson (27_CR12) 1980; 28
J. M. Moore (27_CR8) 1968; 15
L. N. Wassenhove Van (27_CR11) 1982; 11
S. Martello (27_CR7) 1990
P. De (27_CR3) 1995; 81
T. C. E. Cheng (27_CR2) 1996; 19
M. Skutella (27_CR10) 1998; 23
Z.-L. Chen (27_CR1) 1997; 21
P. De (27_CR4) 1997; 45
M. R. Garey (27_CR6) 1978
R. G. Vickson (27_CR13) 1980; 12
E. Nowicki (27_CR9) 1990; 25
References_xml – volume: 11
  start-page: 48
  year: 1982
  ident: 27_CR11
  publication-title: European Journal of Operational Research
  doi: 10.1016/S0377-2217(82)80008-8
– volume: 28
  start-page: 1155
  year: 1980
  ident: 27_CR12
  publication-title: Operations Research
  doi: 10.1287/opre.28.5.1155
– volume: 19
  start-page: 237
  year: 1996
  ident: 27_CR2
  publication-title: Operations Research Letters
  doi: 10.1016/S0167-6377(96)00035-1
– volume: 81
  start-page: 225
  year: 1995
  ident: 27_CR3
  publication-title: European Journal of Operational Research
  doi: 10.1016/0377-2217(94)00187-H
– volume: 23
  start-page: 909
  year: 1998
  ident: 27_CR10
  publication-title: Mathematics of Operations Research
  doi: 10.1287/moor.23.4.909
– volume: 45
  start-page: 302
  year: 1997
  ident: 27_CR4
  publication-title: Operations Research
  doi: 10.1287/opre.45.2.302
– volume-title: Knapsack problems: algorithm and computer implementations
  year: 1990
  ident: 27_CR7
– volume: 37
  start-page: 981
  year: 1989
  ident: 27_CR5
  publication-title: Operations Research
  doi: 10.1287/opre.37.6.981
– volume: 12
  start-page: 258
  year: 1980
  ident: 27_CR13
  publication-title: IIE Transactions
– volume: 25
  start-page: 271
  year: 1990
  ident: 27_CR9
  publication-title: Discrete Applied Mathematics
  doi: 10.1016/0166-218X(90)90105-L
– volume-title: Computers and intractability: a guide to the theory of NP-hardness
  year: 1978
  ident: 27_CR6
– volume: 21
  start-page: 69
  year: 1997
  ident: 27_CR1
  publication-title: Operations Research Letters
  doi: 10.1016/S0167-6377(97)00010-2
– volume: 15
  start-page: 102
  year: 1968
  ident: 27_CR8
  publication-title: Management Science
  doi: 10.1287/mnsc.15.1.102
SSID ssj0008721
Score 1.8043605
Snippet We consider a single-machine scheduling problem, in which the job processing times are controllable or compressible. The performance criteria are the...
SourceID proquest
crossref
SourceType Aggregation Database
Enrichment Source
Index Database
StartPage 303
SubjectTerms Algorithms
Costs
Employment
Job shops
Linear programming
Scheduling
Studies
Title Single-machine scheduling with trade-off between number of tardy jobs and compression cost
URI https://www.proquest.com/docview/232424403
https://www.proquest.com/docview/30993057
Volume 10
WOSCitedRecordID wos000249793100007&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: PRVPQU
  databaseName: ABI/INFORM Collection
  customDbUrl:
  eissn: 1099-1425
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0008721
  issn: 1094-6136
  databaseCode: 7WY
  dateStart: 20030101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/abicomplete
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ABI/INFORM Global (OCUL)
  customDbUrl:
  eissn: 1099-1425
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0008721
  issn: 1094-6136
  databaseCode: M0C
  dateStart: 20030101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/abiglobal
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 1099-1425
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0008721
  issn: 1094-6136
  databaseCode: P5Z
  dateStart: 20030101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1099-1425
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0008721
  issn: 1094-6136
  databaseCode: K7-
  dateStart: 20030101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Health & Medical Collection
  customDbUrl:
  eissn: 1099-1425
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0008721
  issn: 1094-6136
  databaseCode: 7X7
  dateStart: 20030101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/healthcomplete
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Healthcare Administration Database
  customDbUrl:
  eissn: 1099-1425
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0008721
  issn: 1094-6136
  databaseCode: M0T
  dateStart: 20030101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/healthmanagement
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1099-1425
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0008721
  issn: 1094-6136
  databaseCode: BENPR
  dateStart: 20030101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVAVX
  databaseName: SpringerLINK Contemporary 1997-Present
  customDbUrl:
  eissn: 1099-1425
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0008721
  issn: 1094-6136
  databaseCode: RSV
  dateStart: 20030101
  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/eLvHCXMwpV1Lb9QwEB71gRAcaLuAWEoXH3pCskjiJN49IahaVapYrfqApZfITwlUkrJJ-f3MOM5CL71wcRwlkSKNPeNv_Hk-gMM0MamxacH1VBc8F0rwmUxIj7gsHeJn4bwKYhNyPp8ul7NF5Oa0kVY5-MTgqG1jKEf-PkT-PE_Eh9tfnESjaHM1KmhswjYtbIjR9zk5WjviqeyPXSGCQYQkymFTsz85R_ryIU-HwIzL-2HpvlcOoeZk5z9_cheexTUm-9gPij3YcPUIHg8U9xHsDFIOLM7sETz9py7hc7i-wMuN4z8D09IxRMAYkejgOqO8LetWyjreeM8izYv1wiKs8awjKgD70eiWqdoyoqz3VNsa-233Aq5Oji-PTnkUYeAGLdVxpTM0YOETJ41GLOK9EEZLL6UzWakxvvlZLpUqU5VZmzklM0s12hCdGisSK17CVt3U7hUw6TOT-lQjLk5z6dS0MLosTap0oQqvxBiSwQaViRXKSSjjpvpbW5nMVlGXzFbJMbxbf3Lbl-d46OX9wWpVnKlttTbZGN6un-IUo30TVbvmrq0ErqLRLcrXD36_D09C3jcQ_d7AVre6cwfwyPzuvrerCWzKr9-oXcoJbH86ni_O8e5M8kkYs6G9xHZRXGN7fvHlD0JP8aw
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3NT9VAEJ8gGsUD6FPiE5Q96MVkY9ttu30HY4xIIA9fTMSEeKn7mUCgxdcC4Y_yf3Rm2z7hwo2Dp27Sbr92dmZ_szPzA3gTRyY2Ns64LnTGU6EEn8iI-Ijz3CF-Fs6rQDYhZ7Pi8HDybQn-DLkwFFY56MSgqG1tyEf-Plj-NI3Ex7PfnEijaHN1YNDopGLqri4RsTUf9rZxeN8myc6Xg8-7vCcV4Aaf3HKlE3yhzEdOGo1ra--FMFp6KZ1Jco362k9SqVQeq8TaxCmZWKo5hmjLWBFZgfe9B_dTUUiaVlPJF4q_kF2aFyImRGQiHzZRu0w94rMPfkEEglzeNIM3rUAwbTtr_9lPeQKr_RqafeqE_iksuWoED4cQ_hGsDVQVrNdcI3h8re7iM_j5HQ8njp-GSFLHEOGjxaXEfEZ-adbOlXW89p71YWysI05htWcthTqw41o3TFWWUUh-F0pcYbtpn8OPO_n0dViu6sq9ACZ9YmIfa8T9cSqdKjKj89zESmcq80qMIRrGvDR9BXYiAjkp_9WOJjEpqUliUsoxvFt0OevKj9x28cYgJWWviZpyISJj2FqcRRVC-0KqcvV5UwpECaj25ctb-2_Bo92Dr_vl_t5sugErwccdgho3Ybmdn7tX8MBctEfN_HWYFQx-3bXE_QWeA0hY
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Nb9QwEB2VgqpyaGGhYmmhPsAFyWocJ_HuAVWIsqIqWq0ESFUvwZ8SqCRlk4L4afw7ZpxkSy-99cAplhJHTjye8bOf5wG8EIkV1omcm4nJeSa15FOVkB5xUXjEz9IHHcUm1Hw-OT2dLtbgz3AWhmiVg0-MjtrVltbID2Lkz7JEHoSeFbE4mh1e_OAkIEUbrYOaRmchJ_73L0RvzevjI-zql2k6e_fp7XveCwxwi61ouTYpNi4PiVfW4Dw7BCmtUUEpb9PCoO8O00xpXQidOpd6rVJH-ccQeVknEyfxvXfgrkKISWzCRX62CgIT1R35QvSE6EwWw4Zqd2qPtO3jGiGCQq6uh8TrESGGudn2f_yDHsBWP7dmb7rB8BDWfDWCjYHaP4LtQcKC9R5tBPf_ycf4CM4-4uXc8--RYeoZIn-MxHRgn9F6NWuX2nleh8B6ehvrBFVYHVhLFAj2rTYN05VjRNXvKMYVlpv2MXy-lU_fgfWqrvwTYCqkVgRhlJAiU15PcmuKwgptcp0HLceQDP1f2j4zOwmEnJdXOaXJZEoqksmUagyvVlUuurQkNz28O1hM2XuoplyZyxj2V3fRtdB-ka58fdmUEtEDhgP19Mb6-7CBhlZ-OJ6f7MJmXPqOXMc9WG-Xl_4Z3LM_26_N8nkcIAy-3LbB_QVlDVF8
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=Single-machine+scheduling+with+trade-off+between+number+of+tardy+jobs+and+compression+cost&rft.jtitle=Journal+of+scheduling&rft.au=He%2C+Yong&rft.au=Wei%2C+Qi&rft.au=Cheng%2C+T+C+E&rft.date=2007-10-01&rft.issn=1094-6136&rft.volume=10&rft.issue=4-5&rft.spage=303&rft.epage=310&rft_id=info:doi/10.1007%2Fs10951-007-0027-7&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1094-6136&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1094-6136&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1094-6136&client=summon