Semi-on-line scheduling problems for maximizing the minimum machine completion time

被引：0

作者：

He Yong

机构：

[1] Zhejiang University,Department of Mathematics

来源：

Acta Mathematicae Applicatae Sinica | 2001年 / 17卷 / 1期

关键词：

On-line; analysis of algorithm; worst-case analysis;

D O I：

10.1007/BF02669690

中图分类号：

学科分类号：

摘要：

This paper investigates several different semi-on-line two-machine scheduling problems for maximizing the minimum machine completion time. For each problem, we propose a best possible algorithm.

引用

页码：107 / 113

页数：6

共 50 条

[1] SEMI-ON-LINE SCHEDULING PROBLEMS FOR MAXIMIZING THE MINIMUM MACHINE COMPLETION TIME
何勇
[J]. Acta Mathematicae Applicatae Sinica, 2001, (01) : 107 - 113
[2] Semi-on-line scheduling problem for maximizing the minimum machine completion time on three special uniform machines
Luo, RZ
Sun, SJ
[J]. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2005, 22 (02) : 229 - 237
[3] Semi on-line scheduling for maximizing the minimum machine completion time on three uniform machines
Luo R.-Z.
Sun S.-J.
[J]. Journal of Zhejiang University-SCIENCE A, 2005, 6 (6): : 591 - 595
[4] Semi on-line scheduling for maximizing the minimum machine completion time on three uniform machines
罗润梓
孙世杰
[J]. Journal of Zhejiang University-Science A(Applied Physics & Engineering), 2005, (06) : 591 - 595
[5] Semi On-line Scheduling Problem for Maximizing the Minimum Machine Completion Time on mIdentical Machines
罗润梓
孙世杰
[J]. Advances in Manufacturing, 2005, (02) : 99 - 102
[6] Ordinal On-Line Scheduling for Maximizing the Minimum Machine Completion Time
Yong He
Zhiyi Tan
[J]. Journal of Combinatorial Optimization, 2002, 6 : 199 - 206
[7] Ordinal on-line scheduling for maximizing the minimum machine completion time
He, Y
Tan, ZY
[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2002, 6 (02) : 199 - 206
[8] Semi on-line scheduling problem for maximizing the minimum machine completion time on two uniform machines
Luo R.
Sun S.
Huang W.
[J]. Journal of Systems Science and Complexity, 2006, 19 (1) : 101 - 107
[9] SEMI ON-LINE SCHEDULING PROBLEM FOR MAXIMIZING THE MINIMUM MACHINE COMPLETION TIME ON TWO UNIFORM MACHINES
Runzi LUO Mathematic Department.Nanchang University
[J]. Journal of Systems Science & Complexity, 2006, (01) : 101 - 107
[10] Semi-on-line multiprocessor scheduling with given total processing time
Cheng, TCE
Kellerer, H
Kotov, V
[J]. THEORETICAL COMPUTER SCIENCE, 2005, 337 (1-3) : 134 - 146

← 1 2 3 4 5 →