Online tradeoff scheduling on a single machine to minimize makespan and total weighted completion time

被引：8

作者：

Ma, Ran ^{[1
,2
]}

Yuan, Jinjiang ^{[1
]}

机构：

[1] Zhengzhou Univ, Sch Math & Stat, Zhengzhou 450001, Henan, Peoples R China

[2] Henan Polytech Univ, Sch Math & Informat Sci, Jiaozuo 454000, Henan, Peoples R China

来源：

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS | 2014年 / 158卷

关键词：

Scheduling; Online algorithms; Tradeoff; Makespan; Total weighted completion time; REJECTION;

D O I：

10.1016/j.ijpe.2014.07.027

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

In this paper we introduce the concept of online tradeoff scheduling to minimize two objective functions f(1) and f(2) simultaneously. An online algorithm A is called (rho(1),rho(2))-competitive for minimizing f(1) and f(2) if A is rho(1)-competitive for minimizing f(1) and rho(2)-competitive for minimizing f(2). A (rho(1),rho(2))-competitive online algorithm A is called nondominated if there is no other (rho(1)',rho(2)')-competitive online algorithm A' such that (rho(1)',rho(2)') <= (rho(1),rho(2)) and either rho(1)' < rho(1) or rho(2)' < rho(2). For the online tradeoff scheduling on a single machine to minimize makespan and total weighted completion time, we present a nondominated (1+alpha,1+1/alpha)-competitive online algorithm for each alpha with 0 < alpha <= 1. (C) 2014 Elsevier B.V. All rights reserved.

引用

页码：114 / 119

页数：6

共 50 条

[1] 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
[2] Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness
Qijia Liu
Jinjiang Yuan
[J]. Journal of Combinatorial Optimization, 2016, 32 : 385 - 395
[3] Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness
Liu, Qijia
Yuan, Jinjiang
[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 32 (02) : 385 - 395
[4] Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine
Fang, Yang
Lu, Xiwen
[J]. INFORMATION PROCESSING LETTERS, 2016, 116 (08) : 526 - 531
[5] 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
[6] 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
[7] A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time
Tao, Jiping
[J]. COMPUTERS & OPERATIONS RESEARCH, 2014, 43 : 215 - 224
[8] Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives
Sahu, Shesh Narayan
Gajpal, Yuvraj
Debbarma, Swapan
[J]. ANNALS OF OPERATIONS RESEARCH, 2018, 269 (1-2) : 623 - 640
[9] Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives
Shesh Narayan Sahu
Yuvraj Gajpal
Swapan Debbarma
[J]. Annals of Operations Research, 2018, 269 : 623 - 640
[10] The benefit of preemption for single machine scheduling so as to minimize total weighted completion time
Epstein, Leah
Levin, Asaf
[J]. OPERATIONS RESEARCH LETTERS, 2016, 44 (06) : 772 - 774

← 1 2 3 4 5 →