Scheduling on parallel dedicated machines with job rejection

We study scheduling problems on parallel dedicated machines. Thus, each job can be processed on one specific machine only. The option of job-rejection is considered, and the total permitted rejection cost of all the jobs is bounded. Six scheduling problems are solved: ( $ i $ i ) minimising makespan...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of production research Ročník 62; číslo 19; s. 6933 - 6940
Hlavní autoři: Mor, Baruch, Mosheiov, Gur
Médium: Journal Article
Jazyk:angličtina
Vydáno: Taylor & Francis 01.10.2024
Témata:
ISSN:0020-7543, 1366-588X
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 scheduling problems on parallel dedicated machines. Thus, each job can be processed on one specific machine only. The option of job-rejection is considered, and the total permitted rejection cost of all the jobs is bounded. Six scheduling problems are solved: ( $ i $ i ) minimising makespan, ( $ ii $ ii ) minimising makespan with release-dates, ( $ iii $ iii ) minimising total completion time, ( $ iv $ iv ) minimising total weighted completion time, ( $ v $ v ) minimising total load, and ( $ vi $ vi ) minimising maximum tardiness. Pseudo-polynomial dynamic programming algorithms are introduced for all these NP-hard problems.
AbstractList We study scheduling problems on parallel dedicated machines. Thus, each job can be processed on one specific machine only. The option of job-rejection is considered, and the total permitted rejection cost of all the jobs is bounded. Six scheduling problems are solved: ( $ i $ i ) minimising makespan, ( $ ii $ ii ) minimising makespan with release-dates, ( $ iii $ iii ) minimising total completion time, ( $ iv $ iv ) minimising total weighted completion time, ( $ v $ v ) minimising total load, and ( $ vi $ vi ) minimising maximum tardiness. Pseudo-polynomial dynamic programming algorithms are introduced for all these NP-hard problems.
Author Mor, Baruch
Mosheiov, Gur
Author_xml – sequence: 1
  givenname: Baruch
  orcidid: 0000-0002-6909-8160
  surname: Mor
  fullname: Mor, Baruch
  email: baruchm@ariel.ac.il
  organization: Ariel University
– sequence: 2
  givenname: Gur
  orcidid: 0000-0002-9052-9375
  surname: Mosheiov
  fullname: Mosheiov, Gur
  organization: Lev Academic Center
BookMark eNqFkMtKQzEURYNUsK1-gpAfuDXvpOhAKb6g4MAOnIU0D5uSJiX3Sunf20vrxIGeyRmcvTaHNQKDXLIH4BqjCUYK3SBEkOSMTggibEIoZhKzMzDEVIiGK_UxAMM-0_ShCzBq2zU6DFdsCO7e7cq7rxTzJywZbk01KfkEnXfRms47uDF2FbNv4S52K7guS1j92tsulnwJzoNJrb867TFYPD0uZi_N_O35dfYwbywVsmsC4TQQPyWSMCwVpQg7LJ0iQlixxFNFvLeHA3NIKs6RoIF6vJQSK2Y4pWNwe6y1tbRt9UHb2Jn-ga6amDRGuvegfzzo3oM-eTjQ_Be9rXFj6v5f7v7IxRxK3ZhdqcnpzuxTqaGabGOr6d8V3922dJc
CitedBy_id crossref_primary_10_46465_endustrimuhendisligi_1601313
crossref_primary_10_1007_s10479_025_06471_5
Cites_doi 10.1016/S0377-2217(99)00327-6
10.1016/j.cor.2012.07.015
10.2478/v10209-011-0004-y
10.1002/nav.20092
10.3390/su11247137
10.1057/palgrave.jors.2601117
10.1016/S0377-2217(03)00236-4
10.1002/nav.21744
10.1080/00207540310001631584
10.1007/978-3-319-08016-1_15
10.1016/S0925-5273(03)00011-2
10.1002/nav.20292
10.1016/j.procs.2020.09.043
10.1016/S0360-8352(97)00091-0
10.1002/nav.21846
10.1002/(SICI)1520-6750(200006)47:4<304::AID-NAV3>3.0.CO;2-1
10.1007/s10951-022-00745-7
10.1080/01605682.2020.1779625
10.1080/00207540802620779
10.1080/00207540802691374
10.1016/S0377-2217(02)00246-1
10.1016/j.ejor.2006.11.027
10.1016/j.cie.2009.10.003
10.1016/j.tcs.2010.02.006
10.1016/j.cie.2021.107209
10.1016/S0166-218X(03)00433-5
10.1016/j.cor.2020.105115
10.1016/j.ejor.2014.09.028
10.1080/00207543.2014.944631
10.1007/s10951-012-0303-z
10.1007/11750321_8
10.1007/s10878-016-0016-x
10.1016/j.tcs.2010.06.008
ContentType Journal Article
Copyright 2024 Informa UK Limited, trading as Taylor & Francis Group 2024
Copyright_xml – notice: 2024 Informa UK Limited, trading as Taylor & Francis Group 2024
DBID AAYXX
CITATION
DOI 10.1080/00207543.2024.2314714
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1366-588X
EndPage 6940
ExternalDocumentID 10_1080_00207543_2024_2314714
2314714
Genre Research Article
GrantInformation_xml – fundername: Deutsche Forschungsgemeinschaft
  grantid: 452470135
– fundername: Israel Science Foundation
  grantid: 884/22
– fundername: Israel Science Foundation
  grantid: 2505/19
GroupedDBID -~X
.7F
.QJ
0BK
0R~
29J
2DF
30N
4.4
5GY
5VS
8VB
A8Z
AAENE
AAGDL
AAHIA
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
ABCCY
ABFIM
ABHAV
ABJNI
ABLIJ
ABPAQ
ABPEM
ABTAI
ABXUL
ABXYU
ACGEJ
ACGFO
ACGFS
ACGOD
ACIWK
ACNCT
ACTIO
ADCVX
ADGTB
ADXPE
AEGXH
AEISY
AENEX
AEOZL
AEPSL
AEYOC
AFKVX
AFRVT
AGDLA
AGMYJ
AHDZW
AHQJS
AIAGR
AIJEM
AIYEW
AJWEG
AKBVH
AKOOK
AKVCP
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AQRUH
AQTUD
AVBZW
AWYRJ
BLEHA
CCCUG
CE4
CS3
DGEBU
DKSSO
DU5
EBD
EBE
EBO
EBR
EBS
EBU
EMK
EPL
ESTFP
E~A
E~B
GTTXZ
H13
HF~
HZ~
H~9
H~P
I-F
IPNFZ
J.P
KYCEM
LJTGL
M4Z
ML~
NA5
NX~
O9-
P2P
PQQKQ
QWB
RIG
RNANH
ROSJB
RTWRZ
S-T
SNACF
TASJS
TBQAZ
TDBHL
TEN
TFL
TFT
TFW
TH9
TN5
TNC
TTHFI
TUROJ
TWF
UT5
UU3
ZGOLN
ZL0
~S~
07I
1OL
1TA
4B5
AAYXX
ABDPE
ABRLO
ACKIV
ACTTO
ADUMR
ADXEU
AEHZU
AEMOZ
AEZBV
AFBWG
AFFNX
AFION
AGBKS
AGBLW
AGVKY
AGWUF
AGYFW
AI.
AKHJE
AKMBP
ALRRR
ALXIB
BGSSV
BWMZZ
C0-
C5H
CAG
CITATION
COF
CYRSC
DAOYK
DEXXA
EJD
FETWF
IFELN
K1G
L8C
NUSFT
OPCYK
RNS
TAJZE
TAP
UB6
VH1
ZCG
ZY4
ID FETCH-LOGICAL-c367t-f253f2e927241783301d17d8266c6b1982eec1784d07855063f3e1b77184a533
IEDL.DBID TFW
ISICitedReferencesCount 2
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001190722300001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0020-7543
IngestDate Sat Nov 29 05:36:26 EST 2025
Tue Nov 18 21:50:38 EST 2025
Mon Oct 20 23:47:46 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 19
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c367t-f253f2e927241783301d17d8266c6b1982eec1784d07855063f3e1b77184a533
ORCID 0000-0002-6909-8160
0000-0002-9052-9375
PageCount 8
ParticipantIDs crossref_citationtrail_10_1080_00207543_2024_2314714
informaworld_taylorfrancis_310_1080_00207543_2024_2314714
crossref_primary_10_1080_00207543_2024_2314714
PublicationCentury 2000
PublicationDate 2024-10-01
PublicationDateYYYYMMDD 2024-10-01
PublicationDate_xml – month: 10
  year: 2024
  text: 2024-10-01
  day: 01
PublicationDecade 2020
PublicationTitle International journal of production research
PublicationYear 2024
Publisher Taylor & Francis
Publisher_xml – name: Taylor & Francis
References e_1_3_2_27_1
e_1_3_2_28_1
e_1_3_2_29_1
e_1_3_2_20_1
e_1_3_2_21_1
e_1_3_2_22_1
e_1_3_2_23_1
e_1_3_2_24_1
e_1_3_2_25_1
e_1_3_2_26_1
e_1_3_2_16_1
e_1_3_2_9_1
e_1_3_2_17_1
e_1_3_2_8_1
e_1_3_2_18_1
e_1_3_2_7_1
e_1_3_2_19_1
e_1_3_2_2_1
e_1_3_2_31_1
e_1_3_2_30_1
e_1_3_2_10_1
e_1_3_2_33_1
e_1_3_2_11_1
e_1_3_2_32_1
e_1_3_2_6_1
e_1_3_2_12_1
e_1_3_2_5_1
e_1_3_2_13_1
e_1_3_2_34_1
e_1_3_2_4_1
e_1_3_2_14_1
e_1_3_2_3_1
e_1_3_2_15_1
References_xml – ident: e_1_3_2_19_1
  doi: 10.1016/S0377-2217(99)00327-6
– ident: e_1_3_2_31_1
  doi: 10.1016/j.cor.2012.07.015
– ident: e_1_3_2_9_1
  doi: 10.2478/v10209-011-0004-y
– ident: e_1_3_2_2_1
  doi: 10.1002/nav.20092
– ident: e_1_3_2_20_1
  doi: 10.3390/su11247137
– ident: e_1_3_2_18_1
  doi: 10.1057/palgrave.jors.2601117
– ident: e_1_3_2_27_1
  doi: 10.1016/S0377-2217(03)00236-4
– ident: e_1_3_2_30_1
  doi: 10.1002/nav.21744
– ident: e_1_3_2_6_1
  doi: 10.1080/00207540310001631584
– ident: e_1_3_2_21_1
  doi: 10.1007/978-3-319-08016-1_15
– ident: e_1_3_2_25_1
  doi: 10.1016/S0925-5273(03)00011-2
– ident: e_1_3_2_16_1
  doi: 10.1002/nav.20292
– ident: e_1_3_2_11_1
  doi: 10.1016/j.procs.2020.09.043
– ident: e_1_3_2_5_1
  doi: 10.1016/S0360-8352(97)00091-0
– ident: e_1_3_2_7_1
  doi: 10.1002/nav.21846
– ident: e_1_3_2_10_1
  doi: 10.1002/(SICI)1520-6750(200006)47:4<304::AID-NAV3>3.0.CO;2-1
– ident: e_1_3_2_3_1
  doi: 10.1007/s10951-022-00745-7
– ident: e_1_3_2_8_1
  doi: 10.1080/01605682.2020.1779625
– ident: e_1_3_2_12_1
  doi: 10.1080/00207540802620779
– ident: e_1_3_2_32_1
  doi: 10.1080/00207540802691374
– ident: e_1_3_2_14_1
  doi: 10.1016/S0377-2217(02)00246-1
– ident: e_1_3_2_23_1
  doi: 10.1016/j.ejor.2006.11.027
– ident: e_1_3_2_13_1
  doi: 10.1016/j.cie.2009.10.003
– ident: e_1_3_2_33_1
  doi: 10.1016/j.tcs.2010.02.006
– ident: e_1_3_2_26_1
  doi: 10.1016/j.cie.2021.107209
– ident: e_1_3_2_15_1
  doi: 10.1016/S0166-218X(03)00433-5
– ident: e_1_3_2_17_1
  doi: 10.1016/j.cor.2020.105115
– ident: e_1_3_2_28_1
  doi: 10.1016/j.ejor.2014.09.028
– ident: e_1_3_2_24_1
  doi: 10.1080/00207543.2014.944631
– ident: e_1_3_2_29_1
  doi: 10.1007/s10951-012-0303-z
– ident: e_1_3_2_4_1
  doi: 10.1007/11750321_8
– ident: e_1_3_2_34_1
  doi: 10.1007/s10878-016-0016-x
– ident: e_1_3_2_22_1
  doi: 10.1016/j.tcs.2010.06.008
SSID ssj0000584
Score 2.440756
Snippet We study scheduling problems on parallel dedicated machines. Thus, each job can be processed on one specific machine only. The option of job-rejection is...
SourceID crossref
informaworld
SourceType Enrichment Source
Index Database
Publisher
StartPage 6933
SubjectTerms dynamic programming algorithm
makespan
parallel dedicated machines
Scheduling
total completion time
total load
Title Scheduling on parallel dedicated machines with job rejection
URI https://www.tandfonline.com/doi/abs/10.1080/00207543.2024.2314714
Volume 62
WOSCitedRecordID wos001190722300001&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: PRVAWR
  databaseName: Taylor & Francis Journals Complete
  customDbUrl:
  eissn: 1366-588X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000584
  issn: 0020-7543
  databaseCode: TFW
  dateStart: 19610101
  isFulltext: true
  titleUrlDefault: https://www.tandfonline.com
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELZQxQADb0R5yQNrqiR2YltiQYiKqUKiEt2ixHYQVUhRE_j93DluaQdggDGKzoruzvdwPn9HyJUJRcm5ReZjZQKe5AriIGNBaEOmkT6GSeOGTYjRSE4m6sGjCRsPq8QeuuyIIlysxs2dF80CEYc3uCHRcQbdXcwHUKBAgEVGUKjs0cfHw6evWJxIz8McBiiyuMPz3Spr2WmNu3Ql6wx3_-F798iOLznpTecj-2TD1gdke4WI8JBcP4LtDILSn-mspsgHXlW2osb9xoGilL460KVtKB7c0umsoHM7dTCu-oiMh3fj2_vAz1UINEtFG5RxwsrYqlhA-haSwR43kTDQaKQ6LSIlY2s1vOBgSOQ7S1nJbFQISGM8h_LwmPTqWW1PCIVyL9d5ISBUSQ42l0InSuaR4aaQKrJ9whfqzLTnHMfRF1UWLalJO91kqJvM66ZPBkuxt4504zcBtWqrrHWnHWU3miRjP8qe_kH2jGzhYwfuOye9dv5uL8im_mhfmvmlc8VPfevVDw
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELagIAEDb0R5emBN1cRObEssCFGBKF2IRLcosR1EFVLUBn4_d0la0gEYYLYusu7sezjffUfIhemKlHOLzMfKONyPFfhBxpyu7TKN9DFMmnLYhBgM5HComr0wCKvEGjqtiCJKX42XGx-jZ5A4bOGGSMcZlHce70CGAh6WL5MVH2ItwvrC3tOXN_ZlzcTcdVBm1sXz3WcW4tMCe2kj7vS2_mPH22SzzjrpVXVMdsiSzXfJRoOLcI9cPoL5DOLSn-k4p0gJnmU2o6b8kwN5KX0tcZd2SvHtlo7GCZ3YUYnkyvdJ2LsJr2-derSCo1kgCif1fJZ6VnkCIriQDK65cYWBWiPQQeIq6VmrYYGDLZHyLGAps24iIJLxGDLEA9LKx7k9JBQyvljHiQBvJTmYXQrtKxm7hptEKte2CZ_pM9I17ThOv8gid85OWukmQt1EtW7apDMXe6t4N34TUE1jRUX54JFW00ki9qPs0R9kz8nabfjQj_p3g_tjso5LFdbvhLSKybs9Jav6o3iZTs7Kc_kJDZHZMA
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3NS8MwFH_oFNGD3-L8zMFrR9ukTQJeRB2KMgYO3K20SSqO2o2t-vf70nZzO6gHPYdXwnsv7yP95fcALrTLU8aMZT6W2mFBLDEOUuq4xqXK0sdQocthE7zTEf2-7NZowkkNq7Q9dFoRRZSx2h7ukU6niDj7ghsTHaPY3fmshQUKBli2DCslORa6dK_9_BWMA1ETMbuOlZk-4vnuMwvpaYG8dC7ttLf-YcPbsFnXnOSqcpIdWDL5LmzMMRHuweUTGk9bVPoLGebEEoJnmcmILv_jYFVK3krUpZkQe3NLBsOEjM2gxHHl-9Br3_au75x6sIKjaMgLJ_UDmvpG-hzzNxcUD7n2uMZOI1Rh4knhG6NwgaElLeFZSFNqvIRjHmMx1ocH0MiHuTkEgvVerOKEY6wSDI0uuAqkiD3NdCKkZ5rApuqMVE06bmdfZJE34yatdBNZ3US1bprQmomNKtaN3wTkvK2iorzuSKvZJBH9UfboD7LnsNa9aUeP952HY1i3KxXQ7wQaxfjdnMKq-iheJ-Oz0is_AWVg19Q
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+on+parallel+dedicated+machines+with+job+rejection&rft.jtitle=International+journal+of+production+research&rft.au=Mor%2C+Baruch&rft.au=Mosheiov%2C+Gur&rft.date=2024-10-01&rft.issn=0020-7543&rft.eissn=1366-588X&rft.volume=62&rft.issue=19&rft.spage=6933&rft.epage=6940&rft_id=info:doi/10.1080%2F00207543.2024.2314714&rft.externalDBID=n%2Fa&rft.externalDocID=10_1080_00207543_2024_2314714
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-7543&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-7543&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-7543&client=summon