Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection

We study a scheduling problem on parallel identical machines, where the objective function is maximizing the weighted number of jobs completed exactly at their due-dates. The scheduler may reject a subset of the jobs, and the total permitted rejection cost is assumed to be bounded. Thus, when a deci...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of scheduling Ročník 26; číslo 2; s. 193 - 207
Hlavní autoři: Atsmony, Matan, Mosheiov, Gur
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.04.2023
Springer Nature B.V
Témata:
Algorithms
Artificial Intelligence
Business and Management
Calculus of Variations and Optimal Control; Optimization
Dynamic programming
Operations Research/Decision Theory
Optimization
Polynomials
Rejection
Run time (computers)
Scheduling
Supply Chain Management
Scheduling
Job-rejection
Dynamic programming
Just-in-time
Parallel identical machines
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 study a scheduling problem on parallel identical machines, where the objective function is maximizing the weighted number of jobs completed exactly at their due-dates. The scheduler may reject a subset of the jobs, and the total permitted rejection cost is assumed to be bounded. Thus, when a decision has to be made regarding a certain job, the following options need to be considered: either ( i ) identify the set of machines on which the job can be scheduled on time, and assign the job to one of these machines, or ( ii ) reject the job (if possible), or ( iii ) delay the job. A pseudo-polynomial dynamic programming algorithm is introduced for this NP-hard problem. Medium size problems are solved in reasonable running times. We then study a different version of the problem, in which job-dependent due-windows are considered, and the job processing times are assumed to be identical. This version is proved to be NP-hard, and a pseudo-polynomial dynamic programming algorithm is introduced as well. Our numerical study indicates that medium size instances can be handled for this version. In addition, for both problems, an alternative solution procedure based on integer-linear-programming formulation is introduced.
AbstractList We study a scheduling problem on parallel identical machines, where the objective function is maximizing the weighted number of jobs completed exactly at their due-dates. The scheduler may reject a subset of the jobs, and the total permitted rejection cost is assumed to be bounded. Thus, when a decision has to be made regarding a certain job, the following options need to be considered: either (i) identify the set of machines on which the job can be scheduled on time, and assign the job to one of these machines, or (ii) reject the job (if possible), or (iii) delay the job. A pseudo-polynomial dynamic programming algorithm is introduced for this NP-hard problem. Medium size problems are solved in reasonable running times. We then study a different version of the problem, in which job-dependent due-windows are considered, and the job processing times are assumed to be identical. This version is proved to be NP-hard, and a pseudo-polynomial dynamic programming algorithm is introduced as well. Our numerical study indicates that medium size instances can be handled for this version. In addition, for both problems, an alternative solution procedure based on integer-linear-programming formulation is introduced.
We study a scheduling problem on parallel identical machines, where the objective function is maximizing the weighted number of jobs completed exactly at their due-dates. The scheduler may reject a subset of the jobs, and the total permitted rejection cost is assumed to be bounded. Thus, when a decision has to be made regarding a certain job, the following options need to be considered: either ( i ) identify the set of machines on which the job can be scheduled on time, and assign the job to one of these machines, or ( ii ) reject the job (if possible), or ( iii ) delay the job. A pseudo-polynomial dynamic programming algorithm is introduced for this NP-hard problem. Medium size problems are solved in reasonable running times. We then study a different version of the problem, in which job-dependent due-windows are considered, and the job processing times are assumed to be identical. This version is proved to be NP-hard, and a pseudo-polynomial dynamic programming algorithm is introduced as well. Our numerical study indicates that medium size instances can be handled for this version. In addition, for both problems, an alternative solution procedure based on integer-linear-programming formulation is introduced.
Author Mosheiov, Gur
Atsmony, Matan
Author_xml – sequence: 1
  givenname: Matan
  surname: Atsmony
  fullname: Atsmony, Matan
  email: matan.atsmony@mail.huji.ac.il
  organization: School of Business Administration, The Hebrew University
– sequence: 2
  givenname: Gur
  surname: Mosheiov
  fullname: Mosheiov, Gur
  organization: School of Business Administration, The Hebrew University
BookMark eNp9kMtO3DAUhq2KSgXaF-jKEmsXXyZxskQIChJSF8DacuzjiaPEHmxHXJ4eD1OpUheszkX_dy7_CToKMQBCPxn9xSiV55nRvmGEck5quWmI_IKOa68nbMObo498Q1om2m_oJOeJUtpJzo7RdG9GsOvswxaXiBf94hf_BriMgJ_Bb8cCFod1GSDh6HAMpPgF8BSHXAu800nPM8wVNKMPkPGzLyMe4hpsBauMJJjAFB_Dd_TV6TnDj7_xFD1eXz1c3pC7P79vLy_uiBGyLUQYa8E5y03XSUsNMCFa51rKZaebwcLQ92JoQNh-aJyDzrCNGHrDuaaUWy5O0dlh7i7FpxVyUVNcU6grFZc9Z1KKllYVP6hMijkncGqX_KLTq2JU7T1VB09V9VR9eKpkhbr_IOOL3j9Xkvbz56g4oLnuCVtI_676hHoHWN6PbA
CitedBy_id crossref_primary_10_1007_s10878_023_01074_x
crossref_primary_10_1007_s10844_025_00940_w
crossref_primary_10_46465_endustrimuhendisligi_1601313
crossref_primary_10_1016_j_cor_2025_107046
crossref_primary_10_1080_10556788_2024_2349091
crossref_primary_10_1080_00207543_2024_2314714
Cites_doi 10.1007/s10288-020-00436-z
10.1016/j.ipl.2017.12.004
10.1007/s10951-007-0030-z
10.1016/j.omega.2015.09.010
10.1007/s10479-018-2779-1
10.1007/s10951-018-0584-y
10.1080/00207543.2016.1266055
10.1080/01605682.2018.1506540
10.1016/j.ipl.2014.09.004
10.1080/00207543.2020.1727042
10.1007/s10951-010-0204-y
10.1007/s10951-017-0511-7
10.1016/0305-0548(95)00078-X
10.1007/s10951-012-0303-z
10.1007/s10951-013-0327-z
10.1007/978-981-15-3528-4_3
10.1504/IJSOM.2019.097527
10.1007/s40314-020-1130-z
10.1007/s10878-016-0044-6
10.1007/978-1-4614-1123-9_1
10.1080/01605682.2019.1621222
10.1007/s10951-005-2863-7
10.1051/ro/2017040
10.1080/0305215X.2020.1735380
10.1007/BF00121680
10.1016/S0305-0548(00)00086-1
10.1016/j.ipl.2019.02.008
ContentType Journal Article
Copyright The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022
The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022.
Copyright_xml – notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022
– notice: The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022.
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.-
M0C
M0N
M0S
M0T
P5Z
P62
PHGZM
PHGZT
PJZUB
PKEHL
PPXIY
PQBIZ
PQBZA
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PYYUZ
Q9U
DOI 10.1007/s10951-022-00745-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 Collection
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)
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials - QC
ProQuest Central
Business Premium Collection
ProQuest Technology Collection
ProQuest One
ProQuest Central
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 Global
Computing Database
ProQuest Health & Medical Collection
Healthcare Administration Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic (New)
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
ProQuest Central China
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
ProQuest Central China
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)
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
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 207
ExternalDocumentID 10_1007_s10951_022_00745_7
GrantInformation_xml – fundername: israel science foundation
  grantid: 2505/19
  funderid: http://dx.doi.org/10.13039/501100003977
GroupedDBID -57
-5G
-BR
-EM
-Y2
-~C
.4S
.86
.DC
.VR
06D
0R~
0VY
1N0
1OC
203
29L
2J2
2JN
2JY
2KG
2LR
2P1
2VQ
2~H
30V
31~
3V.
4.4
406
408
409
40D
40E
5GY
5VS
67Z
6NX
7WY
7X7
8-1
8AO
8FE
8FG
8FI
8FJ
8FL
8TC
8UJ
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
ABDZT
ABECU
ABFTD
ABFTV
ABHLI
ABHQN
ABIJN
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABUWG
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACHSB
ACHXU
ACIWK
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACXQS
ACZOJ
ADBBV
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
AFBPY
AFGCZ
AFKRA
AFLOW
AFQWF
AFWTZ
AFZJQ
AFZKB
AGAYW
AGDGC
AGJBK
AGMZJ
AGQEE
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHMBA
AHSBF
AHYZX
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJAOE
AJBLW
AJRNO
AJZVZ
ALIPV
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
AQUVI
ARAPS
ARCSS
ARMRJ
ASPBG
AVWKF
AXYYD
AYQZM
AZFZN
AZQEC
B-.
BA0
BAPOH
BDATZ
BENPR
BEZIV
BGLVJ
BGNMA
BPHCQ
BSONS
BVXVI
CAG
CCPQU
COF
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
DU5
DWQXO
EBLON
EBS
EDO
EHE
EIOEI
EJD
ESBYG
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRNLG
FRRFC
FSGXE
FWDCC
FYUFA
GGCAI
GGRSB
GJIRD
GNUQQ
GNWQR
GQ6
GQ7
GQ8
GROUPED_ABI_INFORM_COMPLETE
GXS
H13
HCIFZ
HF~
HG5
HG6
HLICF
HMCUK
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
I-F
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
LAK
LAW
LH4
LLZTM
M0C
M0N
M0T
M4Y
MA-
N2Q
NB0
NPVJJ
NQJWS
NU0
O9-
O93
O9G
O9J
OAM
OVD
P2P
P62
P9M
PF0
PQBIZ
PQBZA
PQQKQ
PROAC
PT4
Q2X
QOS
R89
R9I
RNI
ROL
RPX
RSV
RZC
RZD
S16
S1Z
S27
S3B
SAP
SBE
SDH
SHX
SISQX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
TEORI
TSG
TSK
TSV
TUC
TUS
U2A
UG4
UKHRP
UOJIU
UTJUX
UZXMN
VC2
VFIZW
W23
W48
W99
WK8
XPP
XV2
YLTOR
Z45
Z7X
Z83
Z88
ZMTXR
~A9
AAMMB
AAPKM
AAYXX
ABBRH
ABDBE
ABFSG
ABRTQ
ACSTC
ADHKG
AEFGJ
AEZWR
AFDZB
AFFHD
AFHIU
AFOHR
AGQPQ
AGXDD
AHPBZ
AHWEU
AIDQK
AIDYY
AIXLP
ALUQN
AMVHM
ATHPR
AYFIA
CITATION
PHGZM
PHGZT
PJZUB
PPXIY
PQGLB
7TA
7TB
7XB
8AL
8FD
8FK
FR3
JG9
JQ2
K9.
L.-
PKEHL
PQEST
PQUKI
PRINS
Q9U
ID FETCH-LOGICAL-c376t-3cddeffd2c887d0ce1336ff60278a5bdeb993b5e3d9b5ffe8c143b9c22a002d23
IEDL.DBID M0C
ISICitedReferencesCount 6
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000854418100001&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 Wed Nov 05 08:26:53 EST 2025
Sat Nov 29 01:47:25 EST 2025
Tue Nov 18 22:44:23 EST 2025
Fri Feb 21 02:43:37 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 2
Keywords Scheduling
Job-rejection
Dynamic programming
Just-in-time
Parallel identical machines
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c376t-3cddeffd2c887d0ce1336ff60278a5bdeb993b5e3d9b5ffe8c143b9c22a002d23
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
PQID 2792177360
PQPubID 43675
PageCount 15
ParticipantIDs proquest_journals_2792177360
crossref_primary_10_1007_s10951_022_00745_7
crossref_citationtrail_10_1007_s10951_022_00745_7
springer_journals_10_1007_s10951_022_00745_7
PublicationCentury 2000
PublicationDate 2023-04-01
PublicationDateYYYYMMDD 2023-04-01
PublicationDate_xml – month: 04
  year: 2023
  text: 2023-04-01
  day: 01
PublicationDecade 2020
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle Journal of scheduling
PublicationTitleAbbrev J Sched
PublicationYear 2023
Publisher Springer US
Springer Nature B.V
Publisher_xml – name: Springer US
– name: Springer Nature B.V
References Mor, Shapira (CR18) 2019; 70
Mor, Shapira (CR19) 2020; 71
Mosheiov, Shabtay (CR22) 2013; 16
Lann, Mosheiov (CR13) 1996; 23
Mor, Mosheiov, Shapira (CR17) 2019; 1
Wang, Yin, Jin (CR27) 2020
Gerstl, Mosheiov (CR6) 2017; 55
CR12
Yin, Cheng, Wang (CR29) 2017; 20
Mor, Shapira (CR20) 2020; 39
Gerstl, Mor, Mosheiov (CR5) 2015; 115
Shabtay, Gaspar, Kaspi (CR24) 2013; 16
Choi, Yoon (CR2) 2007; 10
Shabtay, Steiner (CR25) 2012
Bouzina, Emmons (CR1) 1996; 9
Gerstl, Mosheiov (CR7) 2020; 1
Mor, Mosheiov (CR16) 2021; 1
Koulamas, Kyparisis (CR11) 2021; 59
Hiraishi, Levner, Vlach (CR8) 2002; 29
Fiszman, Mosheiov (CR4) 2018; 132
Hung, Lin, Posner, Wei (CR10) 2019; 22
Mor, Mosheiov (CR15) 2020; 19
Mor, Mosheiov (CR14) 2018; 271
Huang, Wu, Liu (CR9) 2018; 52
Zhang, Xu, Du, Wu (CR30) 2018; 35
Mosheiov, Pruwer (CR21) 2021; 53
Sung, Vlach (CR26) 2005; 8
Yin, Cheng, Cheng, Wang, Wu (CR28) 2016; 63
Dabiri, Darestani, Naderi (CR3) 2019; 32
Shabtay, Bensoussan (CR23) 2012; 15
B Mor (745_CR14) 2018; 271
D Shabtay (745_CR24) 2013; 16
B Choi (745_CR2) 2007; 10
G Mosheiov (745_CR21) 2021; 53
Y Yin (745_CR28) 2016; 63
G Mosheiov (745_CR22) 2013; 16
S Fiszman (745_CR4) 2018; 132
745_CR12
KI Bouzina (745_CR1) 1996; 9
E Gerstl (745_CR6) 2017; 55
Y Yin (745_CR29) 2017; 20
W Huang (745_CR9) 2018; 52
A Lann (745_CR13) 1996; 23
E Gerstl (745_CR5) 2015; 115
B Mor (745_CR17) 2019; 1
B Mor (745_CR18) 2019; 70
K Hiraishi (745_CR8) 2002; 29
B Mor (745_CR20) 2020; 39
B Mor (745_CR16) 2021; 1
D Shabtay (745_CR23) 2012; 15
X Zhang (745_CR30) 2018; 35
HC Hung (745_CR10) 2019; 22
D Shabtay (745_CR25) 2012
B Mor (745_CR15) 2020; 19
SC Sung (745_CR26) 2005; 8
M Dabiri (745_CR3) 2019; 32
E Gerstl (745_CR7) 2020; 1
D Wang (745_CR27) 2020
C Koulamas (745_CR11) 2021; 59
B Mor (745_CR19) 2020; 71
References_xml – volume: 19
  start-page: 103
  issue: 1
  year: 2020
  ident: CR15
  article-title: A note: Flowshop scheduling with linear deterioration and job-rejection
  publication-title: 4OR
  doi: 10.1007/s10288-020-00436-z
– volume: 132
  start-page: 39
  year: 2018
  end-page: 43
  ident: CR4
  article-title: Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection
  publication-title: Information Processing Letters
  doi: 10.1016/j.ipl.2017.12.004
– volume: 10
  start-page: 237
  year: 2007
  end-page: 243
  ident: CR2
  article-title: Maximizing the weighted number of just-in-time jobs in flow shop scheduling
  publication-title: Journal of Scheduling
  doi: 10.1007/s10951-007-0030-z
– volume: 63
  start-page: 41
  year: 2016
  end-page: 47
  ident: CR28
  article-title: Just-in-time scheduling with two competing agents on unrelated parallel machines
  publication-title: Omega
  doi: 10.1016/j.omega.2015.09.010
– volume: 271
  start-page: 1079
  year: 2018
  end-page: 1085
  ident: CR14
  article-title: A note: Minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection
  publication-title: Annals of Operations Research
  doi: 10.1007/s10479-018-2779-1
– volume: 22
  start-page: 413
  year: 2019
  end-page: 431
  ident: CR10
  article-title: Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs
  publication-title: Journal of Scheduling
  doi: 10.1007/s10951-018-0584-y
– ident: CR12
– volume: 55
  start-page: 3164
  year: 2017
  end-page: 3172
  ident: CR6
  article-title: Single machine scheduling problems with generalized due-dates and job-rejection
  publication-title: International Journal of Production Research
  doi: 10.1080/00207543.2016.1266055
– volume: 70
  start-page: 1997
  year: 2019
  end-page: 2003
  ident: CR18
  article-title: Improved algorithms for scheduling on proportionate flowshop with job-rejection
  publication-title: Journal of the Operational Research Society
  doi: 10.1080/01605682.2018.1506540
– volume: 115
  start-page: 159
  year: 2015
  end-page: 162
  ident: CR5
  article-title: A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop
  publication-title: Information Processing Letters
  doi: 10.1016/j.ipl.2014.09.004
– volume: 59
  start-page: 1852
  year: 2021
  end-page: 1859
  ident: CR11
  article-title: The no-wait flow shop with rejection
  publication-title: International Journal of Production Research
  doi: 10.1080/00207543.2020.1727042
– volume: 15
  start-page: 39
  year: 2012
  end-page: 47
  ident: CR23
  article-title: Maximizing the weighted number of just-in-time jobs in several two-machine scheduling systems
  publication-title: Journal of Scheduling
  doi: 10.1007/s10951-010-0204-y
– volume: 20
  start-page: 313
  year: 2017
  end-page: 335
  ident: CR29
  article-title: Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
  publication-title: Journal of Scheduling
  doi: 10.1007/s10951-017-0511-7
– volume: 23
  start-page: 769
  year: 1996
  end-page: 781
  ident: CR13
  article-title: Single machine scheduling to minimize the number of early/tardy jobs
  publication-title: Computers and Operations Research
  doi: 10.1016/0305-0548(95)00078-X
– volume: 16
  start-page: 3
  year: 2013
  end-page: 28
  ident: CR24
  article-title: A survey on offline scheduling with rejection
  publication-title: Journal of Scheduling
  doi: 10.1007/s10951-012-0303-z
– volume: 16
  start-page: 519
  year: 2013
  end-page: 527
  ident: CR22
  article-title: Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times
  publication-title: Journal of Scheduling
  doi: 10.1007/s10951-013-0327-z
– start-page: 35
  year: 2020
  end-page: 63
  ident: CR27
  article-title: Parallel-machine rescheduling with job rejection in the presence of job unavailability
  publication-title: Rescheduling Under Disruptions in Manufacturing Systems
  doi: 10.1007/978-981-15-3528-4_3
– volume: 32
  start-page: 158
  year: 2019
  end-page: 172
  ident: CR3
  article-title: Multi-machine flow shop scheduling problems with rejection using genetic algorithm
  publication-title: International Journal of Services and Operations Management
  doi: 10.1504/IJSOM.2019.097527
– volume: 1
  start-page: 11
  year: 2020
  ident: CR7
  article-title: Single machine scheduling to maximize the number of on-time jobs with generalized due-dates
  publication-title: Journal of Scheduling
– volume: 39
  start-page: 1
  year: 2020
  end-page: 14
  ident: CR20
  article-title: Regular scheduling measures on proportionate flowshop with job rejection
  publication-title: Computational and Applied Mathematics
  doi: 10.1007/s40314-020-1130-z
– volume: 35
  start-page: 318
  year: 2018
  end-page: 330
  ident: CR30
  article-title: Approximation algorithms for precedence-constrained identical machine scheduling with rejection
  publication-title: Journal of Combinatorial Optimization
  doi: 10.1007/s10878-016-0044-6
– start-page: 3
  year: 2012
  end-page: 20
  ident: CR25
  article-title: Scheduling to maximize the number of just-in-time jobs: a survey
  publication-title: Just-in-Time Systems
  doi: 10.1007/978-1-4614-1123-9_1
– volume: 71
  start-page: 1315
  year: 2020
  end-page: 1325
  ident: CR19
  article-title: Scheduling with regular performance measures and optional job rejection on a single machine
  publication-title: Journal of the Operational Research Society
  doi: 10.1080/01605682.2019.1621222
– volume: 8
  start-page: 453
  year: 2005
  end-page: 460
  ident: CR26
  article-title: Maximizing weighted number of just-in-time jobs on unrelated parallel machines
  publication-title: Journal of Scheduling
  doi: 10.1007/s10951-005-2863-7
– volume: 52
  start-page: 315
  year: 2018
  end-page: 334
  ident: CR9
  article-title: Single-machine batch scheduling problem with job rejection and resource dependent processing times
  publication-title: RAIRO-Operations Research
  doi: 10.1051/ro/2017040
– volume: 53
  start-page: 408
  year: 2021
  end-page: 424
  ident: CR21
  article-title: On the minmax common-due-date problem: Extensions to position-dependent processing times, job rejection, learning effect, uniform machines and flowshops
  publication-title: Engineering Optimization
  doi: 10.1080/0305215X.2020.1735380
– volume: 9
  start-page: 379
  year: 1996
  end-page: 393
  ident: CR1
  article-title: Interval scheduling on identical machines
  publication-title: Journal of Global Optimization
  doi: 10.1007/BF00121680
– volume: 1
  start-page: 11
  year: 2019
  ident: CR17
  article-title: Flowshop scheduling with learning effect and job rejection
  publication-title: Journal of Scheduling
– volume: 1
  start-page: 13
  year: 2021
  ident: CR16
  article-title: Single machine scheduling to maximize the weighted number of on-time jobs with job-rejection
  publication-title: Operational Research
– volume: 29
  start-page: 841
  year: 2002
  end-page: 848
  ident: CR8
  article-title: Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
  publication-title: Computers and Operations Research
  doi: 10.1016/S0305-0548(00)00086-1
– volume: 53
  start-page: 408
  year: 2021
  ident: 745_CR21
  publication-title: Engineering Optimization
  doi: 10.1080/0305215X.2020.1735380
– volume: 35
  start-page: 318
  year: 2018
  ident: 745_CR30
  publication-title: Journal of Combinatorial Optimization
  doi: 10.1007/s10878-016-0044-6
– volume: 23
  start-page: 769
  year: 1996
  ident: 745_CR13
  publication-title: Computers and Operations Research
  doi: 10.1016/0305-0548(95)00078-X
– volume: 8
  start-page: 453
  year: 2005
  ident: 745_CR26
  publication-title: Journal of Scheduling
  doi: 10.1007/s10951-005-2863-7
– volume: 132
  start-page: 39
  year: 2018
  ident: 745_CR4
  publication-title: Information Processing Letters
  doi: 10.1016/j.ipl.2017.12.004
– volume: 59
  start-page: 1852
  year: 2021
  ident: 745_CR11
  publication-title: International Journal of Production Research
  doi: 10.1080/00207543.2020.1727042
– volume: 271
  start-page: 1079
  year: 2018
  ident: 745_CR14
  publication-title: Annals of Operations Research
  doi: 10.1007/s10479-018-2779-1
– volume: 9
  start-page: 379
  year: 1996
  ident: 745_CR1
  publication-title: Journal of Global Optimization
  doi: 10.1007/BF00121680
– volume: 29
  start-page: 841
  year: 2002
  ident: 745_CR8
  publication-title: Computers and Operations Research
  doi: 10.1016/S0305-0548(00)00086-1
– volume: 39
  start-page: 1
  year: 2020
  ident: 745_CR20
  publication-title: Computational and Applied Mathematics
  doi: 10.1007/s40314-020-1130-z
– volume: 115
  start-page: 159
  year: 2015
  ident: 745_CR5
  publication-title: Information Processing Letters
  doi: 10.1016/j.ipl.2014.09.004
– start-page: 35
  volume-title: Rescheduling Under Disruptions in Manufacturing Systems
  year: 2020
  ident: 745_CR27
  doi: 10.1007/978-981-15-3528-4_3
– volume: 63
  start-page: 41
  year: 2016
  ident: 745_CR28
  publication-title: Omega
  doi: 10.1016/j.omega.2015.09.010
– volume: 70
  start-page: 1997
  year: 2019
  ident: 745_CR18
  publication-title: Journal of the Operational Research Society
  doi: 10.1080/01605682.2018.1506540
– volume: 1
  start-page: 13
  year: 2021
  ident: 745_CR16
  publication-title: Operational Research
– volume: 1
  start-page: 11
  year: 2020
  ident: 745_CR7
  publication-title: Journal of Scheduling
– volume: 15
  start-page: 39
  year: 2012
  ident: 745_CR23
  publication-title: Journal of Scheduling
  doi: 10.1007/s10951-010-0204-y
– ident: 745_CR12
  doi: 10.1016/j.ipl.2019.02.008
– volume: 71
  start-page: 1315
  year: 2020
  ident: 745_CR19
  publication-title: Journal of the Operational Research Society
  doi: 10.1080/01605682.2019.1621222
– volume: 1
  start-page: 11
  year: 2019
  ident: 745_CR17
  publication-title: Journal of Scheduling
– start-page: 3
  volume-title: Just-in-Time Systems
  year: 2012
  ident: 745_CR25
  doi: 10.1007/978-1-4614-1123-9_1
– volume: 20
  start-page: 313
  year: 2017
  ident: 745_CR29
  publication-title: Journal of Scheduling
  doi: 10.1007/s10951-017-0511-7
– volume: 52
  start-page: 315
  year: 2018
  ident: 745_CR9
  publication-title: RAIRO-Operations Research
  doi: 10.1051/ro/2017040
– volume: 55
  start-page: 3164
  year: 2017
  ident: 745_CR6
  publication-title: International Journal of Production Research
  doi: 10.1080/00207543.2016.1266055
– volume: 22
  start-page: 413
  year: 2019
  ident: 745_CR10
  publication-title: Journal of Scheduling
  doi: 10.1007/s10951-018-0584-y
– volume: 10
  start-page: 237
  year: 2007
  ident: 745_CR2
  publication-title: Journal of Scheduling
  doi: 10.1007/s10951-007-0030-z
– volume: 16
  start-page: 519
  year: 2013
  ident: 745_CR22
  publication-title: Journal of Scheduling
  doi: 10.1007/s10951-013-0327-z
– volume: 19
  start-page: 103
  issue: 1
  year: 2020
  ident: 745_CR15
  publication-title: 4OR
  doi: 10.1007/s10288-020-00436-z
– volume: 32
  start-page: 158
  year: 2019
  ident: 745_CR3
  publication-title: International Journal of Services and Operations Management
  doi: 10.1504/IJSOM.2019.097527
– volume: 16
  start-page: 3
  year: 2013
  ident: 745_CR24
  publication-title: Journal of Scheduling
  doi: 10.1007/s10951-012-0303-z
SSID ssj0008721
Score 2.3620481
Snippet We study a scheduling problem on parallel identical machines, where the objective function is maximizing the weighted number of jobs completed exactly at their...
SourceID proquest
crossref
springer
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 193
SubjectTerms Algorithms
Artificial Intelligence
Business and Management
Calculus of Variations and Optimal Control; Optimization
Dynamic programming
Operations Research/Decision Theory
Optimization
Polynomials
Rejection
Run time (computers)
Scheduling
Supply Chain Management
SummonAdditionalLinks – databaseName: SpringerLINK Contemporary 1997-Present
  dbid: RSV
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1JS8QwFH64IXpwGRXHjRy8aaB2S3oUUTyIiBveSrPJDGMr03HBX-97XRwVFPRYslDykrfkfXkfwG7kaRdHWvI4VhSghIarxPkcLZGMA_IAKjqg2zNxfi7v7pKL5lFY2aLd25Rkpak_PXYjSnhCn5Pdi7iYhGk0d5IIGy6vbj_0rxT1aysMXDAwouTkxs9zfDVHYx_zW1q0sjYni__7zyVYaLxLdlhvh2WYsHkHZltwewcWWxIH1pzpDsx_qki4Av0rFKIhdPo9GxXsIXvtPfTeLEM3kb1Ut6jWsJpFhBWOFTkncnrWL1SJH4wKiQ8GdoADCaNpS0b3vEwRdxMOxG58aPsV-itfhZuT4-ujU97QMXCNAhvxQKMqdM74GhWT8bTF8DZ2LqbcZRYpYxX6OiqygUlU5JyVGn0xlWjfz1DtGj9Yg6m8yO06MBeGwksC7ZIoCNEDlZlnhAr9TMjYU4HswkErlVQ3tcqJMmOQjqss0yqnuMpptcqp6MLex5jHulLHr723WmGnzaktUyqmeCBEEHtd2G-FO27-ebaNv3XfhDlira8BQFswNRo-2W2Y0c-jXjncqXbzOyPB7SI
  priority: 102
  providerName: Springer Nature
Title Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection
URI https://link.springer.com/article/10.1007/s10951-022-00745-7
https://www.proquest.com/docview/2792177360
Volume 26
WOSCitedRecordID wos000854418100001&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: 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/eLvHCXMwpV1LSxxBEC7ig6AHHxvFNWbpgzdtHOfVM6dgRBESl0WN2XgZpl-yyzqjO6sRf71V83CNEC-5FDTT3QxUd727PoDtwFE2DFTEw1CSg-JrLmPrctREUeiRBVDCAV3-EN1u1O_HvTrgVtRllY1MLAW1zhXFyPeo0d2-EF7ofL2944QaRdnVGkJjBubIsqGSvlPn8EUSR6J6d4UuDLpIlKbcfPV0jgDmqZadtGjAxd-KaWptvkmQlnrnePl__3gFlmqLkx1UR2QVPpisBR-bgvcWLDfADqy-5y1YfNWl8BMMz5GxmirWr9kkZzfp4-Bm8GQYmo7sTxlZNZpVyCIstyzPOAHWs2EuCxwwai4-GpkRLqS6TVMwiv0ySXhOuBCn8bEZlhVh2Rr8PD66ODzhNUQDV8jECfcUikdrtatQWGlHGXR5Q2tDymemgdRGov0jA-PpWAbWmkihfSZj5bopimLteuswm-WZ2QBmfV84sadsHHg-WqVR6mghfTcVUehIL2rDfsOfRNX9ywlGY5RMOy8TTxPkaVLyNBFt2HlZc1t173h39lbDyKS-yUUy5WIbdpujMP38790239_tMywQcn1VBLQFs5PxvfkC8-phMijGHZgRv34T7YsOzH076vbOcPRd8E55wkt6gbQXXCE9O798BlzF_nA
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LTxRBEK4QND4OgiuGRZQ-6Ek7DPPqnoMxBiSQXTYmouE2Tr_IbnZnYGcU9Uf5G62aB4smcuPAcTLdPUnPV6-u6voAXkaednGkJY9jRQFKaLhKnM_REsk4IA-gpgP6MhSjkTw5ST4uwe_uLgyVVXY6sVbUptB0Rr5Nje52hAhi793ZOSfWKMqudhQaDSwG9ucFhmzl28M9_L-vfH__w_HuAW9ZBbjG71Y80CjRzhlfo3wZT1uM0mLnYkrBZZEyVqHJVpENTKIi56zU6FKoRPt-htrDUKMDVPl3wkAKkquB4JeaX4rmnheGTBiSUVp048pVPSK0p9p5stoRF38bwoV3-09CtrZz-yu3bYdW4VHrUbP3jQg8hiWb9-BeV9Dfg5WOuIK1eqwHD690YXwCk08IXEMV-aesKtgs-zGejX9Zhq4xu6hPjq1hDXMKKxwrcl6NZ5ZNClXiA6Pm6dOpneJEqku1JaOzbaaIrwon4jA-t5O64i1fg883shVPYTkvcrsOzIWh8JJAuyQKQvS6ZeYZoUI_EzL2VCD7sNPhIdVtf3aiCZmmi87ShKEUMZTWGEpFH15fzjlrupNcO3qzA07aaqoyXaCmD2866C1e_3-1jetX24L7B8dHw3R4OBo8gwc--oZNwdMmLFfzb_Y53NXfq3E5f1HLEIOvNw3JPxF1Vwg
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1bT9RAFD4hYIg8gK4aFlDnQZ50Qult2gdijLiRQDabAIb4Ujs3s5vdFrYFlJ_mr_OcXlgggTceeGw6M2mm35zLzDfnA_gQOMqGgYp4GEpKUHzNZWxdjp4oCj2KACo5oB8Hot-PTk7iwRz8a-_CEK2ytYmVoda5oj3yLSp0ty2EFzpbtqFFDHZ7n0_POClI0UlrK6dRQ2Tf_L3E9K3Y2dvFf73pur1vR1-_80ZhgCv8hpJ7Cle3tdpVuNa0owxmbKG1IR3HpYHURqL7loHxdCwDa02kMLyQsXLdFC2JpqIHaP4XBOaYRCccBD-vvUAk6jtfmD5hekZHpGs3ru2RuD3x6MmDB1zcdoqzSPfO4Wzl83orT3m2XsByE2mzL_XSeAlzJuvAYkv078BKK2jBGvvWgaUb1RlfwegQAa2Jqf-blTmbpH-Gk-GVYRgys8tqR9loViuqsNyyPOPlcGLYKJcFPjAqqj4emzF2JL6qKRjteTNJOlbYEZvxqRlVTLjsNRw_ylS8gfksz8wqMOv7wok9ZePA8zEaj1JHC-m7qYhCR3pRF7ZbbCSqqdtO8iHjZFZxmvCUIJ6SCk-J6MLH6z6nddWSB1tvtCBKGgtWJDMEdeFTC8PZ6_tHW3t4tPewiEhMDvb6--vw3MWQseZBbcB8OT03b-GZuiiHxfRdtZwY_HpsRP4HbmZgLA
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+to+maximize+the+weighted+number+of+on-time+jobs+on+parallel+machines+with+bounded+job-rejection&rft.jtitle=Journal+of+scheduling&rft.au=Atsmony%2C+Matan&rft.au=Mosheiov%2C+Gur&rft.date=2023-04-01&rft.pub=Springer+Nature+B.V&rft.issn=1094-6136&rft.eissn=1099-1425&rft.volume=26&rft.issue=2&rft.spage=193&rft.epage=207&rft_id=info:doi/10.1007%2Fs10951-022-00745-7&rft.externalDBID=HAS_PDF_LINK
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