Improved Approximation Schemes for Early Work Scheduling on Identical Parallel Machines with a Common Due Date

We study the early work scheduling problem on identical parallel machines in order to maximize the total early work, i.e., the parts of non-preemptive jobs that are executed before a common due date. By preprocessing and constructing an auxiliary instance which has several good properties, for any d...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of the Operations Research Society of China (Internet) Ročník 12; číslo 2; s. 341 - 350
Hlavný autor: Li, Wei-Dong
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2024
Springer Nature B.V
Predmet:
Accuracy
Algorithms
Approximation
Employment
Management Science
Mathematics
Mathematics and Statistics
Operations Research
Polynomials
Preempting
Schedules
Scheduling
Workloads
China
90B35
Fully polynomial time approximation scheme
Polynomial time approximation scheme
Scheduling
68M20
Early work
Efficient polynomial time approximation scheme
ISSN:2194-668X, 2194-6698
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract We study the early work scheduling problem on identical parallel machines in order to maximize the total early work, i.e., the parts of non-preemptive jobs that are executed before a common due date. By preprocessing and constructing an auxiliary instance which has several good properties, for any desired accuracy ε , we propose an efficient polynomial time approximation scheme with running time O f ( 1 / ε n ) , where n is the number of jobs and f ( 1 / ε ) is exponential in 1 / ε , and a fully polynomial time approximation scheme with running time O 1 ε 2 m + 1 + n when the number of machines is fixed.
AbstractList We study the early work scheduling problem on identical parallel machines in order to maximize the total early work, i.e., the parts of non-preemptive jobs that are executed before a common due date. By preprocessing and constructing an auxiliary instance which has several good properties, for any desired accuracy ε , we propose an efficient polynomial time approximation scheme with running time O f ( 1 / ε n ) , where n is the number of jobs and f ( 1 / ε ) is exponential in 1 / ε , and a fully polynomial time approximation scheme with running time O 1 ε 2 m + 1 + n when the number of machines is fixed.
We study the early work scheduling problem on identical parallel machines in order to maximize the total early work, i.e., the parts of non-preemptive jobs that are executed before a common due date. By preprocessing and constructing an auxiliary instance which has several good properties, for any desired accuracy ε, we propose an efficient polynomial time approximation scheme with running time Of(1/εn), where n is the number of jobs and f(1/ε) is exponential in 1/ε, and a fully polynomial time approximation scheme with running time O1ε2m+1+n when the number of machines is fixed.
Author Li, Wei-Dong
Author_xml – sequence: 1
  givenname: Wei-Dong
  orcidid: 0000-0003-3094-4347
  surname: Li
  fullname: Li, Wei-Dong
  email: weidongmath@126.com
  organization: School of Mathematics and Statistics, Yunnan University
BookMark eNp9kFFLwzAQx4NMcM59AZ8CPlcvadJ2j2ObOpgoqOhbSNN0i7bpTFp13964iYIPe8px_H-Xu98x6tnGaoROCZwTgPTCM4iBR0BpBMCARpsD1KdkxKIkGWW93zp7PkJD700OnGacJ0D6yM7rtWvedYHH61B8mlq2prH4Xq10rT0uG4dn0lUb_NS412276CpjlziE5oW2rVGywnfSyarSFb6RamVsAD9Mu8IST5q6Dslpp_FUtvoEHZay8nr48w7Q4-XsYXIdLW6v5pPxIlIxGbWRTMN6DMo0TjNecEYp00WuVC4hpaOc8TyjiSI5pyQ0ISeU5QCgyqyQCUtoPEBnu7nhprdO-1a8NJ2z4UsRVCWUE5bykMp2KeUa750uhTLt9v7WSVMJAuJbsNgJFkGw2AoWm4DSf-jaBXdusx-Kd5APYbvU7m-rPdQX8ySQWg
CitedBy_id crossref_primary_10_1109_ACCESS_2022_3225448
crossref_primary_10_1016_j_cie_2022_108386
crossref_primary_10_1007_s40305_023_00511_2
crossref_primary_10_1016_j_cor_2025_107144
crossref_primary_10_3390_computation12040068
crossref_primary_10_1007_s10878_022_00981_9
Cites_doi 10.1016/j.ejor.2020.03.032
10.1016/j.ejor.2019.12.003
10.1016/j.dam.2020.05.023
10.1016/j.cie.2020.106449
10.1007/s10957-017-1147-7
10.1007/s10951-015-0464-7
10.1016/j.omega.2010.06.006
10.1287/moor.8.4.538
ContentType Journal Article
Copyright Operations Research Society of China, Periodicals Agency of Shanghai University, Science Press, and Springer-Verlag GmbH Germany, part of Springer Nature 2022
Operations Research Society of China, Periodicals Agency of Shanghai University, Science Press, and Springer-Verlag GmbH Germany, part of Springer Nature 2022.
Copyright_xml – notice: Operations Research Society of China, Periodicals Agency of Shanghai University, Science Press, and Springer-Verlag GmbH Germany, part of Springer Nature 2022
– notice: Operations Research Society of China, Periodicals Agency of Shanghai University, Science Press, and Springer-Verlag GmbH Germany, part of Springer Nature 2022.
DBID AAYXX
CITATION
3V.
7RO
7XB
8AI
8FE
8FG
8FK
ABJCF
ABUWG
AFKRA
AXJJW
BENPR
BEZIV
BGLVJ
CCPQU
DWQXO
FREBS
FRNLG
HCIFZ
K60
K6~
L6V
M7S
PHGZM
PHGZT
PKEHL
PQBIZ
PQBZA
PQEST
PQGLB
PQQKQ
PQUKI
PTHSS
Q9U
DOI 10.1007/s40305-022-00402-y
DatabaseName CrossRef
ProQuest Central (Corporate)
Asian Business Database
ProQuest Central (purchase pre-March 2016)
Asian Business Database (Alumni Edition)
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Asian & European Business Collection
ProQuest Central
Business Premium Collection
ProQuest Technology Collection
ProQuest One Community College
ProQuest Central Korea
Asian & European Business Collection (Alumni)
Business Premium Collection (Alumni)
SciTech Premium Collection
ProQuest Business Collection (Alumni Edition)
ProQuest Business Collection
ProQuest Engineering Collection
Engineering Database
ProQuest Central Premium
ProQuest One Academic
ProQuest One Academic Middle East (New)
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
Engineering Collection
ProQuest Central Basic
DatabaseTitle CrossRef
ProQuest Business Collection (Alumni Edition)
ProQuest One Business
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Asian Business & Reference
Asian & European Business Collection
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
Asian & European Business Collection (Alumni)
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Asian Business and Reference (Alumni Edition)
ProQuest Engineering Collection
ProQuest Central Korea
ProQuest Central (New)
Engineering Collection
Business Premium Collection
Engineering Database
ProQuest Central Basic
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Business Collection
ProQuest One Academic UKI Edition
Materials Science & Engineering Collection
ProQuest One Business (Alumni)
ProQuest One Academic
ProQuest Central (Alumni)
Business Premium Collection (Alumni)
ProQuest One Academic (New)
DatabaseTitleList
ProQuest Business Collection (Alumni Edition)
Database_xml – sequence: 1
  dbid: AXJJW
  name: Asian & European Business Collection (ProQuest)
  url: https://search.proquest.com/asianeuropeanbusiness
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Mathematics
EISSN 2194-6698
EndPage 350
ExternalDocumentID 10_1007_s40305_022_00402_y
GeographicLocations China
GeographicLocations_xml – name: China
GrantInformation_xml – fundername: National Natural Science Foundation of China
  grantid: 12071417
  funderid: http://dx.doi.org/10.13039/501100001809
GroupedDBID -EM
0R~
30V
4.4
406
96X
AAAVM
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYTO
AAZMS
ABAKF
ABBXA
ABDZT
ABECU
ABFTV
ABJCF
ABJNI
ABJOX
ABKCH
ABMQK
ABQBU
ABTEG
ABTKH
ABTMW
ABUWG
ABXPI
ACAOD
ACDTI
ACGFS
ACHSB
ACIWK
ACKNC
ACMLO
ACOKC
ACPIV
ACZOJ
ADHHG
ADHIR
ADINQ
ADKNI
ADRFC
ADURQ
ADYFF
ADZKW
AEBTG
AEFQL
AEGNC
AEJHL
AEJRE
AEMSY
AEOHA
AEPYU
AESKC
AETCA
AEVLU
AEXYK
AFBBN
AFKRA
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGJBK
AGMZJ
AGQEE
AGQMX
AGRTI
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHSBF
AHYZX
AIAKS
AIGIU
AILAN
AITGF
AJBLW
AJRNO
AJZVZ
AKLTO
ALFXC
ALMA_UNASSIGNED_HOLDINGS
AMKLP
AMXSW
AMYLF
AMYQR
ANMIH
ASPBG
AUKKA
AVWKF
AVXWI
AXJJW
AXYYD
AZFZN
BAPOH
BENPR
BEZIV
BGLVJ
BGNMA
CCPQU
DNIVK
DPUIP
DWQXO
EBLON
EBS
EIOEI
EJD
ESBYG
FEDTE
FERAY
FIGPU
FINBP
FNLPD
FRNLG
FRRFC
FSGXE
FYJPI
GGCAI
GGRSB
GJIRD
HCIFZ
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
I0C
IKXTQ
IWAJR
J-C
JBSCW
JCJTX
JZLTJ
KOV
LLZTM
M4Y
M7S
NPVJJ
NQJWS
NU0
O9-
O93
O9J
PQBIZ
PQBZA
PQQKQ
PT4
PTHSS
RLLFE
ROL
RSV
SCL
SHX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
TSG
UG4
UOJIU
UTJUX
UZXMN
VFIZW
W48
ZMTXR
AAYXX
ABBRH
ABDBE
ABFSG
ABRTQ
ACSTC
AEZWR
AFDZB
AFFHD
AFHIU
AFOHR
AHPBZ
AHWEU
AIXLP
ATHPR
AYFIA
CITATION
PHGZM
PHGZT
PQGLB
3V.
7RO
7XB
8AI
8FE
8FG
8FK
K60
K6~
L6V
PKEHL
PQEST
PQUKI
Q9U
ID FETCH-LOGICAL-c319t-a755640f73785d54224edbccba0729b45b826c1b521ccb0b124b000cf8da64623
IEDL.DBID RSV
ISICitedReferencesCount 11
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000812057900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2194-668X
IngestDate Wed Nov 05 04:18:48 EST 2025
Tue Nov 18 21:09:29 EST 2025
Sat Nov 29 05:55:49 EST 2025
Fri Feb 21 02:40:26 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 2
Keywords 90B35
Fully polynomial time approximation scheme
Polynomial time approximation scheme
Scheduling
68M20
Early work
Efficient polynomial time approximation scheme
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c319t-a755640f73785d54224edbccba0729b45b826c1b521ccb0b124b000cf8da64623
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0003-3094-4347
PQID 3056251475
PQPubID 2043982
PageCount 10
ParticipantIDs proquest_journals_3056251475
crossref_citationtrail_10_1007_s40305_022_00402_y
crossref_primary_10_1007_s40305_022_00402_y
springer_journals_10_1007_s40305_022_00402_y
PublicationCentury 2000
PublicationDate 20240600
2024-06-00
20240601
PublicationDateYYYYMMDD 2024-06-01
PublicationDate_xml – month: 6
  year: 2024
  text: 20240600
PublicationDecade 2020
PublicationPlace Berlin/Heidelberg
PublicationPlace_xml – name: Berlin/Heidelberg
– name: Heidelberg
PublicationTitle Journal of the Operations Research Society of China (Internet)
PublicationTitleAbbrev J. Oper. Res. Soc. China
PublicationYear 2024
Publisher Springer Berlin Heidelberg
Springer Nature B.V
Publisher_xml – name: Springer Berlin Heidelberg
– name: Springer Nature B.V
References Chen, Liang, Sterna, Wang, Błażewicz (CR1) 2020; 284
Chen, Sterna, Han, Błażewicz (CR6) 2016; 19
Chen, Kovalev, Liu, Sterna, Chalamon, Błażewicz (CR7) 2020
Györgyi, Kis (CR5) 2020; 286
Sterna, Czerniachowska (CR2) 2017; 174
Chen, Wang, Xie, Zhang, Sterna, Błażewicz (CR4) 2020; 144
Sterna (CR3) 2011; 39
Lenstra (CR8) 1983; 8
P Györgyi (402_CR5) 2020; 286
X Chen (402_CR6) 2016; 19
X Chen (402_CR1) 2020; 284
HW Lenstra Jr (402_CR8) 1983; 8
M Sterna (402_CR2) 2017; 174
M Sterna (402_CR3) 2011; 39
X Chen (402_CR4) 2020; 144
X Chen (402_CR7) 2020
References_xml – volume: 286
  start-page: 129
  issue: 1
  year: 2020
  end-page: 137
  ident: CR5
  article-title: A common approximation framework for early work, late work, and resource leveling problems
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2020.03.032
– volume: 284
  start-page: 67
  issue: 1
  year: 2020
  end-page: 74
  ident: CR1
  article-title: Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2019.12.003
– year: 2020
  ident: CR7
  article-title: Semi-online scheduling on two identical machines with a common due date to maximize total early work
  publication-title: Discrete. Appl. Math.
  doi: 10.1016/j.dam.2020.05.023
– volume: 144
  start-page: 106449
  year: 2020
  ident: CR4
  article-title: Exact and heuristic algorithms for scheduling on two identical machines with early work maximization
  publication-title: Comput. Ind. Eng.
  doi: 10.1016/j.cie.2020.106449
– volume: 174
  start-page: 927
  year: 2017
  end-page: 944
  ident: CR2
  article-title: Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
  publication-title: J. Optimiz. Theory. App.
  doi: 10.1007/s10957-017-1147-7
– volume: 19
  start-page: 729
  year: 2016
  end-page: 736
  ident: CR6
  article-title: Scheduling on parallel identical machines with late work criterion: offline and online cases
  publication-title: J. Sched.
  doi: 10.1007/s10951-015-0464-7
– volume: 39
  start-page: 120
  issue: 2
  year: 2011
  end-page: 129
  ident: CR3
  article-title: A survey of scheduling problems with late work criteria
  publication-title: Omega
  doi: 10.1016/j.omega.2010.06.006
– volume: 8
  start-page: 538
  issue: 4
  year: 1983
  end-page: 548
  ident: CR8
  article-title: Integer programming with a fixed number of variables
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.8.4.538
– volume: 8
  start-page: 538
  issue: 4
  year: 1983
  ident: 402_CR8
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.8.4.538
– volume: 39
  start-page: 120
  issue: 2
  year: 2011
  ident: 402_CR3
  publication-title: Omega
  doi: 10.1016/j.omega.2010.06.006
– year: 2020
  ident: 402_CR7
  publication-title: Discrete. Appl. Math.
  doi: 10.1016/j.dam.2020.05.023
– volume: 284
  start-page: 67
  issue: 1
  year: 2020
  ident: 402_CR1
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2019.12.003
– volume: 19
  start-page: 729
  year: 2016
  ident: 402_CR6
  publication-title: J. Sched.
  doi: 10.1007/s10951-015-0464-7
– volume: 286
  start-page: 129
  issue: 1
  year: 2020
  ident: 402_CR5
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2020.03.032
– volume: 174
  start-page: 927
  year: 2017
  ident: 402_CR2
  publication-title: J. Optimiz. Theory. App.
  doi: 10.1007/s10957-017-1147-7
– volume: 144
  start-page: 106449
  year: 2020
  ident: 402_CR4
  publication-title: Comput. Ind. Eng.
  doi: 10.1016/j.cie.2020.106449
SSID ssib052855601
ssj0002962227
Score 2.3405488
Snippet We study the early work scheduling problem on identical parallel machines in order to maximize the total early work, i.e., the parts of non-preemptive jobs...
SourceID proquest
crossref
springer
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 341
SubjectTerms Accuracy
Algorithms
Approximation
Employment
Management Science
Mathematics
Mathematics and Statistics
Operations Research
Polynomials
Preempting
Schedules
Scheduling
Workloads
SummonAdditionalLinks – databaseName: ProQuest Central
  dbid: BENPR
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwED5BywADb0R5yQMbWDSNnTgTKpSKhariIXWLYjtFSFCgLQj-PXeO0wISXVgT21LyXewv9_gO4FAJEwZWWW7rkeIi0ZYrmwgehrGN-lLLKOu7ZhNxp6N6vaTrHW4jn1ZZ7oluo7bPhnzkJ0R18SwWsTx9eeXUNYqiq76FxjxUSalMVKB6dtHpXpcWJRtKysgHVmlvbiQRFX9SxzkczqNI9XwljaunE2T-nBLcybgb_PPnaTWloL-ipu4waq_89zFWYdnTUNYs7GYN5vLBOix9EyfcgEHhb8gta5Lu-MdDUeTIbhDmp3zEkO0yJ4_MyOHuLltKa79nOKio_0X8WTcbUruWR3bl0jZxIrl-WcaoNAVHtt5y1kLCuwl37Yvb80vuuzNwRDcZ8yzGVyvq_TiMlbRSIBfIrTZGZyRGroXU-OdiAo38AC_WNRIJYhymr2wWCWRdW1AZPA_ybWBG6MQEOcKFZDRDypSpMKAAHinJWKVqEJQopMZLl1MHjcd0IrrskEsRudQhl37W4Ggy56UQ7pg5eq-EK_Uf8SidYlWD4xLw6e2_V9uZvdouLDaQGhUJZ3tQGQ_f8n1YMO_jh9HwwJvwFzeu880
  priority: 102
  providerName: ProQuest
Title Improved Approximation Schemes for Early Work Scheduling on Identical Parallel Machines with a Common Due Date
URI https://link.springer.com/article/10.1007/s40305-022-00402-y
https://www.proquest.com/docview/3056251475
Volume 12
WOSCitedRecordID wos000812057900001&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: Asian & European Business Collection (ProQuest)
  customDbUrl:
  eissn: 2194-6698
  dateEnd: 20241207
  omitProxy: false
  ssIdentifier: ssj0002962227
  issn: 2194-668X
  databaseCode: AXJJW
  dateStart: 20130301
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/asianeuropeanbusiness
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database (subscription)
  customDbUrl:
  eissn: 2194-6698
  dateEnd: 20241207
  omitProxy: false
  ssIdentifier: ssj0002962227
  issn: 2194-668X
  databaseCode: M7S
  dateStart: 20130301
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central - New (Subscription)
  customDbUrl:
  eissn: 2194-6698
  dateEnd: 20241207
  omitProxy: false
  ssIdentifier: ssj0002962227
  issn: 2194-668X
  databaseCode: BENPR
  dateStart: 20130301
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVAVX
  databaseName: Springer LINK
  customDbUrl:
  eissn: 2194-6698
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002962227
  issn: 2194-668X
  databaseCode: RSV
  dateStart: 20130301
  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/eLvHCXMwnV1LT8MwDLZ4HeDAGzEeUw7cINK6Jm16HLAJIW2aNh67VU3SISQYaB0I_j122o6HAAlOVdMkqmwn-ZLYnwEOlDC-Z5XlthYoLiJtubKR4L4f2mAotQySoUs2EXY6ajCIukVQWFZ6u5dXkm6mnga7CbJNTt7nZHl1_joL87jcKRqOvf5VaUWyrqQMistUmo_rUUABn5RlDnfsPAjUoIie-b7bzyvUO-z8clPqFqDWyv9-fRWWC8DJGrmFrMFMOlqHpQ80hPjWnnK3Zhswys8ZUssaxDf-cpsHN7I-qvc-zRiiXOZokRkdtLtiS-7sNwwr5XG_qHfWTcaUpuWOtZ27JjakI1-WMApJwZqnTyk7RaC7CZet5sXJGS-yMnDUajThSYjiFbVh6IdKWikQA6RWG6MTIiHXQmrcsRhPIy7AwppGAEFIwwyVTQKBaGsL5kYPo3QbmBE6Ml6KKkMQmiBUSpTv0cUdMchYpSrglZqITUFZTpkz7uIp2bKTbIySjZ1k49cKHE7bPOaEHb_W3isVHBeDN4tpV4WwT4SyAkelQt8__9zbzt-q78JiHSFS7ni2B3OT8VO6DwvmeXKbjasw3xicn1_j87jZ6faq5JXarzpTfwOQu_Hl
linkProvider Springer Nature
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1NT9wwEB2hpRLtgRbaqktp60N7AotNYjvOAaFVt4jPFRKg7i3EH1shwQK7S9v9U_xGZpyEpUjlxoGr41iJ8-x58cy8AfiqhU0ipx13LaW5yIzj2mWCJ0nqVF8aqYp-KDaRdru618sOZuCmzoWhsMp6TwwbtbuwdEa-RlQXbbFI5cblFaeqUeRdrUtolLDY9ZM_-Ms2Wt_u4Pf9FsebP46-b_GqqgDHp8rGvEilVKLVT5NUSycF2jDvjLWmIBFtI6RBxm0jg3YNG1sGDSBZStvXrlBCkdABbvmzIsEfqQbMtns7Oz9rBMtYS6kqRy7ZgjhTlGxKFe4inAGldK_K3An5e4KWG6eAelpMMZ_8ax2nlPeBlzYYv83Xz23a3sB8RbNZu1wXCzDjB4vw6p744lsYlOcp3rE26ar_PS2TONkhwvjcjxiyeRbknxk5FEKzo7D9Xww7lfnNiG92UAypHM0Z2w9hqXgjHW2zglHqDfbsXHvWQUL_Do6f5IXfQ2NwMfAfgFlhMht5hAeS7QIpYaGTiByUpJTjtG5CVH_13FbS7FQh5Cy_E5UOSMkRKXlASj5pwsrdPZelMMmjvZdreOTVJjXKp9howmoNsOnl_4-29PhoX2Bu62h_L9_b7u5-hJcx0sAyuG4ZGuPhtf8EL-zv8elo-LlaPgxOnhp6t6oST5o
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT8MwDLZ4CcGBN2I8c-AGEeuatOkRMSYQME3iod2qJmnRJChoGwj-PXbajocACXFs6kSq7bZfYvszwK4SxvesstzWA8VFpC1XNhLc90MbZFLLIMlcs4mw3VbdbtT5UMXvst2rkGRR00AsTfnw4NFmB6PCN0F-yikTnbywwV_HYVJQ0yDar1_eVB4lG0rKoAys0re5EQVU_Ekd53D3zoNAdctKmu-X_fy3eoegX6Km7mfUmv__YyzAXAlE2WHhOYswluZLMPuBnhCvLkacroNlyIvzh9SyQ-Ihf-kVRY_sEs1-nw4Yol_m6JIZHcC7YUtp7rcMhYp6YPQH1kn61L7ljl24NE6cSEfBLGFUqoKSzaeUNREAr8B16_jq6ISX3Ro4Wjsa8iREVYt6FvqhklYKxAap1cbohMjJtZAadzLG04gXcLCuEVgQAjGZskkgEIWtwkT-kKdrwIzQkfFSNB-C0wQhVKJ8jwJ6xCxjlaqBV1klNiWVOXXUuItHJMxOszFqNnaajV9rsDea81gQefwqvVkZOy5f6kFMuy2EgyKUNdivjPt---fV1v8mvgPTnWYrPj9tn23ATANRVJGbtgkTw_5TugVT5nnYG_S3na-_AXUW-XQ
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=Improved+Approximation+Schemes+for+Early+Work+Scheduling+on+Identical+Parallel+Machines+with+a+Common+Due+Date&rft.jtitle=Journal+of+the+Operations+Research+Society+of+China+%28Internet%29&rft.au=Li%2C+Wei-Dong&rft.date=2024-06-01&rft.pub=Springer+Berlin+Heidelberg&rft.issn=2194-668X&rft.eissn=2194-6698&rft.volume=12&rft.issue=2&rft.spage=341&rft.epage=350&rft_id=info:doi/10.1007%2Fs40305-022-00402-y&rft.externalDocID=10_1007_s40305_022_00402_y
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2194-668X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2194-668X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2194-668X&client=summon