Scheduling to minimize the maximum total completion time per machine

被引：4

作者：

Wan, Long ^{[1
]}

Ding, Zhihao ^{[2
]}

Li, Yunpeng ^{[2
]}

Chen, Qianqian ^{[2
]}

Tan, Zhiyi ^{[3
]}

机构：

[1] Jiangxi Univ Finance & Econ, Sch Informat Technol, Nanchang 330013, Peoples R China

[2] Zhejiang Univ, Dept Math, Hangzhou 310027, Zhejiang, Peoples R China

[3] Zhejiang Univ, Dept Math, State Key Lab CAD & CG, Hangzhou 310027, Zhejiang, Peoples R China

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2015年 / 242卷 / 01期

基金：

中国国家自然科学基金;

关键词：

Scheduling; Parallel machine; Worst-case ratio; 2 COMPETING AGENTS; FLOW-TIME; ALGORITHMS; CRITERIA;

D O I：

10.1016/j.ejor.2014.09.063

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this paper, we study the problem of minimizing the maximum total completion time per machine on m parallel and identical machines. We prove that the problem is strongly NP-hard if m is a part of the input. When m is a given number, a pseudo-polynomial time dynamic programming is proposed. We also show that the worst-case ratio of SPT is at most 2.608 and at least 2.5366 when m is sufficiently large. We further present another algorithm which has a worst-case ratio of 2. (C) 2014 Elsevier B.V. All rights reserved.

引用

页码：45 / 50

页数：6

共 50 条

[1] Scheduling multiple orders per job in a single machine to minimize total completion time
Mason, Scott J.
Chen, Jen-Shiang
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 207 (01) : 70 - 77
[2] Multiprocessor task scheduling to minimize the maximum tardiness and the total completion time
Cai, XQ
Lee, CY
Wong, TL
[J]. IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 2000, 16 (06): : 824 - 830
[3] Parallel-machine batching and scheduling to minimize total completion time
The Hong Kong Polytechnic Univ, Kowloon, Hong Kong
[J]. IIE Trans, 11 (953-956):
[4] Parallel-machine batching and scheduling to minimize total completion time
Cheng, TCE
Chen, ZL
Kovalyov, MY
Lin, BMT
[J]. IIE TRANSACTIONS, 1996, 28 (11) : 953 - 956
[5] Online scheduling of a single machine to minimize total weighted completion time
Anderson, EJ
Potts, CN
[J]. MATHEMATICS OF OPERATIONS RESEARCH, 2004, 29 (03) : 686 - 697
[6] An FPTAS for Uniform Machine Scheduling to Minimize The Total Completion Time and The Total Rejection Penalty
Wu, Dan
Luo, Chengxin
[J]. ADVANCES IN MECHATRONICS AND CONTROL ENGINEERING II, PTS 1-3, 2013, 433-435 : 2339 - 2342
[7] Single machine lot scheduling to minimize the total weighted (discounted) completion time
Zhang, E.
Liu, Ming
Zheng, Feifeng
Xu, Yinfeng
[J]. INFORMATION PROCESSING LETTERS, 2019, 142 : 46 - 51
[8] Scheduling a single continuous batch processing machine to minimize total completion time
Zhao, Yu-Fang
Tang, Li-Xin
[J]. Tien Tzu Hsueh Pao/Acta Electronica Sinica, 2008, 36 (02): : 367 - 370
[9] On-line scheduling of a single machine to minimize total weighted completion time
Anderson, EJ
Potts, CN
[J]. PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, : 548 - 557
[10] Unrelated parallel-machine scheduling to minimize total weighted completion time
Jeng-Fung Chen
[J]. Journal of Intelligent Manufacturing, 2015, 26 : 1099 - 1112

← 1 2 3 4 5 →