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

doi:10.1016/j.ipl.2018.10.002

CORC > 上海财经大学 > 上海财经大学

	Single machine lot scheduling to minimize the total weighted (discounted) completion time
	Zhang, E.1; Liu, Ming 2; Zheng, Feifeng 3; Xu, Yinfeng 3
刊名	INFORMATION PROCESSING LETTERS
	2019-02
卷号	142 页码:46-51
关键词	Algorithms Lot scheduling Single machine WSPT rule
ISSN号	0020-0190
DOI	10.1016/j.ipl.2018.10.002
英文摘要	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. (C) 2018 Elsevier B.V. All rights reserved.
WOS研究方向	Computer Science
语种	英语
出版者	ELSEVIER SCIENCE BV
WOS记录号	WOS:000454462600009
内容类型	期刊论文
源URL	[http://10.2.47.112/handle/2XS4QKH4/358]
专题	上海财经大学
通讯作者	Liu, Ming
作者单位	1.Shanghai Univ Finance & Econ, Sch Informat Management & Engn, Shanghai 200433, Peoples R China; 2.Tongji Univ, Sch Econ & Management, Shanghai 200092, Peoples R China; 3.Donghua Univ, Glorious Sun Sch Business & Management, Shanghai 200051, Peoples R China
推荐引用方式 GB/T 7714	Zhang, E.,Liu, Ming,Zheng, Feifeng,et al. Single machine lot scheduling to minimize the total weighted (discounted) completion time[J]. INFORMATION PROCESSING LETTERS,2019,142:46-51.
APA	Zhang, E.,Liu, Ming,Zheng, Feifeng,&Xu, Yinfeng.(2019).Single machine lot scheduling to minimize the total weighted (discounted) completion time.INFORMATION PROCESSING LETTERS,142,46-51.
MLA	Zhang, E.,et al."Single machine lot scheduling to minimize the total weighted (discounted) completion time".INFORMATION PROCESSING LETTERS 142(2019):46-51.