A competitive algorithm for throughput maximization on identical machines

This paper considers the basic problem of scheduling jobs online with preemption to maximize the number of jobs completed by their deadline on m identical machines. The main result is an O (1) competitive deterministic algorithm for any number of machines m > 1 .

Saved in:
Bibliographic Details
Published in:Mathematical programming Vol. 206; no. 1-2; pp. 497 - 514
Main Authors: Moseley, Benjamin, Pruhs, Kirk, Stein, Clifford, Zhou, Rudy
Format: Journal Article
Language:English
Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.07.2024
Springer
Subjects:
Algorithms
Business schools
Calculus of Variations and Optimal Control; Optimization
Combinatorics
Computer science
Full Length Paper
Management science
Mathematical and Computational Physics
Mathematical Methods in Physics
Mathematics
Mathematics and Statistics
Mathematics of Computing
Numerical Analysis
Theoretical
68W40
Scheduling
Online algorithm
68W25
Competitive analysis
ISSN:0025-5610, 1436-4646
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract This paper considers the basic problem of scheduling jobs online with preemption to maximize the number of jobs completed by their deadline on m identical machines. The main result is an O (1) competitive deterministic algorithm for any number of machines m > 1 .
AbstractList This paper considers the basic problem of scheduling jobs online with preemption to maximize the number of jobs completed by their deadline on m identical machines. The main result is an O (1) competitive deterministic algorithm for any number of machines m > 1 .
This paper considers the basic problem of scheduling jobs online with preemption to maximize the number of jobs completed by their deadline on m identical machines. The main result is an O (1) competitive deterministic algorithm for any number of machines $$m >1$$ m > 1 .
This paper considers the basic problem of scheduling jobs online with preemption to maximize the number of jobs completed by their deadline on m identical machines. The main result is an O(1) competitive deterministic algorithm for any number of machines [Formula omitted].
Audience Academic
Author Zhou, Rudy
Stein, Clifford
Pruhs, Kirk
Moseley, Benjamin
Author_xml – sequence: 1
  givenname: Benjamin
  surname: Moseley
  fullname: Moseley, Benjamin
  organization: Tepper School of Business, Carnegie Mellon University
– sequence: 2
  givenname: Kirk
  surname: Pruhs
  fullname: Pruhs, Kirk
  organization: Computer Science Department, University of Pittsburgh
– sequence: 3
  givenname: Clifford
  surname: Stein
  fullname: Stein, Clifford
  organization: Industrial Engineering and Operations Research, Columbia University
– sequence: 4
  givenname: Rudy
  orcidid: 0000-0001-5037-4885
  surname: Zhou
  fullname: Zhou, Rudy
  email: rbz@andrew.cmu.edu
  organization: Tepper School of Business, Carnegie Mellon University
BookMark eNp9kF9PwyAQwInRxG36BXzqF-g8oED7uCz-WbLEF30mjELL0pYFmFE_vWh9NsflEuB3ufst0eXkJ4PQHYY1BhD3EQMGUQKhOaFiJVygBa4oLyte8Uu0ACCsZBzDNVrGeAQATOt6gXabQvvxZJJL7t0Uauh8cKkfC-tDkfrgz11_OqdiVB9udF8qOT8V-bjWTMlpNeQX3bvJxBt0ZdUQze1fXaG3x4fX7XO5f3nabTf7UlPCUnmw1AoO0GLCGdFCtZqKFjfUGM4OjJM8NKdcWNbWBFcqjylapitCuKhaQegKree-nRqMdJP1KSidozWj01mLdfl-U-eFedM0LANkBnTwMQZj5Sm4UYVPiUH-2JOzPZntyV97EjJEZyjmz1Nngjz6c5jyYv9R33Qdc68
Cites_doi 10.1007/s10107-020-01469-2
10.1016/0304-3975(94)90165-1
10.1007/s00453-001-0068-9
10.1137/17M116032X
10.1016/S0196-6774(03)00074-9
10.1007/BF00365406
10.1145/347476.347479
10.1006/jagm.2000.1128
10.1016/j.orl.2017.11.013
10.1145/2486159.2486187
10.1109/RTSS.2017.00039
10.1007/978-3-031-06901-7_30
ContentType Journal Article
Copyright The Author(s) 2024
COPYRIGHT 2024 Springer
Copyright_xml – notice: The Author(s) 2024
– notice: COPYRIGHT 2024 Springer
DBID C6C
AAYXX
CITATION
DOI 10.1007/s10107-023-02045-0
DatabaseName Springer Nature OA Free Journals (WRLC)
CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Mathematics
Computer Science
EISSN 1436-4646
EndPage 514
ExternalDocumentID A802569995
10_1007_s10107_023_02045_0
GrantInformation_xml – fundername: Carnegie Mellon University
GroupedDBID --K
--Z
-52
-5D
-5G
-BR
-EM
-Y2
-~C
-~X
.4S
.86
.DC
.VR
06D
0R~
0VY
199
1B1
1N0
1OL
1SB
203
28-
29M
2J2
2JN
2JY
2KG
2KM
2LR
2P1
2VQ
2~H
30V
3V.
4.4
406
408
409
40D
40E
5GY
5QI
5VS
67Z
6NX
6TJ
78A
7WY
88I
8AO
8FE
8FG
8FL
8TC
8UJ
8VB
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYTO
AAYZH
ABAKF
ABBBX
ABBXA
ABDBF
ABDZT
ABECU
ABFTV
ABHLI
ABHQN
ABJCF
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABUWG
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACGOD
ACHSB
ACHXU
ACIWK
ACKNC
ACMDZ
ACMLO
ACNCT
ACOKC
ACOMO
ACPIV
ACUHS
ACZOJ
ADHHG
ADHIR
ADIMF
ADINQ
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFIE
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMOZ
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AFBBN
AFEXP
AFFNX
AFGCZ
AFKRA
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGGDS
AGJBK
AGMZJ
AGQEE
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHQJS
AHSBF
AHYZX
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJBLW
AJRNO
AJZVZ
AKVCP
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARAPS
ARCSS
ARMRJ
ASPBG
AVWKF
AXYYD
AYJHY
AZFZN
AZQEC
B-.
B0M
BA0
BAPOH
BBWZM
BDATZ
BENPR
BEZIV
BGLVJ
BGNMA
BPHCQ
BSONS
C6C
CAG
CCPQU
COF
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
DU5
DWQXO
EAD
EAP
EBA
EBLON
EBR
EBS
EBU
ECS
EDO
EIOEI
EJD
EMI
EMK
EPL
ESBYG
EST
ESX
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRNLG
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNUQQ
GNWQR
GQ6
GQ7
GQ8
GROUPED_ABI_INFORM_COMPLETE
GXS
H13
HCIFZ
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
H~9
I-F
I09
IAO
IHE
IJ-
IKXTQ
ITM
IWAJR
IXC
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
K1G
K60
K6V
K6~
K7-
KDC
KOV
KOW
L6V
LAS
LLZTM
M0C
M0N
M2P
M4Y
M7S
MA-
N2Q
N9A
NB0
NDZJH
NPVJJ
NQ-
NQJWS
NU0
O9-
O93
O9G
O9I
O9J
OAM
P19
P2P
P62
P9R
PF0
PQBIZ
PQBZA
PQQKQ
PROAC
PT4
PT5
PTHSS
Q2X
QOK
QOS
QWB
R4E
R89
R9I
RHV
RIG
RNI
RNS
ROL
RPX
RPZ
RSV
RZK
S16
S1Z
S26
S27
S28
S3B
SAP
SCLPG
SDD
SDH
SDM
SHX
SISQX
SJYHP
SMT
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
T16
TH9
TN5
TSG
TSK
TSV
TUC
TUS
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
W23
W48
WH7
WK8
XPP
YLTOR
Z45
Z5O
Z7R
Z7S
Z7X
Z7Y
Z7Z
Z81
Z83
Z86
Z88
Z8M
Z8N
Z8R
Z8T
Z8W
Z92
ZL0
ZMTXR
ZWQNP
~02
~8M
~EX
AAPKM
AAYXX
ABBRH
ABDBE
ABFSG
ABRTQ
ACSTC
ADHKG
ADXHL
AEZWR
AFDZB
AFFHD
AFHIU
AFOHR
AGQPQ
AHPBZ
AHWEU
AIXLP
AMVHM
ATHPR
AYFIA
CITATION
PHGZM
PHGZT
PQGLB
ID FETCH-LOGICAL-c325t-bf3f7600d12652c7adc37d193ee65b5624366367f5d8214a1387d5c422674d723
IEDL.DBID RSV
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001140224400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0025-5610
IngestDate Sat Nov 29 10:31:10 EST 2025
Sat Nov 29 03:34:04 EST 2025
Fri Feb 21 02:40:00 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1-2
Keywords 68W40
Scheduling
Online algorithm
68W25
Competitive analysis
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c325t-bf3f7600d12652c7adc37d193ee65b5624366367f5d8214a1387d5c422674d723
ORCID 0000-0001-5037-4885
OpenAccessLink https://link.springer.com/10.1007/s10107-023-02045-0
PageCount 18
ParticipantIDs gale_infotracacademiconefile_A802569995
crossref_primary_10_1007_s10107_023_02045_0
springer_journals_10_1007_s10107_023_02045_0
PublicationCentury 2000
PublicationDate 20240700
2024-07-00
20240701
PublicationDateYYYYMMDD 2024-07-01
PublicationDate_xml – month: 7
  year: 2024
  text: 20240700
PublicationDecade 2020
PublicationPlace Berlin/Heidelberg
PublicationPlace_xml – name: Berlin/Heidelberg
PublicationSubtitle A Publication of the Mathematical Optimization Society
PublicationTitle Mathematical programming
PublicationTitleAbbrev Math. Program
PublicationYear 2024
Publisher Springer Berlin Heidelberg
Springer
Publisher_xml – name: Springer Berlin Heidelberg
– name: Springer
References Kalyanasundaram, Pruhs (CR9) 2003; 49
Baruah, Koren, Mao, Mishra, Raghunathan, Rosier, Shasha, Wang (CR2) 1992; 4
Kalyanasundaram, Pruhs (CR8) 2001; 38
Koren, Shasha (CR10) 1994; 128
CR6
CR5
Azar, Cohen (CR1) 2018; 46
CR12
CR11
Kalyanasundaram, Pruhs (CR7) 2000; 47
Chen, Megow, Schewior (CR4) 2018; 47
Chen, Eberle, Megow, Schewior, Stein (CR3) 2020; 183
Phillips, Stein, Torng, Wein (CR13) 2002; 32
L Chen (2045_CR4) 2018; 47
CA Phillips (2045_CR13) 2002; 32
L Chen (2045_CR3) 2020; 183
B Kalyanasundaram (2045_CR8) 2001; 38
B Kalyanasundaram (2045_CR7) 2000; 47
2045_CR11
Y Azar (2045_CR1) 2018; 46
B Kalyanasundaram (2045_CR9) 2003; 49
G Koren (2045_CR10) 1994; 128
2045_CR12
SK Baruah (2045_CR2) 1992; 4
2045_CR5
2045_CR6
References_xml – volume: 183
  start-page: 215
  issue: 1
  year: 2020
  end-page: 247
  ident: CR3
  article-title: A general framework for handling commitment in online throughput maximization
  publication-title: Math. Program.
  doi: 10.1007/s10107-020-01469-2
– volume: 128
  start-page: 75
  issue: 1 &2
  year: 1994
  end-page: 97
  ident: CR10
  article-title: MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/0304-3975(94)90165-1
– volume: 32
  start-page: 163
  issue: 2
  year: 2002
  end-page: 200
  ident: CR13
  article-title: Optimal time-critical scheduling via resource augmentation
  publication-title: Algorithmica
  doi: 10.1007/s00453-001-0068-9
– volume: 47
  start-page: 2057
  issue: 6
  year: 2018
  end-page: 2077
  ident: CR4
  article-title: An o(log m)-competitive algorithm for online machine minimization
  publication-title: SIAM J. Comput.
  doi: 10.1137/17M116032X
– ident: CR12
– volume: 49
  start-page: 63
  issue: 1
  year: 2003
  end-page: 85
  ident: CR9
  article-title: Maximizing job completions online
  publication-title: J. Algorithms
  doi: 10.1016/S0196-6774(03)00074-9
– ident: CR11
– volume: 4
  start-page: 125
  issue: 2
  year: 1992
  end-page: 144
  ident: CR2
  article-title: On the competitiveness of on-line real-time task scheduling
  publication-title: Real Time Syst.
  doi: 10.1007/BF00365406
– ident: CR6
– volume: 47
  start-page: 617
  issue: 4
  year: 2000
  end-page: 643
  ident: CR7
  article-title: Speed is as powerful as clairvoyance
  publication-title: J. ACM
  doi: 10.1145/347476.347479
– volume: 38
  start-page: 2
  issue: 1
  year: 2001
  end-page: 24
  ident: CR8
  article-title: Eliminating migration in multi-processor scheduling
  publication-title: J. Algorithms
  doi: 10.1006/jagm.2000.1128
– ident: CR5
– volume: 46
  start-page: 128
  issue: 1
  year: 2018
  end-page: 133
  ident: CR1
  article-title: An improved algorithm for online machine minimization
  publication-title: Oper. Res. Lett.
  doi: 10.1016/j.orl.2017.11.013
– ident: 2045_CR5
– volume: 183
  start-page: 215
  issue: 1
  year: 2020
  ident: 2045_CR3
  publication-title: Math. Program.
  doi: 10.1007/s10107-020-01469-2
– volume: 47
  start-page: 2057
  issue: 6
  year: 2018
  ident: 2045_CR4
  publication-title: SIAM J. Comput.
  doi: 10.1137/17M116032X
– volume: 49
  start-page: 63
  issue: 1
  year: 2003
  ident: 2045_CR9
  publication-title: J. Algorithms
  doi: 10.1016/S0196-6774(03)00074-9
– ident: 2045_CR11
  doi: 10.1145/2486159.2486187
– volume: 32
  start-page: 163
  issue: 2
  year: 2002
  ident: 2045_CR13
  publication-title: Algorithmica
  doi: 10.1007/s00453-001-0068-9
– volume: 47
  start-page: 617
  issue: 4
  year: 2000
  ident: 2045_CR7
  publication-title: J. ACM
  doi: 10.1145/347476.347479
– volume: 38
  start-page: 2
  issue: 1
  year: 2001
  ident: 2045_CR8
  publication-title: J. Algorithms
  doi: 10.1006/jagm.2000.1128
– volume: 46
  start-page: 128
  issue: 1
  year: 2018
  ident: 2045_CR1
  publication-title: Oper. Res. Lett.
  doi: 10.1016/j.orl.2017.11.013
– volume: 128
  start-page: 75
  issue: 1 &2
  year: 1994
  ident: 2045_CR10
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/0304-3975(94)90165-1
– volume: 4
  start-page: 125
  issue: 2
  year: 1992
  ident: 2045_CR2
  publication-title: Real Time Syst.
  doi: 10.1007/BF00365406
– ident: 2045_CR6
  doi: 10.1109/RTSS.2017.00039
– ident: 2045_CR12
  doi: 10.1007/978-3-031-06901-7_30
SSID ssj0001388
Score 2.4222414
Snippet This paper considers the basic problem of scheduling jobs online with preemption to maximize the number of jobs completed by their deadline on m identical...
This paper considers the basic problem of scheduling jobs online with preemption to maximize the number of jobs completed by their deadline on m identical...
SourceID gale
crossref
springer
SourceType Aggregation Database
Index Database
Publisher
StartPage 497
SubjectTerms Algorithms
Business schools
Calculus of Variations and Optimal Control; Optimization
Combinatorics
Computer science
Full Length Paper
Management science
Mathematical and Computational Physics
Mathematical Methods in Physics
Mathematics
Mathematics and Statistics
Mathematics of Computing
Numerical Analysis
Theoretical
Title A competitive algorithm for throughput maximization on identical machines
URI https://link.springer.com/article/10.1007/s10107-023-02045-0
Volume 206
WOSCitedRecordID wos001140224400001&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: 1436-4646
  dateEnd: 20241208
  omitProxy: false
  ssIdentifier: ssj0001388
  issn: 0025-5610
  databaseCode: 7WY
  dateStart: 20240101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/abicomplete
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ABI/INFORM Global
  customDbUrl:
  eissn: 1436-4646
  dateEnd: 20241208
  omitProxy: false
  ssIdentifier: ssj0001388
  issn: 0025-5610
  databaseCode: M0C
  dateStart: 20240101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/abiglobal
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1436-4646
  dateEnd: 20241208
  omitProxy: false
  ssIdentifier: ssj0001388
  issn: 0025-5610
  databaseCode: K7-
  dateStart: 20240101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 1436-4646
  dateEnd: 20241208
  omitProxy: false
  ssIdentifier: ssj0001388
  issn: 0025-5610
  databaseCode: M7S
  dateStart: 20240101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest advanced technologies & aerospace journals
  customDbUrl:
  eissn: 1436-4646
  dateEnd: 20241208
  omitProxy: false
  ssIdentifier: ssj0001388
  issn: 0025-5610
  databaseCode: P5Z
  dateStart: 20240101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1436-4646
  dateEnd: 20241208
  omitProxy: false
  ssIdentifier: ssj0001388
  issn: 0025-5610
  databaseCode: BENPR
  dateStart: 20240101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Science Database
  customDbUrl:
  eissn: 1436-4646
  dateEnd: 20241208
  omitProxy: false
  ssIdentifier: ssj0001388
  issn: 0025-5610
  databaseCode: M2P
  dateStart: 20240101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/sciencejournals
  providerName: ProQuest
– providerCode: PRVAVX
  databaseName: SpringerLINK Contemporary 1997-Present
  customDbUrl:
  eissn: 1436-4646
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001388
  issn: 0025-5610
  databaseCode: RSV
  dateStart: 19970101
  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/eLvHCXMwnV1LS8QwEA6iHvTgW1xf5CB40MD2kSY9LuKiBxfxxd5CmqRacB-0XfHnO8mm6y6IoNBLaUnLTGbma2e-GYTOsizQkvI2CRKekjjUCUkTHpE8ybnM7cRCpdywCdbr8X4_vfeksKqpdm9Sks5Tz5HdAvtbLbR5RwAiBD7UVyDccWuOD48vM_8bRJw3g1otOvBUmZ_XWAhHjVNeTIm6SNPd_N87bqENjyxxZ7oVttGSGe6g9bl-g3B2N2vSWu2i2w5WDjW78iEs319HZVG_DTDgWOzn94wnNR7Iz2Lg6ZoYjsJxe0G3cMVWYppqDz13r5-uboifrEBUFNKaZHmU24ycDsKEhopJrSKmAcsZk9AMIFEcARJJWE41D4NYgkiZpsqyblmsWRjto-XhaGgOEDaapxDwWGoyGsdpO8u4SbWRgbKTTGLVQheNgMV42kBDfLdKtuISIC7hxCXaLXRudSCsddWlVNKTBOBZtk-V6HCL0QDU0ha6bFQgvNlVvyx8-Lfbj9BaCOhlWpd7jJbrcmJO0Kr6qIuqPHX77Qv1gs2D
linkProvider Springer Nature
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1bS8MwFA4yBfXBuzivfRB80MJ6SZM-DnFsuA3RKXsLaZLqwF1oO_Hne5KlcwMRFPpSWtJyTpLzted850PoMkk8yTGtuV5EYzf0ZeTGEQ3cNEopT7VioRBGbIJ0u7Tfjx8sKSwvq93LlKTZqRfIbp7-rebrvCMAERc-1FdDiFi6kO_x6WW-_3oBpaVQq0YHlirz8xhL4ajclJdToibSNLb_9447aMsiS6c-mwq7aEWN9tDmQr9BOOvMm7Tm-6hVd4RBzaZ8yOHvr-NsULwNHcCxjtXvmUwLZ8g_B0NL13TgGBhuL_gWruhKTJUfoOfGXe-26VplBVcEPi7cJA1SnZGTnh9hXxAuRUAkYDmlIpwAJAoDQCIRSbGkvhdyMCmRWGjWLQkl8YNDVBmNR-oIOUrSGAIeiVWCwzCuJQlVsVTcE1rJJBRVdF0amE1mDTTYd6tkbS4G5mLGXKxWRVfaB0yvriLjgluSADxL96lidaoxGoBaXEU3pQuYXXb5LwMf_-32C7Te7HXarN3q3p-gDR-QzKxG9xRVimyqztCa-CgGeXZu5t4XoVHQZw
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1bS8MwFA6iIvrgXZzXPAg-aNiaNm36ONThUMfAC3sLaZJqwXWj7cSfb5K2cwMRROhLaUnLObl8yTnf-QA4iyJHckJbyPFpiDwsfRT61EWxH1MeG8VCIazYRNDr0cEg7M-w-G22ex2SLDkNpkpTWjTHMm7OEN8cc8SGTQxSgxKkN-1LnhENMvv1x5fpXOy4lNairQYpVLSZn9uYW5rqCXo-PGpXnc7G__93E6xXiBO2yy6yBRZUug3WZuoQ6ruHafHWfAd021BYNG3TiiB_fx1lSfE2hBrfwkrXZzwp4JB_JsOKxgn1lVjOr_a5fmIyNFW-C547N09Xt6hSXEDCxaRAUezGJlInHewTLAIuhRtIjfGU8kmkoZLnaoTiBzGRFDse1-YNJBGGjRt4MsDuHlhMR6naB1BJGuqFMAhVRDwvbEURVaFU3BFG4cQTDXBRG5uNy8Ia7LuEsjEX0-Zi1lys1QDnxh_MjLoi44JX5AH9LVO_irWpwW4a7JIGuKzdwarhmP_S8MHfXj8FK_3rDrvv9u4OwSrWAKdM3T0Ci0U2UcdgWXwUSZ6d2G74BYS62Us
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+competitive+algorithm+for+throughput+maximization+on+identical+machines&rft.jtitle=Mathematical+programming&rft.au=Moseley%2C+Benjamin&rft.au=Pruhs%2C+Kirk&rft.au=Stein%2C+Clifford&rft.au=Zhou%2C+Rudy&rft.date=2024-07-01&rft.pub=Springer+Berlin+Heidelberg&rft.issn=0025-5610&rft.eissn=1436-4646&rft.volume=206&rft.issue=1-2&rft.spage=497&rft.epage=514&rft_id=info:doi/10.1007%2Fs10107-023-02045-0&rft.externalDocID=10_1007_s10107_023_02045_0
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0025-5610&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0025-5610&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0025-5610&client=summon