Multitasking scheduling with alternate periods

In this paper, we consider the multitasking scheduling with alternate odd-period and even-period. For the minimization of makespan on one single machine, we present a 2-approximation algorithm for the general case and a 4 3 -approximation algorithm for a special case when jobs have identical release...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of combinatorial optimization Ročník 45; číslo 3; s. 92
Hlavní autoři: Huo, Yujia, Miao, Cuixia, Kong, Fanyu, Zhang, Yuzhong
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.04.2023
Springer Nature B.V
Témata:
Algorithms
Approximation
Combinatorics
Convex and Discrete Geometry
Dynamic programming
Mathematical Modeling and Industrial Mathematics
Mathematics
Mathematics and Statistics
Multitasking
Operations Research/Decision Theory
Optimization
Polynomials
Scheduling
Theory of Computation
Strongly NP-hard
Multitasking scheduling
Approximation algorithm
Pseudo-polynomial-time algorithm
ISSN:1382-6905, 1573-2886
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 In this paper, we consider the multitasking scheduling with alternate odd-period and even-period. For the minimization of makespan on one single machine, we present a 2-approximation algorithm for the general case and a 4 3 -approximation algorithm for a special case when jobs have identical release dates. And we prove that the problem is strongly NP-hard when jobs have different release dates. For the minimization of makespan on identical parallel machines, we present a ( 5 2 - 1 m ) -approximation algorithm for the general case and a pseudo-polynomial time algorithm when the number of machines is constant. Furthermore, we prove that the single-machine scheduling of minimizing the lateness is strongly NP-hard.
AbstractList In this paper, we consider the multitasking scheduling with alternate odd-period and even-period. For the minimization of makespan on one single machine, we present a 2-approximation algorithm for the general case and a 43-approximation algorithm for a special case when jobs have identical release dates. And we prove that the problem is strongly NP-hard when jobs have different release dates. For the minimization of makespan on identical parallel machines, we present a (52-1m)-approximation algorithm for the general case and a pseudo-polynomial time algorithm when the number of machines is constant. Furthermore, we prove that the single-machine scheduling of minimizing the lateness is strongly NP-hard.
In this paper, we consider the multitasking scheduling with alternate odd-period and even-period. For the minimization of makespan on one single machine, we present a 2-approximation algorithm for the general case and a 4 3 -approximation algorithm for a special case when jobs have identical release dates. And we prove that the problem is strongly NP-hard when jobs have different release dates. For the minimization of makespan on identical parallel machines, we present a ( 5 2 - 1 m ) -approximation algorithm for the general case and a pseudo-polynomial time algorithm when the number of machines is constant. Furthermore, we prove that the single-machine scheduling of minimizing the lateness is strongly NP-hard.
ArticleNumber 92
Author Kong, Fanyu
Zhang, Yuzhong
Miao, Cuixia
Huo, Yujia
Author_xml – sequence: 1
  givenname: Yujia
  surname: Huo
  fullname: Huo, Yujia
  organization: School of Mathematical Sciences, Qufu Normal University
– sequence: 2
  givenname: Cuixia
  orcidid: 0000-0003-2448-2158
  surname: Miao
  fullname: Miao, Cuixia
  email: miaocuixia@126.com
  organization: School of Mathematical Sciences, Qufu Normal University
– sequence: 3
  givenname: Fanyu
  surname: Kong
  fullname: Kong, Fanyu
  organization: School of Mathematical Sciences, Qufu Normal University
– sequence: 4
  givenname: Yuzhong
  surname: Zhang
  fullname: Zhang, Yuzhong
  organization: Institute of Operations Research, Qufu Normal University
BookMark eNp9kMtOwzAQRS1UJNrCD7CqxNpl_EgyXqKKl1TEBtaWGzttSkiK7Yjy97gECYlFV3M1mjNz507IqO1aR8glgzkDKK4DAyyQAhcUGHCg-xMyZlkhKEfMR0kL5DRXkJ2RSQhbAEhajsn8qW9iHU14q9v1LJQbZ_vmID_ruJmZJjrfmuhmO-frzoZzclqZJriL3zolr3e3L4sHuny-f1zcLGkpmIoUDShWokQhpEQjqiy3fIWMcY4rZpTC0gqZ2lIaXklrlLWqSP3CroArFFNyNezd-e6jdyHqbdcnJ03QgmcyVyrLszTFh6nSdyF4V-mdr9-N_9IM9CEXPeSiUy76Jxe9TxD-g8r0f6y7NnpTN8dRMaAh3WnXzv-5OkJ9Awv1eOQ
CitedBy_id crossref_primary_10_1080_00207543_2024_2304022
crossref_primary_10_3390_sym16030380
Cites_doi 10.1016/j.cie.2009.04.014
10.1016/j.dam.2016.03.018
10.1080/00207543.2016.1208852
10.1007/BF00121681
10.1111/poms.12331
10.1007/s10878-020-00600-5
10.1007/s11590-015-0881-8
10.1109/ICSSSM.2018.8465050
ContentType Journal Article
Copyright The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2023.
Copyright_xml – notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
– notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2023.
DBID AAYXX
CITATION
7XB
8FE
8FG
ABJCF
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
GNUQQ
HCIFZ
L6V
M2P
M7S
P5Z
P62
PHGZM
PHGZT
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
Q9U
DOI 10.1007/s10878-023-01020-x
DatabaseName CrossRef
ProQuest Central (purchase pre-March 2016)
ProQuest SciTech Collection
ProQuest Technology Collection
Materials Science & Engineering Collection
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central
Technology Collection
ProQuest One Community College
ProQuest Central
ProQuest Central Student
Proquest SciTech Premium Collection
ProQuest Engineering Collection
Science Database
Engineering Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
ProQuest Central Basic
DatabaseTitle CrossRef
ProQuest Central Student
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
SciTech Premium Collection
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest Central Korea
ProQuest Central (New)
Engineering Collection
Advanced Technologies & Aerospace Collection
Engineering Database
ProQuest Central Basic
ProQuest Science Journals
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
Advanced Technologies & Aerospace Database
ProQuest One Academic UKI Edition
Materials Science & Engineering Collection
ProQuest One Academic
ProQuest One Academic (New)
DatabaseTitleList ProQuest Central Student
Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Mathematics
EISSN 1573-2886
ExternalDocumentID 10_1007_s10878_023_01020_x
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
7XB
8FE
8FG
L6V
P62
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
Q9U
ID FETCH-LOGICAL-c319t-8a091c84833448a3f56d2b811228b1a998cd343f544a2f4da9dd97a997db02983
IEDL.DBID BENPR
ISICitedReferencesCount 3
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000967387800001&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 Sat Sep 27 04:21:35 EDT 2025
Sat Nov 29 04:54:39 EST 2025
Tue Nov 18 22:09:48 EST 2025
Fri Feb 21 02:43:25 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 3
Keywords Strongly NP-hard
Multitasking scheduling
Approximation algorithm
Pseudo-polynomial-time algorithm
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c319t-8a091c84833448a3f56d2b811228b1a998cd343f544a2f4da9dd97a997db02983
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0003-2448-2158
PQID 3254699565
PQPubID 2043856
ParticipantIDs proquest_journals_3254699565
crossref_primary_10_1007_s10878_023_01020_x
crossref_citationtrail_10_1007_s10878_023_01020_x
springer_journals_10_1007_s10878_023_01020_x
PublicationCentury 2000
PublicationDate 20230400
2023-04-00
20230401
PublicationDateYYYYMMDD 2023-04-01
PublicationDate_xml – month: 4
  year: 2023
  text: 20230400
PublicationDecade 2020
PublicationPlace New York
PublicationPlace_xml – name: New York
– name: Dordrecht
PublicationTitle Journal of combinatorial optimization
PublicationTitleAbbrev J Comb Optim
PublicationYear 2023
Publisher Springer US
Springer Nature B.V
Publisher_xml – name: Springer US
– name: Springer Nature B.V
References Ma, Chu, Zuo (CR7) 2010; 58
CR4
Hall, Leung, Li (CR1) 2015; 24
Hall, Leung, Li (CR2) 2016; 208
Sachdeva, Panwar (CR8) 2015; 66
Zhu, Zheng, Chu (CR10) 2017; 55
Liu, Wang, Zheng, Chu (CR3) 2017; 55
Li, Lu (CR5) 2016; 10
Lee (CR6) 1996; 9
Yang, Yin, Wang, Yin (CR9) 2022; 44
S Sachdeva (1020_CR8) 2015; 66
M Liu (1020_CR3) 2017; 55
1020_CR4
Y Ma (1020_CR7) 2010; 58
YJ Yang (1020_CR9) 2022; 44
NG Hall (1020_CR1) 2015; 24
ZG Zhu (1020_CR10) 2017; 55
GG Li (1020_CR5) 2016; 10
CY Lee (1020_CR6) 1996; 9
NG Hall (1020_CR2) 2016; 208
References_xml – volume: 58
  start-page: 199
  issue: 2
  year: 2010
  end-page: 211
  ident: CR7
  article-title: A survey of scheduling with deterministic machine availability constraints
  publication-title: Comput Ind Eng
  doi: 10.1016/j.cie.2009.04.014
– volume: 208
  start-page: 41
  year: 2016
  end-page: 58
  ident: CR2
  article-title: Multitasking via alternate and shared processing: algorithms and complexity
  publication-title: Discrete Appl Math
  doi: 10.1016/j.dam.2016.03.018
– volume: 55
  start-page: 296
  year: 2017
  end-page: 312
  ident: CR10
  article-title: Multitasking scheduling problems with a rate-modifying activity
  publication-title: Int J Prod Res
  doi: 10.1080/00207543.2016.1208852
– volume: 55
  start-page: 6052
  year: 2017
  end-page: 6066
  ident: CR3
  article-title: Algorithms for the joint multitasking scheduling and common due date assignment problem
  publication-title: Discrete Appl Math
– ident: CR4
– volume: 9
  start-page: 363
  year: 1996
  end-page: 384
  ident: CR6
  article-title: Machine scheduling with an availability constraints
  publication-title: J Global Optim
  doi: 10.1007/BF00121681
– volume: 66
  start-page: 67
  year: 2015
  end-page: 72
  ident: CR8
  article-title: A review of multiprocessor directed acyclic graph (DAG) scheduling algorithms
  publication-title: Int J Comput Sci Commun
– volume: 24
  start-page: 1248
  year: 2015
  end-page: 1265
  ident: CR1
  article-title: The effects of multitasking on operations scheduling
  publication-title: Prod Oper Manag
  doi: 10.1111/poms.12331
– volume: 44
  start-page: 2207
  year: 2022
  end-page: 2223
  ident: CR9
  article-title: Due date assignment and two-agent scheduling under multitasking environment
  publication-title: J Comb Optim
  doi: 10.1007/s10878-020-00600-5
– volume: 10
  start-page: 543
  year: 2016
  end-page: 562
  ident: CR5
  article-title: Approximation algorithms for the single-machine scheduling with a period of maintenance
  publication-title: Optim Lett
  doi: 10.1007/s11590-015-0881-8
– ident: 1020_CR4
  doi: 10.1109/ICSSSM.2018.8465050
– volume: 44
  start-page: 2207
  year: 2022
  ident: 1020_CR9
  publication-title: J Comb Optim
  doi: 10.1007/s10878-020-00600-5
– volume: 55
  start-page: 6052
  year: 2017
  ident: 1020_CR3
  publication-title: Discrete Appl Math
– volume: 55
  start-page: 296
  year: 2017
  ident: 1020_CR10
  publication-title: Int J Prod Res
  doi: 10.1080/00207543.2016.1208852
– volume: 10
  start-page: 543
  year: 2016
  ident: 1020_CR5
  publication-title: Optim Lett
  doi: 10.1007/s11590-015-0881-8
– volume: 24
  start-page: 1248
  year: 2015
  ident: 1020_CR1
  publication-title: Prod Oper Manag
  doi: 10.1111/poms.12331
– volume: 66
  start-page: 67
  year: 2015
  ident: 1020_CR8
  publication-title: Int J Comput Sci Commun
– volume: 208
  start-page: 41
  year: 2016
  ident: 1020_CR2
  publication-title: Discrete Appl Math
  doi: 10.1016/j.dam.2016.03.018
– volume: 58
  start-page: 199
  issue: 2
  year: 2010
  ident: 1020_CR7
  publication-title: Comput Ind Eng
  doi: 10.1016/j.cie.2009.04.014
– volume: 9
  start-page: 363
  year: 1996
  ident: 1020_CR6
  publication-title: J Global Optim
  doi: 10.1007/BF00121681
SSID ssj0009054
Score 2.316589
Snippet In this paper, we consider the multitasking scheduling with alternate odd-period and even-period. For the minimization of makespan on one single machine, we...
SourceID proquest
crossref
springer
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 92
SubjectTerms Algorithms
Approximation
Combinatorics
Convex and Discrete Geometry
Dynamic programming
Mathematical Modeling and Industrial Mathematics
Mathematics
Mathematics and Statistics
Multitasking
Operations Research/Decision Theory
Optimization
Polynomials
Scheduling
Theory of Computation
SummonAdditionalLinks – databaseName: SpringerLINK Contemporary 1997-Present
  dbid: RSV
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8QwEB5k9aAH3-LqKj1408i2Sdv0KKJ40EV8LHsLSdOAIF3ZruLPd6aP7Soq6LFpEsok0_kmk_kG4Mi60GS2HzInBGdEKMcS5wLmTCIMFzpKymIww-t4MJCjUXJbJ4UVzW33JiRZ_qnnkt0kscEGdP-HnB5Ejoto7iSp4939sKXa7YdVKVvEjuj7hXWqzPdzfDZHLcb8EhYtrc3l2v--cx1Wa3TpnVXbYQMWsnwTVuY4B_HpZkbUWmzBaZWAqws6MffQ00XLQwnqHp3PemUoPUc06hEf8tgW2_B4efFwfsXqEgosRd2aMqkRD6RSSM7RD9PchZENjESQFUjja_S1UssFNguhAyesTqxNYmyPrSFydr4DnXycZ7vgxX3rR9ro2Pc5mnUttXVOOiNCmTkd2S74jSRVWvOLU5mLZ9UyI5NkFEpGlZJR7104no15qdg1fu3daxZI1ZpWKE6E_pSeG3bhpFmQ9vXPs-39rfs-LAflmtKlnR50ppPX7ACW0rfpUzE5LHfgB-gA1Fs
  priority: 102
  providerName: Springer Nature
Title Multitasking scheduling with alternate periods
URI https://link.springer.com/article/10.1007/s10878-023-01020-x
https://www.proquest.com/docview/3254699565
Volume 45
WOSCitedRecordID wos000967387800001&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: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 1573-2886
  dateEnd: 20241207
  omitProxy: false
  ssIdentifier: ssj0009054
  issn: 1382-6905
  databaseCode: P5Z
  dateStart: 20230101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 1573-2886
  dateEnd: 20241207
  omitProxy: false
  ssIdentifier: ssj0009054
  issn: 1382-6905
  databaseCode: M7S
  dateStart: 20230101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1573-2886
  dateEnd: 20241207
  omitProxy: false
  ssIdentifier: ssj0009054
  issn: 1382-6905
  databaseCode: BENPR
  dateStart: 20230101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Science Database
  customDbUrl:
  eissn: 1573-2886
  dateEnd: 20241207
  omitProxy: false
  ssIdentifier: ssj0009054
  issn: 1382-6905
  databaseCode: M2P
  dateStart: 20230101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/sciencejournals
  providerName: ProQuest
– 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/eLvHCXMwpV3NT8IwFH9R8KAHv40okh286ZSt3dadjBqIByEElBAvS7euiYkBZGj4831vFKYmcvHSZN3WNH2vfR997_cAzpX24lTVPVtzzmwClLNDrV1bxyGPGZd-mBeD6T8G7bYYDMKOcbhlJqxycSbmB7UaJeQjv2YE3E5pmN7N-N2mqlF0u2pKaKxDmZDKeAnKd412p1vA7ta9eVlb1CPRDvRM2oxJnhOELutSPBEZUbOfoqnQN39dkeaSp7nz3znvwrbROa3bOZPswVo63Ietb0iE-NRawrdmB3A1T8uVGfnRLbR_UR5R2rpFXlsrv2Afoo5qEUrySGWH8NxsPN0_2Kawgp3gjpvaQqKWkAguGEPrTDLt-cqNBaperogdiRZYohjHbs6lq7mSoVJhgP2BigmynR1BaTgapsdgBXXl-DKWgeMwFPZSSKW10DH3RKqlryrgLNY0SgzqOBW_eIsKvGSiQ4R0iHI6RLMKXCz_Gc8xN1Z-XV0sfmT2XxYVK1-BywX5itd_j3ayerRT2HRzjqHQnSqUppOP9Aw2ks_pazapGe6rwXrL7VAb9LDteC_Ydnv9L4IF4yM
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT8MwDLZ4ScCBN2I8e4ATFNYkbdMDQgiYQGwTB0C7lbRpJCS0DTpef4rfiN0HBSS4ceDYtI2q2on9xfZngE1t3CjRddc2QnCbCOXswBhmmygQERfKC7JmMNdNv92WnU5wMQRvZS0MpVWWe2K2UeteTGfke5yI26kM0z3o39vUNYqiq2ULjVwtzpPXZ4Rs6f7ZMcp3i7HGyeXRqV10FbBjVLeBLRWayFgKyTlCE8WN62kWSfQ7mIwchfAj1lzgsBCKGaFVoHXg47ivI-Ir5zjvMIwKREK0rlrsoiL5rbt5E130WhF1ukWRTlGqJ4nLllH2EkG2l6-GsPJuvwVkMzvXmP5vf2gGpgqP2jrMl8AsDCXdOZj8xLOIV60Pctp0HnbzomOVUpTAQnSP1paK8i06k7ay9IEueuAWcUD3dLoAV3_y-Ysw0u11kyWw_Lp2PBUp33E4ujJKKm2MNJFwZWKUp2vglDIM44JTnVp73IUVGzTJPUS5h5ncw5cabH-8088ZRX59erUUdljsLmlYSboGO6W6VLd_nm3599k2YPz0stUMm2ft8xWYYJm2UpLSKowMHh6TNRiLnwa36cN6pvcW3Py1Gr0Drqo4eQ
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3fS8MwEA4yRfTB3-J0ah9807q1Sdv0UdShOMdAHXsLSdOAIN1Yq_jne9cf6xQVxMemaSiXhPsuue87Qk608VSsO55tGKM2CsrZoTGubVTIFGXSD_NiMMNe0O_z0SgczLH482z36kqy4DSgSlOStSfatOeIbxyVYV3MBcIACFDkIsOiQRivPwxr2d2OV5S1BRwJcaBX0ma-H-Oza6rx5pcr0tzzdNf__88bZK1EndZFsUw2yUKcbJHVOS1CeLqfCbim2-S8IObKFE_SLYiAwSMhcd3Cc1srv2JPAKVaqJM81ukOeepeP17e2GVpBTuCPZfZXAJOiDjjlEJ8JqnxfO0qDuDL5cqREINFmjJoZky6hmkZah0G0B5ohaLtdJc0knES7xEr6GjHl0oGjkPB3UsutTHcKObx2EhfN4lTWVVEpe44lr94EbViMlpGgGVEbhnx3iSns28mherGr71b1WSJcgemgqLQP9J2vSY5qyanfv3zaPt_635MlgdXXdG77d8dkBU3n17M62mRRjZ9jQ_JUvSWPafTo3xhfgB4r-Aj
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=Multitasking+scheduling+with+alternate+periods&rft.jtitle=Journal+of+combinatorial+optimization&rft.au=Huo%2C+Yujia&rft.au=Miao%2C+Cuixia&rft.au=Kong%2C+Fanyu&rft.au=Zhang%2C+Yuzhong&rft.date=2023-04-01&rft.issn=1382-6905&rft.eissn=1573-2886&rft.volume=45&rft.issue=3&rft_id=info:doi/10.1007%2Fs10878-023-01020-x&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s10878_023_01020_x
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