Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences

We study server scheduling on parallel dedicated machines to minimize the makespan subject to given processing sequences. Before a job starts its processing on its designated machine, a loading operation must be performed, which is undertaken by a server shared by all the jobs. While the two-machine...

Full description

Saved in:
Bibliographic Details
Published in:The Journal of the Operational Research Society Vol. 72; no. 10; pp. 2286 - 2289
Main Authors: Cheng, T. C. E., Kravchenko, Svetlana A., Lin, Bertrand M. T.
Format: Journal Article
Language:English
Published: Taylor & Francis 03.10.2021
Subjects:
complexity
dynamic programming
fixed job sequence
makespan
Parallel machines
single server
ISSN:0160-5682, 1476-9360
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract We study server scheduling on parallel dedicated machines to minimize the makespan subject to given processing sequences. Before a job starts its processing on its designated machine, a loading operation must be performed, which is undertaken by a server shared by all the jobs. While the two-machine problem is polynomially solvable, we show that the problem becomes binary NP-hard when the number of machines is three, and propose a pseudo-polynomial algorithm to solve the problem with a constant number of machines.
AbstractList We study server scheduling on parallel dedicated machines to minimize the makespan subject to given processing sequences. Before a job starts its processing on its designated machine, a loading operation must be performed, which is undertaken by a server shared by all the jobs. While the two-machine problem is polynomially solvable, we show that the problem becomes binary NP-hard when the number of machines is three, and propose a pseudo-polynomial algorithm to solve the problem with a constant number of machines.
Author Lin, Bertrand M. T.
Kravchenko, Svetlana A.
Cheng, T. C. E.
Author_xml – sequence: 1
  givenname: T. C. E.
  surname: Cheng
  fullname: Cheng, T. C. E.
  organization: Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hung Hom
– sequence: 2
  givenname: Svetlana A.
  surname: Kravchenko
  fullname: Kravchenko, Svetlana A.
  organization: ArasCorp Development Center
– sequence: 3
  givenname: Bertrand M. T.
  orcidid: 0000-0003-0456-296X
  surname: Lin
  fullname: Lin, Bertrand M. T.
  organization: Institute of Information Management, National Chiao Tung University
BookMark eNqFkM1KAzEURoNUsK0-gpAXmJrMdJIZ3CjFPyi40aUMSebGpmSSmqTavr0ztG5c6OrCvd_5uJwJGjnvAKFLSmaUVOSKUEZKVuWznOT9ivOa5eUJGtM5Z1ldMDJC4yGTDaEzNIlxTQipCa3H6G3hu42FnUl77DWOED4h4KhW0G6tce_YO7wRQVgLFrfQGiUStLgTamUcRBy3cg0q4eSxNrv-svayb_nYglMQz9GpFjbCxXFO0ev93cviMVs-PzwtbpeZKhhPGRQtq4D3H2lNNas0EZTIqmaykpRpwgnngssqb0sta1pCKYs5K7mumNRa5MUUXR96VfAxBtCNMkkk410KwtiGkmYw1fyYagZTzdFUT5e_6E0wnQj7f7mbA2ec9qETXz7Ytklib33QQThlYlP8XfENtaGDXA
CitedBy_id crossref_primary_10_32604_cmes_2022_019754
crossref_primary_10_1007_s10479_025_06471_5
crossref_primary_10_3390_healthcare9060640
crossref_primary_10_1016_j_ejor_2025_05_030
crossref_primary_10_1007_s10288_023_00547_3
crossref_primary_10_1080_00207543_2024_2314714
Cites_doi 10.1016/j.cie.2013.07.020
10.1016/S0166-218X(99)00206-1
10.1016/j.ipl.2010.11.021
10.1002/(SICI)1520-6750(199810)45:7<705::AID-NAV4>3.0.CO;2-F
10.1016/j.cor.2013.08.015
10.1002/nav.21762
10.1134/S0005117910100103
10.1002/jos.120
10.1002/nav.21846
10.1016/S0895-7177(97)00236-7
ContentType Journal Article
Copyright Operational Research Society 2020 2020
Copyright_xml – notice: Operational Research Society 2020 2020
DBID AAYXX
CITATION
DOI 10.1080/01605682.2020.1779625
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Sciences (General)
Computer Science
Business
EISSN 1476-9360
EndPage 2289
ExternalDocumentID 10_1080_01605682_2020_1779625
1779625
Genre Research Article
GroupedDBID -~X
.DC
0BK
0R~
29L
30N
3R3
4.4
5GY
7WY
8R4
8R5
AAGDL
AAHIA
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
ABJNI
ABKVW
ABLIJ
ABLJU
ABMNI
ABPAQ
ABPPZ
ABXUL
ABXYU
ABYYQ
ACGFO
ACHQT
ACIWK
ACNCT
ACREN
ACTIO
ADEPB
ADFRT
ADGTB
ADMHG
ADNFJ
AEISY
AENEX
AEXYK
AEYOC
AFAIT
AFRVT
AFTQD
AGAYW
AGDLA
AHAJD
AHDZW
AIYEW
AJRNO
AKBVH
AKOOK
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AMTXH
AQRUH
AQTUD
ASPBG
AVWKF
AWYRJ
BLEHA
CBXGM
CCCUG
CCKSF
CS3
CYVLN
DGEBU
DU5
EBS
F5P
JAV
JST
KYCEM
LJTGL
M4Z
MS~
O9-
P2P
Q2X
RNANH
ROSJB
RPC
RSV
RTWRZ
SOJ
TAJZE
TASJS
TBQAZ
TDBHL
TEN
TFL
TFT
TFW
TN5
TTHFI
TUROJ
U5U
WH7
XSW
ZGOLN
~02
AAYXX
CITATION
ID FETCH-LOGICAL-c367t-e3d68e7901ff1f68f0a10b896b8b16f07077a7b82d5fb915e5b34657f86bffa23
IEDL.DBID TFW
ISICitedReferencesCount 9
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000555220900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0160-5682
IngestDate Sat Nov 29 06:38:27 EST 2025
Tue Nov 18 22:27:40 EST 2025
Mon Oct 20 23:47:28 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 10
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c367t-e3d68e7901ff1f68f0a10b896b8b16f07077a7b82d5fb915e5b34657f86bffa23
ORCID 0000-0003-0456-296X
PageCount 4
ParticipantIDs informaworld_taylorfrancis_310_1080_01605682_2020_1779625
crossref_primary_10_1080_01605682_2020_1779625
crossref_citationtrail_10_1080_01605682_2020_1779625
PublicationCentury 2000
PublicationDate 2021-10-03
PublicationDateYYYYMMDD 2021-10-03
PublicationDate_xml – month: 10
  year: 2021
  text: 2021-10-03
  day: 03
PublicationDecade 2020
PublicationTitle The Journal of the Operational Research Society
PublicationYear 2021
Publisher Taylor & Francis
Publisher_xml – name: Taylor & Francis
References CIT0010
CIT0001
CIT0110
CIT0003
CIT0002
CIT0005
CIT0007
CIT0006
Garey M. R. (CIT0004) 1979
CIT0009
CIT0008
References_xml – ident: CIT0007
  doi: 10.1016/j.cie.2013.07.020
– ident: CIT0005
  doi: 10.1016/S0166-218X(99)00206-1
– ident: CIT0009
  doi: 10.1016/j.ipl.2010.11.021
– ident: CIT0010
  doi: 10.1002/(SICI)1520-6750(199810)45:7<705::AID-NAV4>3.0.CO;2-F
– ident: CIT0006
  doi: 10.1016/j.cor.2013.08.015
– ident: CIT0002
  doi: 10.1002/nav.21762
– volume-title: Computers and intractability: A guide to the theory of NP-completeness
  year: 1979
  ident: CIT0004
– ident: CIT0110
  doi: 10.1134/S0005117910100103
– ident: CIT0001
  doi: 10.1002/jos.120
– ident: CIT0003
  doi: 10.1002/nav.21846
– ident: CIT0008
  doi: 10.1016/S0895-7177(97)00236-7
SSID ssj0009019
Score 2.3718107
Snippet We study server scheduling on parallel dedicated machines to minimize the makespan subject to given processing sequences. Before a job starts its processing on...
SourceID crossref
informaworld
SourceType Enrichment Source
Index Database
Publisher
StartPage 2286
SubjectTerms complexity
dynamic programming
fixed job sequence
makespan
Parallel machines
single server
Title Complexity of server scheduling on parallel dedicated machines subject to fixed job sequences
URI https://www.tandfonline.com/doi/abs/10.1080/01605682.2020.1779625
Volume 72
WOSCitedRecordID wos000555220900001&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 Online Journals
  customDbUrl:
  eissn: 1476-9360
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0009019
  issn: 0160-5682
  databaseCode: TFW
  dateStart: 19500301
  isFulltext: true
  titleUrlDefault: https://www.tandfonline.com
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwED4hhBAMlBYQ5SUPDDAE8rSdESEqBlQxFMGCojjxSUWlQU2K4N_jSx1oB2CAMY7Oii53vrP93XcAx26mtBAicHSmXSdEHhuXUqHjx1yg5r6XybpQ-Eb0-_LhIb61aMLSwippD40zooh6rSbnTlXZIOLOiRQt4pLKqHwzJERsknizCpvQT6456N1_0e66dWsPknBIpKnh-W6Whei0wF06F3V6rX_43k3YsCknu5jZSBuW9LgDqw3ivQOtprMDs47egfU5msIOtO14yU4sS_XpFjySFLFpVu-sQEaHu2YGs1c2sYtK3FkxZsQrPhrpEcvr6yCT3LLnGrxppiqnio6AWFUwHL6ZN0-FYp_A7m24610NLq8d26vByQIuKkcHOZdaGH0jesgluqnnKhlzJZXHkUiFRCqU9PMIVexFOlJByCOBkivE1A92YHlcjPUuMJPC6jDWmeJhHnrGmFKBSqSBykM0T7wLYfOPkswSmVM_jVHiNXynVuEJKTyxCu_C2afYy4zJ4zeBeN4Akqo-QsFZv5Mk-FF27w-y-7DmE3CGUArBASxXk6k-hJXstRqWk6Pavj8AcVf1-A
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LT8MwDLZ4iceBxwAxnjlwgEOhzyQ9IsQEYuw0xC6oatpYGhor2gqCf0_ctWM7AAc4NpWjyrVrx_38GeDYTpQWQniWTrRt-chD41LKt9yQC9TcdRJZNAo3RaslO51wsheGYJV0hsYRUUTxrSbnpmJ0BYk7J1a0gEvqo3LNkhChyeJnYT4wsZb489uNhy_iXbsY7kEiFslUXTzfbTMVn6bYSyfiTmPtP554HVbLrJNdjMxkA2Z0vwaLFei9BmvVcAdW-noNViaYCmuwUa4P2UlJVH26CY8kRYSa-QfLkFF91-xgjssmfFGXO8v6jKjFez3dY2nxR8jkt-y5wG-arYaviqpALM8Ydt_NnadMsTG2ewvuG1fty2urHNdgJR4XuaW9lEstjMIRHeQS7dixlQy5ksrhSLxCIhZKummAKnQCHSjP54FAyRVi7HrbMNfP-noHmMlitR_qRHE_9R1jT7FAJWJPpT6aK14Hv3pJUVJymdNIjV7kVJSnpcIjUnhUKrwOZ2OxlxGZx28C4aQFRHlRRcHRyJPI-1F29w-yR7B03b5rRs2b1u0eLLuEoyHQgrcPc_ngVR_AQvKWd4eDw8LYPwEQgvoi
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwED7xEoKBRwHxxgMDDIE8bWdEQAUCVQwgWFAUJz6pqDRVmyL49_hSB8oADDDG0WdFl7v47Hz3HcC-mykthAgcnWnXCZHHJqRU6PgxF6i572WyKhS-Fq2WfHiIbyybcGBplbSHxpFQRPWtpuDu5Vgz4o5JFC3iksqofDMkRGyS-EmYNqkzJye_bd5_6u66VW8PgjiEqYt4vpvmy_L0Rbx0bNlpLv7DAy_Bgs052cnISZZhQncbMFtT3huwWLd2YDbSGzA_plPYgGU7PmAHVqb6cAUeCUVymuUbK5DR6a6ZwWyWzeJFNe6s6DISFu90dIfl1f8gk92y54q9aaYaDBWdAbGyYNh-NXeeCsU-mN2rcNc8vz29cGyzBicLuCgdHeRcamHsjeghl-imnqtkzJVUHkdSFRKpUNLPI1SxF-lIBSGPBEquEFM_WIOpbtHV68BMDqvDWGeKh3noGW9KBSqRBioP0VzxDQjrd5RkVsmcGmp0Eq8WPLUGT8jgiTX4Bhx9wHojKY_fAPG4AyRldYaCo4YnSfAjdvMP2D2YvTlrJteXrastmPOJREOMhWAbpsr-UO_ATPZStgf93crV3wEZ9fjU
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=Complexity+of+server+scheduling+on+parallel+dedicated+machines+subject+to+fixed+job+sequences&rft.jtitle=The+Journal+of+the+Operational+Research+Society&rft.au=Cheng%2C+T.+C.+E.&rft.au=Kravchenko%2C+Svetlana+A.&rft.au=Lin%2C+Bertrand+M.+T.&rft.date=2021-10-03&rft.pub=Taylor+%26+Francis&rft.issn=0160-5682&rft.eissn=1476-9360&rft.volume=72&rft.issue=10&rft.spage=2286&rft.epage=2289&rft_id=info:doi/10.1080%2F01605682.2020.1779625&rft.externalDocID=1779625
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0160-5682&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0160-5682&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0160-5682&client=summon