Single machine lot scheduling to minimize the total weighted (discounted) completion time

E. Zhang; Ming Liu; Feifeng Zheng; Yinfeng Xu

doi:10.1016/j.ipl.2018.10.002

Single machine lot scheduling to minimize the total weighted (discounted) completion time

E. Zhang
, Ming Liu
, Feifeng Zheng
, Yinfeng Xu

Shanghai University of Finance and Economics
Tongji University
Donghua University

科研成果: 期刊稿件 › 文章 › 同行评审

25 引用（Scopus）

摘要

In this work, we investigate the problem of single machine lot scheduling where each lot contains one or more jobs and is of identical processing time. Jobs with different sizes are splittable and shall be processed in consecutive lots. Any completed (part of a) job is delivered to the customer on its completion. We prove that the WSPT (Weighted Shortest Processing Time first) rule is optimal for both models of minimizing total weighted completion time and minimizing total weighted discounted completion time.

源语言	英语
页（从-至）	46-51
页数	6
期刊	Information Processing Letters
卷	142
DOI	https://doi.org/10.1016/j.ipl.2018.10.002
出版状态	已出版 - 2月 2019
已对外发布	是

访问文件

10.1016/j.ipl.2018.10.002

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{57d073d3bb7542b8b3001c358a763795,

title = "Single machine lot scheduling to minimize the total weighted (discounted) completion time",

abstract = "In this work, we investigate the problem of single machine lot scheduling where each lot contains one or more jobs and is of identical processing time. Jobs with different sizes are splittable and shall be processed in consecutive lots. Any completed (part of a) job is delivered to the customer on its completion. We prove that the WSPT (Weighted Shortest Processing Time first) rule is optimal for both models of minimizing total weighted completion time and minimizing total weighted discounted completion time.",

keywords = "Algorithms, Lot scheduling, Single machine, WSPT rule",

author = "E. Zhang and Ming Liu and Feifeng Zheng and Yinfeng Xu",

note = "Publisher Copyright: {\textcopyright} 2018 Elsevier B.V.",

year = "2019",

month = feb,

doi = "10.1016/j.ipl.2018.10.002",

language = "英语",

volume = "142",

pages = "46--51",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Single machine lot scheduling to minimize the total weighted (discounted) completion time

AU - Zhang, E.

AU - Liu, Ming

AU - Zheng, Feifeng

AU - Xu, Yinfeng

PY - 2019/2

Y1 - 2019/2

N2 - In this work, we investigate the problem of single machine lot scheduling where each lot contains one or more jobs and is of identical processing time. Jobs with different sizes are splittable and shall be processed in consecutive lots. Any completed (part of a) job is delivered to the customer on its completion. We prove that the WSPT (Weighted Shortest Processing Time first) rule is optimal for both models of minimizing total weighted completion time and minimizing total weighted discounted completion time.

AB - In this work, we investigate the problem of single machine lot scheduling where each lot contains one or more jobs and is of identical processing time. Jobs with different sizes are splittable and shall be processed in consecutive lots. Any completed (part of a) job is delivered to the customer on its completion. We prove that the WSPT (Weighted Shortest Processing Time first) rule is optimal for both models of minimizing total weighted completion time and minimizing total weighted discounted completion time.

KW - Algorithms

KW - Lot scheduling

KW - Single machine

KW - WSPT rule

UR - https://www.scopus.com/pages/publications/85055582707

U2 - 10.1016/j.ipl.2018.10.002

DO - 10.1016/j.ipl.2018.10.002

M3 - 文章

AN - SCOPUS:85055582707

SN - 0020-0190

VL - 142

SP - 46

EP - 51

JO - Information Processing Letters

JF - Information Processing Letters

ER -

Single machine lot scheduling to minimize the total weighted (discounted) completion time

摘要

访问文件

其它文件与链接

学术指纹

引用此