Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine

The online parallel-batch scheduling problem on single unbounded machine to minimize total weighted job completion time is studied. For the general case of processing time, we give an online algorithm with competitive ratio 5+1. When all jobs have identical processing times, we provide an optimal on...

Full description

Saved in:
Bibliographic Details
Published inInformation processing letters Vol. 116; no. 8; pp. 526 - 531
Main Authors Fang, Yang, Lu, Xiwen
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 01.08.2016
Elsevier Sequoia S.A
Subjects
Algorithms
Analysis of algorithms
Completion time
Data processing
Online
Online algorithm
Optimization
Optimization algorithms
Parallel processing
Parallel-batch scheduling
Production scheduling
Scheduling
Scheduling algorithms
Studies
Total weighted completion time
Unbounded machine
Parallel-batch scheduling
Total weighted completion time
Online algorithm
Analysis of algorithms
Unbounded machine
Online AccessGet full text
ISSN0020-0190
1872-6119
DOI10.1016/j.ipl.2016.03.010

Cover

Abstract The online parallel-batch scheduling problem on single unbounded machine to minimize total weighted job completion time is studied. For the general case of processing time, we give an online algorithm with competitive ratio 5+1. When all jobs have identical processing times, we provide an optimal online algorithm. •Design and analysis the online algorithms for 1|rj, B=+∞, online|∑wjCj.•Obtain an online algorithm with competitive ratio 5+1 for the general case of processing time.•Provide the optimal online algorithm when all jobs have identical processing times.
AbstractList The online parallel-batch scheduling problem on single unbounded machine to minimize total weighted job completion time is studied. For the general case of processing time, we give an online algorithm with competitive ratio 5+1. When all jobs have identical processing times, we provide an optimal online algorithm. •Design and analysis the online algorithms for 1|rj, B=+∞, online|∑wjCj.•Obtain an online algorithm with competitive ratio 5+1 for the general case of processing time.•Provide the optimal online algorithm when all jobs have identical processing times.
The online parallel-batch scheduling problem on single unbounded machine to minimize total weighted job completion time is studied. For the general case of processing time, this paper gives an online algorithm with competitive ratio ... When all jobs have identical processing times, this paper provides an optimal online algorithm. (ProQuest: ... denotes formulae/symbols omitted.)
The online parallel-batch scheduling problem on single unbounded machine to minimize total weighted job completion time is studied. For the general case of processing time, we give an online algorithm with competitive ratio View the MathML source5+1. When all jobs have identical processing times, we provide an optimal online algorithm.
Author Fang, Yang
Lu, Xiwen
Author_xml – sequence: 1
  givenname: Yang
  surname: Fang
  fullname: Fang, Yang
  organization: Shanghai Zhenhua Heavy Industries Co., Ltd., Shanghai, China
– sequence: 2
  givenname: Xiwen
  surname: Lu
  fullname: Lu, Xiwen
  email: xwlu@ecust.edu.cn
  organization: Department of Mathematics, School of Science, East China University of Science and Technology, Shanghai, China
BookMark eNp9kcFu3CAQhlGVSt2keYDckHrpxe5gbIzVUxU1baVIuSRnhPF4lxUGF3Cr5unDanvKIacZie-DYf5LcuGDR0JuGNQMmPhyrO3q6qa0NfAaGLwjOyb7phKMDRdkB9BABWyAD-QypSMAiJb3O7J_8M56pKuO2jl01aizOdBkDjht5WRPc6CL9Xaxz1j6rB39i3Z_yDhRE5bVYbbB02wXpKWmojikmx_D5qfCLNocygMfyftZu4TX_-sVebr7_nj7s7p_-PHr9tt9ZXgnc9UOKFo5NWM7TMPci2nUHEbZ6EHIrpVm7PUM0La6GQD03GkcTdNz2QF244ycX5HP53vXGH5vmLJabDLonPYYtqSYZAJEVxZR0E-v0GPYoi_TKdbLrhcAvCtUf6ZMDClFnJWxWZ_-nKO2TjFQpwDUUZUA1CkABVyVAIrJXplrtIuO_950vp4dLDv6YzGqZCx6g5ONaLKagn3DfgFgLKEs
CODEN IFPLAT
CitedBy_id crossref_primary_10_15388_21_INFOR471
crossref_primary_10_1007_s12652_022_03759_3
crossref_primary_10_1016_j_cor_2021_105639
Cites_doi 10.1007/s10951-010-0172-2
10.1287/opre.40.4.764
10.1007/3-540-61310-2_30
10.1287/moor.1040.0092
10.1007/s10479-004-5031-0
10.1080/00207720903428906
10.1023/B:JOCO.0000021939.01674.1f
10.1002/nav.5
10.1007/s40305-014-0060-0
10.1016/S0167-6377(03)00016-6
10.1023/A:1027316504440
10.1007/s10878-005-6855-5
10.1016/j.tcs.2006.12.040
10.1007/s10878-010-9298-6
ContentType Journal Article
Copyright 2016 Elsevier B.V.
Copyright Elsevier Sequoia S.A. Aug 2016
Copyright_xml – notice: 2016 Elsevier B.V.
– notice: Copyright Elsevier Sequoia S.A. Aug 2016
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1016/j.ipl.2016.03.010
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Computer and Information Systems Abstracts
Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1872-6119
EndPage 531
ExternalDocumentID 4041480991
10_1016_j_ipl_2016_03_010
S0020019016300345
Genre Feature
GrantInformation_xml – fundername: National Natural Science Foundation of China
  grantid: 11371137
  funderid: http://dx.doi.org/10.13039/501100001809
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1RT
1~.
1~5
29I
4.4
457
4G.
5GY
5VS
7-5
71M
8P~
9JN
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABBOA
ABEFU
ABFNM
ABFSI
ABJNI
ABMAC
ABTAH
ABXDB
ABYKQ
ACDAQ
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADJOM
ADMUD
AEBSH
AEKER
AENEX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BKOMP
BLXMC
CS3
DU5
E.L
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
G8K
GBLVA
GBOLZ
HLZ
HMJ
HVGLF
HZ~
IHE
J1W
KOM
LG9
M26
M41
MO0
MS~
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PQQKQ
Q38
R2-
RIG
ROL
RPZ
SBC
SDF
SDG
SDP
SES
SEW
SME
SPC
SPCBC
SSV
SSZ
T5K
TN5
UQL
WH7
WUQ
XPP
ZMT
ZY4
~G-
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
7SC
8FD
AFXIZ
AGCQF
AGRNS
JQ2
L7M
L~C
L~D
SSH
ID FETCH-LOGICAL-c358t-49e648d2b49d9f76dba30b82a968548cb7af0044a2900af5aebc273850e5bfe33
IEDL.DBID .~1
ISSN 0020-0190
IngestDate Wed Oct 01 14:17:15 EDT 2025
Fri Jul 25 07:45:16 EDT 2025
Thu Apr 24 23:07:08 EDT 2025
Wed Oct 01 03:08:59 EDT 2025
Fri Feb 23 02:16:27 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 8
Keywords Parallel-batch scheduling
Total weighted completion time
Online algorithm
Analysis of algorithms
Unbounded machine
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c358t-49e648d2b49d9f76dba30b82a968548cb7af0044a2900af5aebc273850e5bfe33
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
PQID 1785760035
PQPubID 45522
PageCount 6
ParticipantIDs proquest_miscellaneous_1816065190
proquest_journals_1785760035
crossref_citationtrail_10_1016_j_ipl_2016_03_010
crossref_primary_10_1016_j_ipl_2016_03_010
elsevier_sciencedirect_doi_10_1016_j_ipl_2016_03_010
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate August 2016
2016-08-00
20160801
PublicationDateYYYYMMDD 2016-08-01
PublicationDate_xml – month: 08
  year: 2016
  text: August 2016
PublicationDecade 2010
PublicationPlace Amsterdam
PublicationPlace_xml – name: Amsterdam
PublicationTitle Information processing letters
PublicationYear 2016
Publisher Elsevier B.V
Elsevier Sequoia S.A
Publisher_xml – name: Elsevier B.V
– name: Elsevier Sequoia S.A
References Poon, Yu (br0100) 2005; 133
Zhang, Cai, Wong (br0090) 2001; 48
Tian, Fu, Yuan (br0070) 2014; 2
Fang, Liu, Lu (br0120) 2011; 22
Deng, Poon, Zhang (br0080) 2003; 7
Lu, Sitters, Stougie (br0030) 2003; 31
Fu, Tian, Yuan, Lin (br0130) 2007; 374
Chen, Deng, Zang (br0050) 2004; 8
Anderson, Potts (br0040) 2004; 29
Cao, Yuan, Li, Bu (br0060) 2011; 42
Lee, Uzsoy, Martin-Vega (br0010) 1992; 40
Hoogeveen, Vestjens (br0020) 1996; 1084
Yuan, Fu, Ng, Cheng (br0140) 2011; 14
Poon, Yu (br0110) 2005; 9
Lu (10.1016/j.ipl.2016.03.010_br0030) 2003; 31
Lee (10.1016/j.ipl.2016.03.010_br0010) 1992; 40
Zhang (10.1016/j.ipl.2016.03.010_br0090) 2001; 48
Fu (10.1016/j.ipl.2016.03.010_br0130) 2007; 374
Poon (10.1016/j.ipl.2016.03.010_br0100) 2005; 133
Hoogeveen (10.1016/j.ipl.2016.03.010_br0020) 1996; 1084
Anderson (10.1016/j.ipl.2016.03.010_br0040) 2004; 29
Cao (10.1016/j.ipl.2016.03.010_br0060) 2011; 42
Tian (10.1016/j.ipl.2016.03.010_br0070) 2014; 2
Chen (10.1016/j.ipl.2016.03.010_br0050) 2004; 8
Yuan (10.1016/j.ipl.2016.03.010_br0140) 2011; 14
Poon (10.1016/j.ipl.2016.03.010_br0110) 2005; 9
Fang (10.1016/j.ipl.2016.03.010_br0120) 2011; 22
Deng (10.1016/j.ipl.2016.03.010_br0080) 2003; 7
References_xml – volume: 29
  start-page: 686
  year: 2004
  end-page: 697
  ident: br0040
  article-title: On-line scheduling of a single machine to minimize total weighted completion time
  publication-title: Math. Oper. Res.
– volume: 48
  start-page: 241
  year: 2001
  end-page: 258
  ident: br0090
  article-title: On-line algorithms for minimizing makespan on batch processing machines
  publication-title: Nav. Res. Logist.
– volume: 1084
  start-page: 404
  year: 1996
  end-page: 414
  ident: br0020
  article-title: Optimal on-line algorithms for single-machine scheduling
  publication-title: Lect. Notes Comput. Sci.
– volume: 9
  start-page: 167
  year: 2005
  end-page: 186
  ident: br0110
  article-title: On-line scheduling algorithms for a batch machine with finite capacity
  publication-title: J. Comb. Optim.
– volume: 22
  start-page: 509
  year: 2011
  end-page: 516
  ident: br0120
  article-title: Optimal on-line algorithms for one batch machine with grouped processing times
  publication-title: J. Comb. Optim.
– volume: 2
  start-page: 445
  year: 2014
  end-page: 454
  ident: br0070
  article-title: Online over time scheduling on parallel-batch machines: a survey
  publication-title: J. Oper. Res. Soc. China
– volume: 133
  start-page: 175
  year: 2005
  end-page: 181
  ident: br0100
  article-title: A flexible on-line scheduling algorithm for batch machine with infinite capacity
  publication-title: Ann. Oper. Res.
– volume: 31
  start-page: 232
  year: 2003
  end-page: 236
  ident: br0030
  article-title: A class of on-line scheduling algorithms to minimize total completion time
  publication-title: Oper. Res. Lett.
– volume: 42
  start-page: 51
  year: 2011
  end-page: 55
  ident: br0060
  article-title: Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times
  publication-title: Int. J. Syst. Sci.
– volume: 374
  start-page: 196
  year: 2007
  end-page: 202
  ident: br0130
  article-title: On-line scheduling in a parallel batch processing system to minimize makespan using restarts
  publication-title: Theor. Comput. Sci.
– volume: 8
  start-page: 85
  year: 2004
  end-page: 95
  ident: br0050
  article-title: On-line scheduling a batch processing system to minimize total weighted job completion time
  publication-title: J. Comb. Optim.
– volume: 14
  start-page: 361
  year: 2011
  end-page: 369
  ident: br0140
  article-title: A best on-line algorithm for unbounded parallel batch scheduling to minimize makespan with restarts
  publication-title: J. Sched.
– volume: 40
  start-page: 764
  year: 1992
  end-page: 775
  ident: br0010
  article-title: Efficient algorithms for scheduling semiconductor burn-in operations
  publication-title: Oper. Res.
– volume: 7
  start-page: 247
  year: 2003
  end-page: 257
  ident: br0080
  article-title: Approximation algorithms in batch processing
  publication-title: J. Comb. Optim.
– volume: 14
  start-page: 361
  year: 2011
  ident: 10.1016/j.ipl.2016.03.010_br0140
  article-title: A best on-line algorithm for unbounded parallel batch scheduling to minimize makespan with restarts
  publication-title: J. Sched.
  doi: 10.1007/s10951-010-0172-2
– volume: 40
  start-page: 764
  year: 1992
  ident: 10.1016/j.ipl.2016.03.010_br0010
  article-title: Efficient algorithms for scheduling semiconductor burn-in operations
  publication-title: Oper. Res.
  doi: 10.1287/opre.40.4.764
– volume: 1084
  start-page: 404
  year: 1996
  ident: 10.1016/j.ipl.2016.03.010_br0020
  article-title: Optimal on-line algorithms for single-machine scheduling
  publication-title: Lect. Notes Comput. Sci.
  doi: 10.1007/3-540-61310-2_30
– volume: 29
  start-page: 686
  year: 2004
  ident: 10.1016/j.ipl.2016.03.010_br0040
  article-title: On-line scheduling of a single machine to minimize total weighted completion time
  publication-title: Math. Oper. Res.
  doi: 10.1287/moor.1040.0092
– volume: 133
  start-page: 175
  year: 2005
  ident: 10.1016/j.ipl.2016.03.010_br0100
  article-title: A flexible on-line scheduling algorithm for batch machine with infinite capacity
  publication-title: Ann. Oper. Res.
  doi: 10.1007/s10479-004-5031-0
– volume: 42
  start-page: 51
  year: 2011
  ident: 10.1016/j.ipl.2016.03.010_br0060
  article-title: Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times
  publication-title: Int. J. Syst. Sci.
  doi: 10.1080/00207720903428906
– volume: 8
  start-page: 85
  year: 2004
  ident: 10.1016/j.ipl.2016.03.010_br0050
  article-title: On-line scheduling a batch processing system to minimize total weighted job completion time
  publication-title: J. Comb. Optim.
  doi: 10.1023/B:JOCO.0000021939.01674.1f
– volume: 48
  start-page: 241
  year: 2001
  ident: 10.1016/j.ipl.2016.03.010_br0090
  article-title: On-line algorithms for minimizing makespan on batch processing machines
  publication-title: Nav. Res. Logist.
  doi: 10.1002/nav.5
– volume: 2
  start-page: 445
  year: 2014
  ident: 10.1016/j.ipl.2016.03.010_br0070
  article-title: Online over time scheduling on parallel-batch machines: a survey
  publication-title: J. Oper. Res. Soc. China
  doi: 10.1007/s40305-014-0060-0
– volume: 31
  start-page: 232
  year: 2003
  ident: 10.1016/j.ipl.2016.03.010_br0030
  article-title: A class of on-line scheduling algorithms to minimize total completion time
  publication-title: Oper. Res. Lett.
  doi: 10.1016/S0167-6377(03)00016-6
– volume: 7
  start-page: 247
  year: 2003
  ident: 10.1016/j.ipl.2016.03.010_br0080
  article-title: Approximation algorithms in batch processing
  publication-title: J. Comb. Optim.
  doi: 10.1023/A:1027316504440
– volume: 9
  start-page: 167
  year: 2005
  ident: 10.1016/j.ipl.2016.03.010_br0110
  article-title: On-line scheduling algorithms for a batch machine with finite capacity
  publication-title: J. Comb. Optim.
  doi: 10.1007/s10878-005-6855-5
– volume: 374
  start-page: 196
  year: 2007
  ident: 10.1016/j.ipl.2016.03.010_br0130
  article-title: On-line scheduling in a parallel batch processing system to minimize makespan using restarts
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2006.12.040
– volume: 22
  start-page: 509
  year: 2011
  ident: 10.1016/j.ipl.2016.03.010_br0120
  article-title: Optimal on-line algorithms for one batch machine with grouped processing times
  publication-title: J. Comb. Optim.
  doi: 10.1007/s10878-010-9298-6
SSID ssj0006437
Score 2.1221015
Snippet The online parallel-batch scheduling problem on single unbounded machine to minimize total weighted job completion time is studied. For the general case of...
SourceID proquest
crossref
elsevier
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 526
SubjectTerms Algorithms
Analysis of algorithms
Completion time
Data processing
Online
Online algorithm
Optimization
Optimization algorithms
Parallel processing
Parallel-batch scheduling
Production scheduling
Scheduling
Scheduling algorithms
Studies
Total weighted completion time
Unbounded machine
Title Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine
URI https://dx.doi.org/10.1016/j.ipl.2016.03.010
https://www.proquest.com/docview/1785760035
https://www.proquest.com/docview/1816065190
Volume 116
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Baden-Württemberg Complete Freedom Collection (Elsevier)
  customDbUrl:
  eissn: 1872-6119
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0006437
  issn: 0020-0190
  databaseCode: GBLVA
  dateStart: 20110101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: Science Direct
  customDbUrl:
  eissn: 1872-6119
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0006437
  issn: 0020-0190
  databaseCode: .~1
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: ScienceDirect
  customDbUrl:
  eissn: 1872-6119
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0006437
  issn: 0020-0190
  databaseCode: ACRLP
  dateStart: 19950113
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: ScienceDirect
  customDbUrl:
  eissn: 1872-6119
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0006437
  issn: 0020-0190
  databaseCode: AIKHN
  dateStart: 19950113
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVLSH
  databaseName: Elsevier Journals
  customDbUrl:
  mediaType: online
  eissn: 1872-6119
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0006437
  issn: 0020-0190
  databaseCode: AKRWK
  dateStart: 19930125
  isFulltext: true
  providerName: Library Specific Holdings
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8QwEA6LXrz4FldXieBJqGbbPNqjiLIq7knBW0jSVFdqd9FdBA_-dmfSdkURD576SmiZNDOTzDffEHKowIdWjiWRcsZFYPHSKJUZj2IvZG6sYK7A3OGboRzc8at7cd8hZ20uDMIqG91f6_SgrZs7J400TyajEeb4Ih4I7BmyRiUcE805V1jF4PjjC-aBgaka5oEArGwe2QwYr9EEow99GXhOMYn2d9v0Q0sH03OxSpYbn5Ge1p-1Rjq-WicrbT0G2kzPDfJQ84ZSpPMuS19GFvTsI4X1K9gTTDun0zFFLpHn0buHc_C76VvYGvU5Ddhyj8NEsd48hSNuI5SeziqLtZegzXNAXvpNcndxfns2iJpCCpFLRDqNeOYlT_PY8izPCiVzaxJm09hkMoUVi7PKFBjZNXHGmCmE8dYFmhvmhS18kmyRhWpc-W1EQjnlwccFzyLnBYeOkrlY5rwPPYRQXcJaEWrXsIxjsYtSt3CyJw1S1yh1zRINUu-So3mXSU2x8Vdj3o6L_vafaDABf3XrtWOom0n6qvsqFRiXTESXHMwfw_TCmImp_HgGbdI-LPHAzWU7_3vzLlnCqxoz2CML05eZ3wM_Zmr3w4-6TxZPL68Hw09FXvIw
linkProvider Elsevier
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3Nb9MwFLe2cmCXAYOJbgU8iRNSqJP4IzmiialA21Mr9WbZjsM6pWnFWk3iwN--95ykCIR64JQo9lOi5_h9-P3ee4S8V2BDK8fSSDnjItB4WZTJnEeJF7IwVjBXYu7wZCpHc_51IRZH5LrLhUFYZSv7G5kepHX7ZNhyc7hZLjHHF_FAoM-walTKxTF5wkWi0AP7-Os3zgMjUw3OAxFY-T60GUBeyw2GH2IZCp1iFu2_ldNfYjronpvn5LQ1Gumn5rtekCNfn5FnXUMG2u7Pl-R7UziUYj3vqvJVZEHQ3lJwYEGhYN453a4pFhNZLX96uAfDmz6Es1Ff0AAu97hOFBvOU7jiOULl6a622HwJ5qwC9NK_IvObz7PrUdR2UohcKrJtxHMveVYkludFXipZWJMymyUmlxm4LM4qU2Jo1yQ5Y6YUxlsX6twwL2zp0_Sc9Op17V8jFMopD0YumBYFLzkQSuYSWfAYKIRQfcI6FmrXlhnHbheV7vBkdxq4rpHrmqUauN4nH_Ykm6bGxqHJvFsX_cePokEHHCIbdGuo2116r2OVCQxMpqJPrvbDsL8waGJqv97BnCwGHw_sXHbxf29-R56OZpOxHn-ZfrskJzjSAAgHpLf9sfNvwKjZ2rfhp30E40HzxQ
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=Online+parallel-batch+scheduling+to+minimize+total+weighted+completion+time+on+single+unbounded+machine&rft.jtitle=Information+processing+letters&rft.au=Fang%2C+Yang&rft.au=Lu%2C+Xiwen&rft.date=2016-08-01&rft.issn=0020-0190&rft.volume=116&rft.issue=8&rft.spage=526&rft.epage=531&rft_id=info:doi/10.1016%2Fj.ipl.2016.03.010&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_ipl_2016_03_010
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-0190&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-0190&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-0190&client=summon