Single-machine scheduling with operator non-availability to minimize total weighted completion time

In this paper, we investigate the single-machine scheduling with an operator non-availability period to minimize total weighted completion time, where the operator non-availability period is an open time interval in which no job can be started or be completed. For this problem, we present a pseudo-p...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Information sciences Ročník 445-446; s. 1 - 5
Hlavní autoři: Wan, Long, Yuan, Jinjiang
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.06.2018
Témata:
Dynamic programming
Fully polynomial-time approximation scheme
Non-availability period
Single-machine scheduling
Single-machine scheduling
Fully polynomial-time approximation scheme
Dynamic programming
90C27
Non-availability period
90B35
ISSN:0020-0255, 1872-6291
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 investigate the single-machine scheduling with an operator non-availability period to minimize total weighted completion time, where the operator non-availability period is an open time interval in which no job can be started or be completed. For this problem, we present a pseudo-polynomial-time algorithm and a fully polynomial-time approximation scheme. Our results address two open problems proposed in Chen et al. [2].
AbstractList In this paper, we investigate the single-machine scheduling with an operator non-availability period to minimize total weighted completion time, where the operator non-availability period is an open time interval in which no job can be started or be completed. For this problem, we present a pseudo-polynomial-time algorithm and a fully polynomial-time approximation scheme. Our results address two open problems proposed in Chen et al. [2].
Author Wan, Long
Yuan, Jinjiang
Author_xml – sequence: 1
  givenname: Long
  surname: Wan
  fullname: Wan, Long
  organization: School of Information Technology, Jiangxi University of Finance and Economics, Nanchang, Jiangxi 310013, PR China
– sequence: 2
  givenname: Jinjiang
  surname: Yuan
  fullname: Yuan, Jinjiang
  email: yuanjj@zzu.edu.cn
  organization: School of Mathematics and Statistics, Zhengzhou University, Zhengzhou, Henan 450001, PR China
BookMark eNp9kM9qwzAMh83YYG23B9jNL5DMTmwnYadR9g8KO6x349pKq5I4xfFauqefS3faoScJwSf99E3JtR88EPLAWc4ZV4_bHP2YF4zXOStzxuQVmfC6KjJVNPyaTBgrWMYKKW_JdBy3jDFRKTUh9gv9uoOsN3aDHuhoN-C-uzSkB4wbOuwgmDgEmu5lZm-wMyvsMB5pHGiPHnv8gdRH09ED4HoTwVE79LsOIg6eRuzhjty0phvh_q_OyPL1ZTl_zxafbx_z50Vmi6aKmRGKl3VVr1ThVkUpKsOFabgC2wppnAPZWlUqWQrB29rIBoRhTjZOclOrqpyR6rzWhmEcA7TaYjSnFDGk3JozfVKltzqp0idVmpU6qUok_0fuAvYmHC8yT2cG0kd7hKBHi-AtOAxgo3YDXqB_AbeHhhk
CitedBy_id crossref_primary_10_1142_S0217595923400171
crossref_primary_10_3390_math7080668
crossref_primary_10_1016_j_cor_2022_106133
crossref_primary_10_1016_j_cie_2021_107343
crossref_primary_10_1007_s10951_025_00842_3
crossref_primary_10_1007_s10878_020_00548_6
crossref_primary_10_3390_machines11020292
crossref_primary_10_3390_math12233678
crossref_primary_10_1007_s10878_022_00845_2
crossref_primary_10_1016_j_ejor_2022_03_043
crossref_primary_10_1016_j_eswa_2022_118068
Cites_doi 10.1007/BF00121681
10.1016/j.cie.2008.09.042
10.1007/s10288-008-0084-6
10.1007/s10878-015-9924-4
10.1007/s10951-012-0269-x
10.1016/j.disopt.2012.11.002
10.1287/ijoc.12.1.57.11901
10.1016/j.cie.2009.04.014
10.1016/S0377-2217(98)00367-1
10.1016/j.ins.2013.07.003
10.1016/j.ejor.2003.08.026
ContentType Journal Article
Copyright 2018 Elsevier Inc.
Copyright_xml – notice: 2018 Elsevier Inc.
DBID AAYXX
CITATION
DOI 10.1016/j.ins.2018.03.005
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Library & Information Science
EISSN 1872-6291
EndPage 5
ExternalDocumentID 10_1016_j_ins_2018_03_005
S0020025518301762
GroupedDBID --K
--M
--Z
-~X
.DC
.~1
0R~
1B1
1OL
1RT
1~.
1~5
29I
4.4
457
4G.
5GY
5VS
7-5
71M
8P~
9JN
9JO
AAAKF
AAAKG
AABNK
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AARIN
AAXUO
AAYFN
ABAOU
ABBOA
ABEFU
ABFNM
ABJNI
ABMAC
ABTAH
ABUCO
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADGUI
ADJOM
ADMUD
ADTZH
AEBSH
AECPX
AEKER
AENEX
AFFNX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHJVU
AHZHX
AIALX
AIEXJ
AIGVJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
APLSM
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BJAXD
BKOJK
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-Q
GBLVA
GBOLZ
HAMUX
HLZ
HVGLF
HZ~
H~9
IHE
J1W
JJJVA
KOM
LG9
LY1
M41
MHUIS
MO0
MS~
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
ROL
RPZ
SBC
SDF
SDG
SDP
SDS
SES
SEW
SPC
SPCBC
SSB
SSD
SST
SSV
SSW
SSZ
T5K
TN5
TWZ
UHS
WH7
WUQ
XPP
YYP
ZMT
ZY4
~02
~G-
77I
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
ADVLN
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
ID FETCH-LOGICAL-c297t-a4613878b62db2347a14a916ecf45adde5fc63653441f8a59e4a0d59d51a8673
ISICitedReferencesCount 11
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000430767700001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0020-0255
IngestDate Tue Nov 18 22:26:12 EST 2025
Sat Nov 29 06:25:05 EST 2025
Fri Feb 23 02:33:56 EST 2024
IsPeerReviewed true
IsScholarly true
Keywords Single-machine scheduling
Fully polynomial-time approximation scheme
Dynamic programming
90C27
Non-availability period
90B35
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c297t-a4613878b62db2347a14a916ecf45adde5fc63653441f8a59e4a0d59d51a8673
PageCount 5
ParticipantIDs crossref_citationtrail_10_1016_j_ins_2018_03_005
crossref_primary_10_1016_j_ins_2018_03_005
elsevier_sciencedirect_doi_10_1016_j_ins_2018_03_005
PublicationCentury 2000
PublicationDate June 2018
2018-06-00
PublicationDateYYYYMMDD 2018-06-01
PublicationDate_xml – month: 06
  year: 2018
  text: June 2018
PublicationDecade 2010
PublicationTitle Information sciences
PublicationYear 2018
Publisher Elsevier Inc
Publisher_xml – name: Elsevier Inc
References Lee (bib0006) 1996; 9
Ma, Chu, Zuo (bib0007) 2010; 58
Brauner, Finke, Lebacque, Rapine, Potts, Strusevich (bib0001) 2009; 7
Sadfi, Penz, Rapine, Blazewicz, Formanowicz (bib0010) 2005; 161
Chen, Zhang, Tan (bib0002) 2013; 251
Kacem, Paschos (bib0005) 2013; 10
Kacem, Mahjoub (bib0003) 2009; 56
Kacem, Kellerer, Seifaddini (bib0004) 2016; 32
Schmidt (bib0009) 2000; 121
Rapine, Brauner, Finke, Lebacque (bib0008) 2012; 15
Woeginger (bib0011) 2000; 12
Kacem (10.1016/j.ins.2018.03.005_bib0004) 2016; 32
Schmidt (10.1016/j.ins.2018.03.005_bib0009) 2000; 121
Lee (10.1016/j.ins.2018.03.005_bib0006) 1996; 9
Chen (10.1016/j.ins.2018.03.005_bib0002) 2013; 251
Sadfi (10.1016/j.ins.2018.03.005_bib0010) 2005; 161
Ma (10.1016/j.ins.2018.03.005_bib0007) 2010; 58
Woeginger (10.1016/j.ins.2018.03.005_bib0011) 2000; 12
Brauner (10.1016/j.ins.2018.03.005_bib0001) 2009; 7
Kacem (10.1016/j.ins.2018.03.005_bib0003) 2009; 56
Kacem (10.1016/j.ins.2018.03.005_bib0005) 2013; 10
Rapine (10.1016/j.ins.2018.03.005_bib0008) 2012; 15
References_xml – volume: 56
  start-page: 1708
  year: 2009
  end-page: 1712
  ident: bib0003
  article-title: Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed nonavailability interval
  publication-title: Comput. Ind. Eng.
– volume: 32
  start-page: 970
  year: 2016
  end-page: 981
  ident: bib0004
  article-title: Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval
  publication-title: J. Comb. Optim.
– volume: 10
  start-page: 61
  year: 2013
  end-page: 68
  ident: bib0005
  article-title: Weighted completion time minimization on a single-machine with a fixed non-availability interval: differential approximability
  publication-title: Discrete Optim.
– volume: 12
  start-page: 57
  year: 2000
  end-page: 74
  ident: bib0011
  article-title: When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)?
  publication-title: INFORMS J. Comput.
– volume: 15
  start-page: 127
  year: 2012
  end-page: 139
  ident: bib0008
  article-title: Single machine scheduling with small operator-non-availability periods
  publication-title: J. Sched.
– volume: 9
  start-page: 363
  year: 1996
  end-page: 382
  ident: bib0006
  article-title: Machine scheduling with an availability constraint
  publication-title: J. Global Optim.
– volume: 58
  start-page: 199
  year: 2010
  end-page: 211
  ident: bib0007
  article-title: A survey of scheduling with deterministic machine availability constraints
  publication-title: Comput. Ind. Eng.
– volume: 161
  start-page: 3
  year: 2005
  end-page: 10
  ident: bib0010
  article-title: An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
  publication-title: Eur. J. Oper. Res.
– volume: 251
  start-page: 150
  year: 2013
  end-page: 163
  ident: bib0002
  article-title: Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time
  publication-title: Inf. Sci.
– volume: 7
  start-page: 239
  year: 2009
  end-page: 253
  ident: bib0001
  article-title: Operator non-availability periods
  publication-title: 4OR: Q. J. Oper. Res.
– volume: 121
  start-page: 1
  year: 2000
  end-page: 15
  ident: bib0009
  article-title: Scheduling with limited machine availability
  publication-title: Eur. J. Oper. Res.
– volume: 9
  start-page: 363
  year: 1996
  ident: 10.1016/j.ins.2018.03.005_bib0006
  article-title: Machine scheduling with an availability constraint
  publication-title: J. Global Optim.
  doi: 10.1007/BF00121681
– volume: 56
  start-page: 1708
  year: 2009
  ident: 10.1016/j.ins.2018.03.005_bib0003
  article-title: Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed nonavailability interval
  publication-title: Comput. Ind. Eng.
  doi: 10.1016/j.cie.2008.09.042
– volume: 7
  start-page: 239
  year: 2009
  ident: 10.1016/j.ins.2018.03.005_bib0001
  article-title: Operator non-availability periods
  publication-title: 4OR: Q. J. Oper. Res.
  doi: 10.1007/s10288-008-0084-6
– volume: 32
  start-page: 970
  year: 2016
  ident: 10.1016/j.ins.2018.03.005_bib0004
  article-title: Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval
  publication-title: J. Comb. Optim.
  doi: 10.1007/s10878-015-9924-4
– volume: 15
  start-page: 127
  year: 2012
  ident: 10.1016/j.ins.2018.03.005_bib0008
  article-title: Single machine scheduling with small operator-non-availability periods
  publication-title: J. Sched.
  doi: 10.1007/s10951-012-0269-x
– volume: 10
  start-page: 61
  year: 2013
  ident: 10.1016/j.ins.2018.03.005_bib0005
  article-title: Weighted completion time minimization on a single-machine with a fixed non-availability interval: differential approximability
  publication-title: Discrete Optim.
  doi: 10.1016/j.disopt.2012.11.002
– volume: 12
  start-page: 57
  year: 2000
  ident: 10.1016/j.ins.2018.03.005_bib0011
  article-title: When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)?
  publication-title: INFORMS J. Comput.
  doi: 10.1287/ijoc.12.1.57.11901
– volume: 58
  start-page: 199
  year: 2010
  ident: 10.1016/j.ins.2018.03.005_bib0007
  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: 121
  start-page: 1
  year: 2000
  ident: 10.1016/j.ins.2018.03.005_bib0009
  article-title: Scheduling with limited machine availability
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/S0377-2217(98)00367-1
– volume: 251
  start-page: 150
  year: 2013
  ident: 10.1016/j.ins.2018.03.005_bib0002
  article-title: Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time
  publication-title: Inf. Sci.
  doi: 10.1016/j.ins.2013.07.003
– volume: 161
  start-page: 3
  year: 2005
  ident: 10.1016/j.ins.2018.03.005_bib0010
  article-title: An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2003.08.026
SSID ssj0004766
Score 2.30549
Snippet In this paper, we investigate the single-machine scheduling with an operator non-availability period to minimize total weighted completion time, where the...
SourceID crossref
elsevier
SourceType Enrichment Source
Index Database
Publisher
StartPage 1
SubjectTerms Dynamic programming
Fully polynomial-time approximation scheme
Non-availability period
Single-machine scheduling
Title Single-machine scheduling with operator non-availability to minimize total weighted completion time
URI https://dx.doi.org/10.1016/j.ins.2018.03.005
Volume 445-446
WOSCitedRecordID wos000430767700001&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: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1872-6291
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0004766
  issn: 0020-0255
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3LaxNBGB-k9aAH0apYtTIH8WAZ2J2d57FIRYsUwYC5LbOzs5KQJqFNH_Sv95vX7rZUUcHLEiaZZMnvt99rvgdCbxVvtZWNJQU3BWHalEQ3nfbT3Gmnm7IRIhQKf5HHx2o61V9TKu9ZGCcgl0t1daXX_xVqWAOwfensX8DdfykswGsAHa4AO1z_CPhvoIwWjpyELEm3D94raJNFH3NdrV04Wd8Hv5-YCzNbxE7dwQr1jUZOZtd-nIYvkrwMcVPXxsRzF6jih9GPLdpUzxTeS-q0N9O_p8KGVVKPYQBYXDuaLefAzB_jqEOphuyoGArL5TA3sjW97Um8kxKVS5SoSlIiaBzJlUUuY5wwNhac5UgD8ztFe4wyzMEf8V3WSxV70_JBj_XZhf4AOvhKIK5A4HgNvU0l1yD0tg8-H06PhsJZGQ-z833nY--QAHjrh-42XEbGyOQxepS8CHwQ0X-C7rnlDno46i25g_ZSRQp-h0cQ4STLnyJ7kyd44An2PMGZJ_g2T_BmhTNPcOAJzjzBA0-w58kzNPl4OPnwiaSJG8RSLTfEMLDulFSNoG1DKyZNyQw4EM52jHtNyDsrKsErMKI7Zbh2zBQt1y0vjRKyeo624KbcC4R5V4Kva4XtfH-khsFT32gqFKfMgo_CdlGR_83apm70fijKos5ph_MaAKg9AHVR1QDALnrfb1nHViy_-zDLENWJ_NFGrIFPv9728t-2vUIPhofkNdranJ67PXTfXmxmZ6dvEut-AnoWmpM
linkProvider Elsevier
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=Single-machine+scheduling+with+operator+non-availability+to+minimize+total+weighted+completion+time&rft.jtitle=Information+sciences&rft.au=Wan%2C+Long&rft.au=Yuan%2C+Jinjiang&rft.date=2018-06-01&rft.pub=Elsevier+Inc&rft.issn=0020-0255&rft.eissn=1872-6291&rft.volume=445-446&rft.spage=1&rft.epage=5&rft_id=info:doi/10.1016%2Fj.ins.2018.03.005&rft.externalDocID=S0020025518301762
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-0255&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-0255&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-0255&client=summon