- 1、本文档共21页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Full Screen Search
Title Page
Problem Definition
Related works
Our results
1 / 20
JJ II
J I
←? ?→
Full Screen
Search
Close
by Yiwei Jiang
19 Dec. 2005
The 16th Annual International Symposium on Algorithms and Computation
December 19 - 21, 2005, Sanya, Hainan, China
Preemptive semi-online
scheduling with inexact
partial information
Yong He Yiwei Jiang
Department of Mathematics, Zhejiang University,
Hangzhou 310027, P. R. China
mathjyw@
Title Page
Problem Definition
Related works
Our results
2 / 20
JJ II
J I
←? ?→
Full Screen
Search
Close
by Yiwei Jiang
19 Dec. 2005
Outline
1 Problem Definition 3
Preemptive scheduling P(Q)|pmpt|Cmax . . . . 3
Inexact partial information . . . . . . . . . . . 6
Algorithm measure . . . . . . . . . . . . . . . 7
2 Related works 8
3 Our results 10
Optimal algorithm for Pm|pmpt,dis opt|Cmax . 12
Optimal algorithm for Q2|pmpt,dis opt|Cmax . . 14
Optimal algorithm for Q2|pmpt,dis opt|Cmax . . 17
Title Page
Problem Definition
Related works
Our results
3 / 20
JJ II
J I
←? ?→
Full Screen
Search
Close
by Yiwei Jiang
19 Dec. 2005
1 Problem Definition
Preemptive scheduling P(Q)|pmpt|Cmax
? A job set J = {p1, p2, . . . , pn}
A machine set M = {M1,M2, . . . ,Mm}.
? Two classes of machines:
Identical machine P: Mi has a speed of 1.
Uniform machine Q: Mi has a speed of si ≥ 1.
p j ?→Mi, p j/si time units. (Q2 : 1 = s1 ≤ s2 = s.)
? Preemption(pmpt) : It is allowed to split a job and
spread its processing over different machines in non-
overlapping time slots.
? The objective is to minimize the maximum machine
completion time Cmax (makespan).
Title Page
Problem Definition
Related works
Our results
4 / 20
JJ II
J I
←? ?→
Full Screen
Search
Close
by Yiwei Jiang
19 Dec. 2005
Three scheduling versions
? Offline Have full information on the job data
before constructing a schedule.
? Online Jobs arrive one by one over list and are
required to be scheduled irrevocably onto the
machines as soon as they are given, without any
knowledge about jobs that follow later on.
? semi-onlin
您可能关注的文档
- Everest企业版命令行参数详解.pdf
- Everything You Always Wanted to Know about Quicksort, but Were Afraid to Ask.pdf
- Everything you always wanted to know about SUSY, but were afraid to ask.pdf
- Everything You Wanted To Know About Sax But Were Afraid To Ask.pdf
- Evidence for competition between the superconducting and the pseudogap state in (BiPb)_2(Sr.pdf
- Evidence for Quantum Phase Slip Events in Superconducting Nanowires at High Bias Current.pdf
- Evolution of low-mass star and brown dwarf eclipsing binaries.pdf
- Evolution of Mid-IR Excess Around Sun-like Stars Constraints on Models of Terrestrial Plane.pdf
- Evolution of seismic signals and slip patterns along subduction zones insights from a frict.pdf
- EVOLUTION OF SOFTWARE AGENT-BASED E-COMMERCE BASED ON AGENT COMPETITION MODEL.pdf
- 青岛版《科学》二年级下册第五单元《科技产品》 16 制作磁悬浮笔架教学设计.docx
- 22 手指 教学设计.docx
- 2024-2025学年初中历史七年级上册(2024)统编版(部编版)(2024)教学设计合集.docx
- 2024-2025学年初中美术八年级上册人美版(常锐伦、欧京海)(2024)教学设计合集.docx
- 2024-2025学年小学数学四年级下册北京版(2024)教学设计合集.docx
- 2024-2025学年小学数学一年级下册冀教版(2024)教学设计合集.docx
- 华中师大版三年级心理健康教育 3.心情晴雨表 教案.docx
- Unit 2 Good habits 第四课时教案.docx
- 【核心素养目标】2 落花生 教案.docx
- 2024-2025学年小学信息技术(信息科技)四年级上册黔科版教学设计合集.docx
文档评论(0)