On-line scheduling of unit time jobs with rejection: minimizing the total completion time

被引：59

作者：

Epstein, L

Noga, J

Woeginger, GJ

机构：

[1] Univ Twente, Dept Math, NL-7500 AE Enschede, Netherlands

[2] Interdisciplinary Ctr, Sch Comp & Med Sci, IL-46150 Herzliyya, Israel

[3] Calif State Univ Northridge, Dept Comp Sci, Northridge, CA 91330 USA

[4] Graz Tech Univ, Math Inst, A-1080 Graz, Austria

来源：

OPERATIONS RESEARCH LETTERS | 2002年 / 30卷 / 06期

关键词：

scheduling; on-line algorithm; competitive analysis; worst-case bounds;

D O I：

10.1016/S0167-6377(02)00160-8

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We consider on-line scheduling of unit time jobs on a single machine with job-dependent penalties. The jobs arrive on-line (one by one) and can be either accepted and scheduled, or be rejected at the cost of a penalty. The objective is to minimize the total completion time of the accepted jobs plus the sum of the penalties of the rejected jobs. We give an on-line algorithm for this problem with competitive ratio 1/2(2 + root3) approximate to 1.86602. Moreover, we prove that there does not exist an on-line algorithm with competitive ratio better than 1.63784. (C) 2002 Elsevier Science B.V. All rights reserved.

引用

页码：415 / 420

页数：6

共 50 条

[1] On-line scheduling on a single machine: minimizing the total completion time
Fiat, A
Woeginger, GJ
[J]. ACTA INFORMATICA, 1999, 36 (04) : 287 - 293
[2] On-line scheduling on a single machine: minimizing the total completion time
Amos Fiat
Gerhard J. Woeginger
[J]. Acta Informatica, 1999, 36 : 287 - 293
[3] On-Line Scheduling of Unit Time Jobs with Rejection on Uniform Machines
Shoupeng Liu
Yuzhong Zhang
[J]. Journal of Systems Science and Complexity, 2008, 21 : 114 - 118
[4] On-line scheduling of unit time jobs with rejection on uniform machines
Liu, Shoupeng
Zhang, Yuzhong
[J]. JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2008, 21 (01) : 114 - 118
[5] ON-LINE SCHEDULING OF UNIT TIME JOBS WITH REJECTION ON UNIFORM MACHINES
Shoupeng LIU Yuzhong ZHANG Binzhou Medical University Yantai China Institute of Operations Research Qufu Normal University Rizhao China
[J]. JournalofSystemsScienceandComplexity., 2008, 21 (01) - 118
[6] ON-LINE SCHEDULING OF UNIT TIME JOBS WITH REJECTION ON UNIFORM MACHINES
Shoupeng LIU Yuzhong ZHANG Binzhou Medical University
[J]. Journal of Systems Science & Complexity, 2008, (01) : 114 - 118
[7] Minimizing the total weighted completion time of deteriorating jobs
Bachman, A
Janiak, A
Kovalyov, MY
[J]. INFORMATION PROCESSING LETTERS, 2002, 81 (02) : 81 - 84
[8] A class of on-line scheduling algorithms to minimize total completion time
Lu, X
Sitters, RA
Stougie, L
[J]. OPERATIONS RESEARCH LETTERS, 2003, 31 (03) : 232 - 236
[9] Minimizing the total completion time on-line on a single machine, using restarts
van Stee, R
La Poutré, H
[J]. ALGORITHMS-ESA 2002, PROCEEDINGS, 2002, 2461 : 872 - 883
[10] Minimizing the total completion time on-line on a single machine, using restarts
van Stee, R
La Poutré, H
[J]. JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2005, 57 (02): : 95 - 129

← 1 2 3 4 5 →