Scheduling Jobs with Release and Delivery Times Subject to Nested Eligibility Constraints

The problem of scheduling jobs with release and delivery time subject to machine eligibility constraints is considered. The eligible sets of the jobs are nested, and preemptions are not allowed. The goal is to minimize the maximum delivery completion time, i.e., the time by which all jobs are delive...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of the Operations Research Society of China (Internet) Ročník 9; číslo 1; s. 63 - 77
Hlavní autoři: Zhang, Yu-Zhong, Li, Shu-Guang
Médium: Journal Article
Jazyk:angličtina
Vydáno: Beijing Operations Research Society of China 01.03.2021
Springer Nature B.V
Témata:
Advisors
Algorithms
Approximation
Completion time
Management Science
Mathematical analysis
Mathematics
Mathematics and Statistics
Operations Research
Polynomials
Scheduling
Delivery time
90B35
Release time
Nested eligibility constraints
Polynomial time approximation scheme
Scheduling
68M20
ISSN:2194-668X, 2194-6698
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 The problem of scheduling jobs with release and delivery time subject to machine eligibility constraints is considered. The eligible sets of the jobs are nested, and preemptions are not allowed. The goal is to minimize the maximum delivery completion time, i.e., the time by which all jobs are delivered. For the special case of equal release time, a 2-approximation algorithm is presented whose running time depends linearly on the number of jobs. For the general case of unequal release time, a polynomial time approximation scheme is derived.
AbstractList The problem of scheduling jobs with release and delivery time subject to machine eligibility constraints is considered. The eligible sets of the jobs are nested, and preemptions are not allowed. The goal is to minimize the maximum delivery completion time, i.e., the time by which all jobs are delivered. For the special case of equal release time, a 2-approximation algorithm is presented whose running time depends linearly on the number of jobs. For the general case of unequal release time, a polynomial time approximation scheme is derived.
Author Li, Shu-Guang
Zhang, Yu-Zhong
Author_xml – sequence: 1
  givenname: Yu-Zhong
  surname: Zhang
  fullname: Zhang, Yu-Zhong
  email: yuzhongrz@163.com
  organization: Institute of Operations Research, Qufu Normal University
– sequence: 2
  givenname: Shu-Guang
  surname: Li
  fullname: Li, Shu-Guang
  organization: Key Laboratory of Intelligent Information Processing in Universities of Shandong (Shandong Institute of Business and Technology), College of Computer Science and Technology, Shandong Institute of Business and Technology
BookMark eNp9kE1PwyAYx4mZiXPuC3gi8VyFAqUczZxvWTRxM9EToUA3lo5OoJp9e6szevP0_A__lye_YzDwrbcAnGJ0jhHiF5EigliGsMgQyosy4wdgmGNBs6IQ5eBXly9HYByjqxDLS8YKhIfgda5X1nSN80t431YRfri0gk-2sSpaqLyBV7Zx7zbs4MJtbITzrlpbnWBq4YONyRo4bdzSVa5xaQcnrY8pKOdTPAGHtWqiHf_cEXi-ni4mt9ns8eZucjnLdM5RygwTtKJMYcW1EiUldVFzSgulqeVCUGGIZVRRQmpVMG0wI5RVtKhRSSttDBmBs33vNrRvXf-SXLdd8P2kzAXpNzjGee_K9y4d2hiDreU2uI0KO4mR_KIo9xRlT1F-U5S8D5F9KPZmv7Thr_qf1CfhQHbW
Cites_doi 10.1002/jos.103
10.1155/2016/3203728
10.1287/moor.17.1.22
10.1023/A:1026272526225
10.1016/S0167-5060(08)70743-X
10.1016/j.cor.2006.07.008
10.1016/j.orl.2004.05.004
10.1016/j.ijpe.2014.09.038
10.1016/j.orl.2009.09.010
10.1016/j.ejor.2009.02.011
10.1137/0218048
10.1201/9780203489802
10.1002/nav.3800210113
10.1016/j.cor.2004.07.010
10.1016/0377-2217(87)90243-8
10.1002/(SICI)1099-1425(199909/10)2:5<203::AID-JOS26>3.0.CO;2-5
10.1016/j.ijpe.2011.04.024
10.1016/S0167-5060(08)70356-X
10.1007/BF01585745
10.1016/j.tcs.2010.08.008
10.1016/j.ijpe.2008.09.003
10.1016/S0305-0548(03)00164-3
10.1002/nav.20286
10.1137/0206014
10.1002/nav.20202
10.1016/j.ejor.2009.10.025
10.1109/SFCS.1989.63468
10.1007/978-1-4613-0303-9_25
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 2019
Operations Research Society of China, Periodicals Agency of Shanghai University, Science Press, and Springer-Verlag GmbH Germany, part of Springer Nature 2019.
Copyright_xml – notice: Operations Research Society of China, Periodicals Agency of Shanghai University, Science Press, and Springer-Verlag GmbH Germany, part of Springer Nature 2019
– notice: Operations Research Society of China, Periodicals Agency of Shanghai University, Science Press, and Springer-Verlag GmbH Germany, part of Springer Nature 2019.
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-019-00268-7
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
Technology Collection
ProQuest One Community College
ProQuest Central
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
  url: https://search.proquest.com/asianeuropeanbusiness
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Mathematics
EISSN 2194-6698
EndPage 77
ExternalDocumentID 10_1007_s40305_019_00268_7
GrantInformation_xml – fundername: National Natural Science Foundation of China
  grantid: 11771251
  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-c270t-d594b45a1a7ca9843f6f7446ac4e79949d3e54a433fa65cd15345b46f084bcdd3
IEDL.DBID BENPR
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000493356200001&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 08:40:16 EST 2025
Sat Nov 29 05:55:48 EST 2025
Fri Feb 21 02:49:19 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords Delivery time
90B35
Release time
Nested eligibility constraints
Polynomial time approximation scheme
Scheduling
68M20
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c270t-d594b45a1a7ca9843f6f7446ac4e79949d3e54a433fa65cd15345b46f084bcdd3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
PQID 2932707112
PQPubID 2043982
PageCount 15
ParticipantIDs proquest_journals_2932707112
crossref_primary_10_1007_s40305_019_00268_7
springer_journals_10_1007_s40305_019_00268_7
PublicationCentury 2000
PublicationDate 20210300
2021-03-00
20210301
PublicationDateYYYYMMDD 2021-03-01
PublicationDate_xml – month: 3
  year: 2021
  text: 20210300
PublicationDecade 2020
PublicationPlace Beijing
PublicationPlace_xml – name: Beijing
– name: Heidelberg
PublicationTitle Journal of the Operations Research Society of China (Internet)
PublicationTitleAbbrev J. Oper. Res. Soc. China
PublicationYear 2021
Publisher Operations Research Society of China
Springer Nature B.V
Publisher_xml – name: Operations Research Society of China
– name: Springer Nature B.V
References Schuurman, Woeginger (CR7) 1999; 2
Glass, Mills (CR20) 2006; 33
Lenstra, Shmoys, Tardos (CR5) 1990; 46
Li (CR21) 2016
Leung, Li (CR3) 2008; 116
Lenstra, Kan, Brucker (CR23) 1977; 1
Neron, Tercinet, Sourd (CR28) 2008; 35
Papadimitriou, Steiglitz (CR31) 1998
CR10
Graham, Lawler, Lenstra, Kan (CR1) 1979; 5
Carlier (CR26) 1987; 29
Muratore, Schwarz, Woeginger (CR18) 2010; 38
Hwang, Chang, Lee (CR12) 2004; 31
Mastrolilli (CR30) 2003; 6
Leung (CR22) 2004
Gharbi, Haouari (CR27) 2002; 5
Glass, Kellerer (CR13) 2007; 54
Li, Wang (CR15) 2010; 200
Shchepin, Vakhania (CR6) 2005; 33
Kafura, Shen (CR11) 1977; 6
Pinedo (CR32) 1995
Huo, Leung (CR17) 2010; 411
Simons, Warmuth (CR25) 1989; 18
Ou, Leung, Li (CR14) 2008; 55
CR8
CR29
Lawler, Lenstra, Kan, Shmoys (CR9) 1993; 4
Huo, Leung (CR16) 2010; 204
Leung, Li (CR4) 2016; 175
Horn (CR24) 1974; 21
Epstein, Levin (CR19) 2011; 133
Hall, Shmoys (CR2) 1992; 17
Jackson (CR33) 1955
268_CR8
P Schuurman (268_CR7) 1999; 2
ML Pinedo (268_CR32) 1995
JY-T Leung (268_CR3) 2008; 116
EL Lawler (268_CR9) 1993; 4
LA Hall (268_CR2) 1992; 17
M Mastrolilli (268_CR30) 2003; 6
JK Lenstra (268_CR23) 1977; 1
JR Jackson (268_CR33) 1955
268_CR10
JY-T Leung (268_CR4) 2016; 175
S Li (268_CR21) 2016
JK Lenstra (268_CR5) 1990; 46
EV Shchepin (268_CR6) 2005; 33
H-C Hwang (268_CR12) 2004; 31
WA Horn (268_CR24) 1974; 21
268_CR29
DG Kafura (268_CR11) 1977; 6
E Neron (268_CR28) 2008; 35
CA Glass (268_CR20) 2006; 33
A Gharbi (268_CR27) 2002; 5
G Muratore (268_CR18) 2010; 38
Y Huo (268_CR16) 2010; 204
Y Huo (268_CR17) 2010; 411
RL Graham (268_CR1) 1979; 5
CH Papadimitriou (268_CR31) 1998
CA Glass (268_CR13) 2007; 54
JY Leung (268_CR22) 2004
L Epstein (268_CR19) 2011; 133
J Carlier (268_CR26) 1987; 29
B Simons (268_CR25) 1989; 18
J Ou (268_CR14) 2008; 55
C-L Li (268_CR15) 2010; 200
References_xml – volume: 5
  start-page: 329
  year: 2002
  end-page: 355
  ident: CR27
  article-title: Minimizing makespan on parallel machines subject to release dates and delivery times
  publication-title: J. Sched.
  doi: 10.1002/jos.103
– year: 2016
  ident: CR21
  article-title: Parallel machine scheduling with nested processing set restrictions and job delivery times
  publication-title: Math. Prob. Eng.
  doi: 10.1155/2016/3203728
– volume: 17
  start-page: 22
  year: 1992
  end-page: 35
  ident: CR2
  article-title: Jackson’s rule for single-machine scheduling: making a good heuristic better
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.17.1.22
– volume: 6
  start-page: 521
  year: 2003
  end-page: 531
  ident: CR30
  article-title: Efficient approximation schemes for scheduling problems with release times and delivery times
  publication-title: J. Sched.
  doi: 10.1023/A:1026272526225
– year: 1995
  ident: CR32
  publication-title: Scheduling—Theory, Algorithms and Systems
– volume: 1
  start-page: 343
  year: 1977
  end-page: 362
  ident: CR23
  article-title: Complexity of machine scheduling problems
  publication-title: Ann. Discret. Math.
  doi: 10.1016/S0167-5060(08)70743-X
– volume: 4
  start-page: 445
  year: 1993
  end-page: 522
  ident: CR9
  article-title: Sequencing and scheduling: algorithms and complexity
  publication-title: Handb. Oper. Res. Manag. Sci.
– volume: 35
  start-page: 1127
  issue: 4
  year: 2008
  end-page: 1137
  ident: CR28
  article-title: Search tree based approaches for parallel machine scheduling
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2006.07.008
– volume: 33
  start-page: 127
  year: 2005
  end-page: 133
  ident: CR6
  article-title: An optimal rounding gives a better approximation for scheduling unrelated machines
  publication-title: Oper. Res. Lett.
  doi: 10.1016/j.orl.2004.05.004
– volume: 175
  start-page: 1
  year: 2016
  end-page: 11
  ident: CR4
  article-title: Scheduling with processing set restrictions: a literature update
  publication-title: Int. J. Prod. Econ.
  doi: 10.1016/j.ijpe.2014.09.038
– volume: 38
  start-page: 47
  year: 2010
  end-page: 50
  ident: CR18
  article-title: Parallel machine scheduling with nested job assignment restrictions
  publication-title: Oper. Res. Lett.
  doi: 10.1016/j.orl.2009.09.010
– ident: CR10
– volume: 200
  start-page: 702
  issue: 3
  year: 2010
  end-page: 710
  ident: CR15
  article-title: Scheduling parallel machines with inclusive processing set restrictions and job release times
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2009.02.011
– volume: 18
  start-page: 690
  year: 1989
  end-page: 710
  ident: CR25
  article-title: A fast algorithm for multiprocessor scheduling of unit-length jobs
  publication-title: SIAM J. Comput.
  doi: 10.1137/0218048
– ident: CR29
– ident: CR8
– year: 2004
  ident: CR22
  publication-title: Handbook of Scheduling: Algorithms, Models, and Performance Analysis
  doi: 10.1201/9780203489802
– volume: 21
  start-page: 177
  year: 1974
  end-page: 185
  ident: CR24
  article-title: Some simple scheduling algorithms
  publication-title: Nav. Res. Logist. Q.
  doi: 10.1002/nav.3800210113
– volume: 33
  start-page: 620
  year: 2006
  end-page: 638
  ident: CR20
  article-title: Scheduling unit length jobs with parallel nested machine processing set restrictions
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2004.07.010
– volume: 29
  start-page: 298
  year: 1987
  end-page: 306
  ident: CR26
  article-title: Scheduling jobs with release dates and tails on identical parallel machines to minimize the makespan
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/0377-2217(87)90243-8
– year: 1998
  ident: CR31
  publication-title: Combinatorial Optimization: Algorithms and Complexity
– volume: 2
  start-page: 203
  year: 1999
  end-page: 213
  ident: CR7
  article-title: Polynomial time approximation algorithms for machine scheduling: ten open problems
  publication-title: J. Sched.
  doi: 10.1002/(SICI)1099-1425(199909/10)2:5<203::AID-JOS26>3.0.CO;2-5
– volume: 133
  start-page: 586
  year: 2011
  end-page: 595
  ident: CR19
  article-title: Scheduling with processing set restrictions: PTAS results for several variants
  publication-title: Int. J. Prod. Econ.
  doi: 10.1016/j.ijpe.2011.04.024
– year: 1955
  ident: CR33
  publication-title: Scheduling a Production Line to Minimize Maximum Tardiness
– volume: 5
  start-page: 287
  year: 1979
  end-page: 326
  ident: CR1
  article-title: Optimization and approximation in deterministic sequencing and scheduling: a survey
  publication-title: Ann. Discret. Math.
  doi: 10.1016/S0167-5060(08)70356-X
– volume: 46
  start-page: 259
  year: 1990
  end-page: 271
  ident: CR5
  article-title: Approximation algorithms for scheduling unrelated parallel machines
  publication-title: Math. Program.
  doi: 10.1007/BF01585745
– volume: 411
  start-page: 3947
  year: 2010
  end-page: 3955
  ident: CR17
  article-title: Fast approximation algorithms for job scheduling with processing set restrictions
  publication-title: Theo. Comput. Sci.
  doi: 10.1016/j.tcs.2010.08.008
– volume: 116
  start-page: 251
  issue: 2
  year: 2008
  end-page: 262
  ident: CR3
  article-title: Scheduling with processing set restrictions: a survey
  publication-title: Int. J. Prod. Econ.
  doi: 10.1016/j.ijpe.2008.09.003
– volume: 31
  start-page: 2055
  year: 2004
  end-page: 2061
  ident: CR12
  article-title: Parallel machine scheduling under a grade of service provision
  publication-title: Comput. Oper. Res.
  doi: 10.1016/S0305-0548(03)00164-3
– volume: 55
  start-page: 328
  issue: 4
  year: 2008
  end-page: 338
  ident: CR14
  article-title: Scheduling parallel machines with inclusive processing set restrictions
  publication-title: Nav. Res. Logist.
  doi: 10.1002/nav.20286
– volume: 6
  start-page: 167
  year: 1977
  end-page: 187
  ident: CR11
  article-title: Task scheduling on a multiprocessor system with independent memories
  publication-title: SIAM J. Comput.
  doi: 10.1137/0206014
– volume: 54
  start-page: 250
  year: 2007
  end-page: 257
  ident: CR13
  article-title: Parallel machine scheduling with job assignment restrictions
  publication-title: Nav. Res. Logist.
  doi: 10.1002/nav.20202
– volume: 204
  start-page: 229
  year: 2010
  end-page: 236
  ident: CR16
  article-title: Parallel machine scheduling with nested processing set restrictions
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2009.10.025
– year: 2016
  ident: 268_CR21
  publication-title: Math. Prob. Eng.
  doi: 10.1155/2016/3203728
– volume: 46
  start-page: 259
  year: 1990
  ident: 268_CR5
  publication-title: Math. Program.
  doi: 10.1007/BF01585745
– ident: 268_CR8
– volume-title: Scheduling—Theory, Algorithms and Systems
  year: 1995
  ident: 268_CR32
– volume-title: Combinatorial Optimization: Algorithms and Complexity
  year: 1998
  ident: 268_CR31
– volume: 200
  start-page: 702
  issue: 3
  year: 2010
  ident: 268_CR15
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2009.02.011
– volume: 4
  start-page: 445
  year: 1993
  ident: 268_CR9
  publication-title: Handb. Oper. Res. Manag. Sci.
– volume: 31
  start-page: 2055
  year: 2004
  ident: 268_CR12
  publication-title: Comput. Oper. Res.
  doi: 10.1016/S0305-0548(03)00164-3
– volume: 33
  start-page: 127
  year: 2005
  ident: 268_CR6
  publication-title: Oper. Res. Lett.
  doi: 10.1016/j.orl.2004.05.004
– volume: 21
  start-page: 177
  year: 1974
  ident: 268_CR24
  publication-title: Nav. Res. Logist. Q.
  doi: 10.1002/nav.3800210113
– volume: 6
  start-page: 167
  year: 1977
  ident: 268_CR11
  publication-title: SIAM J. Comput.
  doi: 10.1137/0206014
– volume: 1
  start-page: 343
  year: 1977
  ident: 268_CR23
  publication-title: Ann. Discret. Math.
  doi: 10.1016/S0167-5060(08)70743-X
– volume: 6
  start-page: 521
  year: 2003
  ident: 268_CR30
  publication-title: J. Sched.
  doi: 10.1023/A:1026272526225
– ident: 268_CR29
  doi: 10.1109/SFCS.1989.63468
– volume: 29
  start-page: 298
  year: 1987
  ident: 268_CR26
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/0377-2217(87)90243-8
– volume: 5
  start-page: 287
  year: 1979
  ident: 268_CR1
  publication-title: Ann. Discret. Math.
  doi: 10.1016/S0167-5060(08)70356-X
– volume: 175
  start-page: 1
  year: 2016
  ident: 268_CR4
  publication-title: Int. J. Prod. Econ.
  doi: 10.1016/j.ijpe.2014.09.038
– volume: 38
  start-page: 47
  year: 2010
  ident: 268_CR18
  publication-title: Oper. Res. Lett.
  doi: 10.1016/j.orl.2009.09.010
– volume-title: Scheduling a Production Line to Minimize Maximum Tardiness
  year: 1955
  ident: 268_CR33
– volume: 5
  start-page: 329
  year: 2002
  ident: 268_CR27
  publication-title: J. Sched.
  doi: 10.1002/jos.103
– volume-title: Handbook of Scheduling: Algorithms, Models, and Performance Analysis
  year: 2004
  ident: 268_CR22
  doi: 10.1201/9780203489802
– volume: 55
  start-page: 328
  issue: 4
  year: 2008
  ident: 268_CR14
  publication-title: Nav. Res. Logist.
  doi: 10.1002/nav.20286
– volume: 116
  start-page: 251
  issue: 2
  year: 2008
  ident: 268_CR3
  publication-title: Int. J. Prod. Econ.
  doi: 10.1016/j.ijpe.2008.09.003
– volume: 204
  start-page: 229
  year: 2010
  ident: 268_CR16
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2009.10.025
– volume: 133
  start-page: 586
  year: 2011
  ident: 268_CR19
  publication-title: Int. J. Prod. Econ.
  doi: 10.1016/j.ijpe.2011.04.024
– volume: 2
  start-page: 203
  year: 1999
  ident: 268_CR7
  publication-title: J. Sched.
  doi: 10.1002/(SICI)1099-1425(199909/10)2:5<203::AID-JOS26>3.0.CO;2-5
– volume: 35
  start-page: 1127
  issue: 4
  year: 2008
  ident: 268_CR28
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2006.07.008
– volume: 33
  start-page: 620
  year: 2006
  ident: 268_CR20
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2004.07.010
– volume: 17
  start-page: 22
  year: 1992
  ident: 268_CR2
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.17.1.22
– ident: 268_CR10
  doi: 10.1007/978-1-4613-0303-9_25
– volume: 54
  start-page: 250
  year: 2007
  ident: 268_CR13
  publication-title: Nav. Res. Logist.
  doi: 10.1002/nav.20202
– volume: 411
  start-page: 3947
  year: 2010
  ident: 268_CR17
  publication-title: Theo. Comput. Sci.
  doi: 10.1016/j.tcs.2010.08.008
– volume: 18
  start-page: 690
  year: 1989
  ident: 268_CR25
  publication-title: SIAM J. Comput.
  doi: 10.1137/0218048
SSID ssib052855601
ssj0002962227
Score 2.158455
Snippet The problem of scheduling jobs with release and delivery time subject to machine eligibility constraints is considered. The eligible sets of the jobs are...
SourceID proquest
crossref
springer
SourceType Aggregation Database
Index Database
Publisher
StartPage 63
SubjectTerms Advisors
Algorithms
Approximation
Completion time
Management Science
Mathematical analysis
Mathematics
Mathematics and Statistics
Operations Research
Polynomials
Scheduling
SummonAdditionalLinks – databaseName: SpringerLINK Contemporary 1997-Present
  dbid: RSV
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LSwMxEA5aPejBt1itkoM3DbSb91G0RUSLtCr1tGSTXRGkle4q9N87SXdbFT3occkSwmQyz29mEDpWEagd3TLEcGcIsywiCVj9JAPbyPcHS5smFApfy25XDQb6tiwKyyu0e5WSDJJ6VuzGPG-C66uJdxwUkYtoCdSd8s-x13-ouIhHinNRJlO9PI608AWffsoceOxECDUoq2d-3varhpqbnd8ypUEBddb_d_QNtFYanPhsyiGbaCEdbqHVT20I4etm1rs130aPfbhH5wHqT_hqlOTYh2pxD9QTKDxshg5fpC8ezTHBoX4Eg-zxwRxcjHA3RE9x28OcA-p2gv1E0DCHosh30H2nfXd-ScoBDMRGslkQxzVLGDctI63RitFMZBL8R2NZKrVm2tGUM8MozYzg1oH0ZDxhImsqlljn6C6qDUfDdA9hmlCrs4gJaiMG3KCFA0mQgWvulExUVkcnFdHj12mfjXjWUTmQLwbyxYF8sayjRnUvcfnm8hgMFzi1BAOyjk6re5gv_77b_t9-P0ArkQe2BCBaA9WK8Vt6iJbte_Gcj48CL34A7CLVmA
  priority: 102
  providerName: Springer Nature
Title Scheduling Jobs with Release and Delivery Times Subject to Nested Eligibility Constraints
URI https://link.springer.com/article/10.1007/s40305-019-00268-7
https://www.proquest.com/docview/2932707112
Volume 9
WOSCitedRecordID wos000493356200001&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
  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
  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
  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: SpringerLink Contemporary
  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/eLvHCXMwpV3db9MwED-xlofxMGAfomxUfuCNWVsd27Gfpg06oQpVU8tHeYocO5mQUFuWgLT_njvPoYA0XnjJSyIr8V3ud3f-3R3ASyMQduzIcaeC49JLwUv0-nmNvhH1B6tOXSwUfpdPp2axsFcp4dYkWmVnE6OhDitPOfIThCWRIx6OxNn6G6epUXS6mkZobEGfOpXJHvQvxtOrWadRShildDpYJdssrKbiT5o4h49zrc0iVdLEejpJ6o_RteUUmxie_4lWGxf0r1PTCEaXj__3M57ATnJD2fmd3jyFB9VyFx791pxwDz7PUZ6BiOrXbLIqG0YpWzZDmELgY24Z2JvqK7E6blmsI2Fogyipw9oVm8YsKhsT3Tmyb28ZTQaN8yjaZh8-XI7fv37L0yAG7vFlWx6UlaVUbuRy76yRWa3rHONI52WVWyttyColncyy2mnlA1pRqUqp61MjSx9CdgC95WpZPQOWlZm3tZA680KiVlgd0CLUGKIHk5emHsCrbsOL9V2_jeJXZ-UongLFU0TxFPkAjrpdLtK_1xSbLR7AcSenze37V3v-79UOYVsQoSUS0I6g1958r17AQ_-j_dLcDKF_vphMPg2TBg6JRDrH62z-8SfJH9_-
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9NAEB6VFAk40PJS0wfdA5xgRbLvPVSooq3aNEQIikhPZr1rIySUtLUpyp_iNzK7sZuCBLceOFseyZ5v55uZnQfAM8OQdmzfUSeDo8ILRnP0-mmJvlGcD1b0XGoUHurRyIzH9t0S_Gx7YWJZZWsTk6EOUx9z5K-QlphGPuyz12fnNG6Nirer7QqNOSyOi9kPDNmqnaM91O9zxg72T94c0marAPUooKZBWpEL6fpOe2eN4KUqNQZFzotCWyts4IUUTnBeOiV9QJMgZC5U2TMi9yFwlHsLlgXHdzqwvDseDD61CJbMSKmai9zIBcyq2GwaN9z1raBKmXHTuZP690Q8bhjNWxpjIUP17-y4cHn_uKVN5Hew8r_9tlW437jZZHd-Lh7AUjF5CPeuDV98BKcfEK8hFuJ_IYNpXpGYkibvkYaR2ImbBLJXfItVKzOS-mQI2tiYtCL1lIxSlpjsx3LuVF08I3Hzadq3UVeP4eONfNsT6Eymk2INCM-5tyUTinsmEPVWBbR4pe3pYHRuyi68aBWcnc3niWRXk6MTHDKEQ5bgkOkubLZazRrbUmULlXbhZYuLxeO_S1v_t7RtuHN48naYDY9Gxxtwl8XinVRstwmd-uJ7sQW3_WX9tbp42qCewOebRswvkHM5Ng
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3dT9RAEJ8oGqIPqIDxBGEfeJMNd93vRyNcFPByATXHU7Pd7RIS0rvQasJ_7-xee4dEHoiPTZtNuzOdj53fbwZgT2fodszAUiu8pdzxjBYY9dOAsVHsD1b2bSIKn6rRSE8mZnyHxZ_Q7l1Jcs5piF2aquZg5sPBgvjGo55iGmxoTCI0VU_hGY9Dg2K-fv6z0yiRaSFkW1iNtjkzMpI_48Q5zN6plHrSMmn-vezf3moZgt6rmiZnNHz1_5_xGtbaQJR8mmvOG3hSVuvw8k57Qrz6tujpWm_AxTnK10fg-iU5nhY1iUe45AzdFjpCYitPDsvriPK4JYlXQtAmxUMe0kzJKJ2qkqMIf05o3FsSJ4Wm-RRNvQk_hkffP3-h7WAG6jLVb6gXhhdc2IFVzhrNWZBBYV5pHS-VMdx4VgpuOWPBSuE8WlUuCi5DX_PCec_ewko1rcp3QFjBnAkZl8xlHLXESI8WImDK7rUqdOjBx04A-WzefyNfdFpO25fj9uVp-3LVg-1ORnn7L9Y5BjT41goDyx7sdzJZ3n54tfePe3wXVseHw_z06-hkC15kEfuSsGrbsNLc_Co_wHP3u7mqb3aSiv4Bt1jhYA
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+Jobs+with+Release+and+Delivery+Times+Subject+to+Nested+Eligibility+Constraints&rft.jtitle=Journal+of+the+Operations+Research+Society+of+China+%28Internet%29&rft.au=Zhang%2C+Yu-Zhong&rft.au=Li%2C+Shu-Guang&rft.date=2021-03-01&rft.pub=Springer+Nature+B.V&rft.issn=2194-668X&rft.eissn=2194-6698&rft.volume=9&rft.issue=1&rft.spage=63&rft.epage=77&rft_id=info:doi/10.1007%2Fs40305-019-00268-7
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