发布求助
文献互助 智能选刊 最新文献

时间约束调度的近似算法

Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing Pub Date : 1995-09-04 DOI:10.1109/ICAPP.1995.472254
K. Jansen, Sabine R. Öhring
{"title":"时间约束调度的近似算法","authors":"K. Jansen, Sabine R. Öhring","doi":"10.1109/ICAPP.1995.472254","DOIUrl":null,"url":null,"abstract":"In this paper we consider the following time constrained scheduling problem. Given a set of jobs J with execution times e(j)/spl isin/(0, .<<ETX>>","PeriodicalId":448130,"journal":{"name":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"95","resultStr":"{\"title\":\"Approximation algorithms for time constrained scheduling\",\"authors\":\"K. Jansen, Sabine R. Öhring\",\"doi\":\"10.1109/ICAPP.1995.472254\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we consider the following time constrained scheduling problem. Given a set of jobs J with execution times e(j)/spl isin/(0, .<<ETX>>\",\"PeriodicalId\":448130,\"journal\":{\"name\":\"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-09-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"95\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICAPP.1995.472254\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAPP.1995.472254","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 95

摘要

本文考虑以下的时间约束调度问题。给定一组作业J，其执行时间为e(J)/spl isin/(0， .>)
本文章由计算机程序翻译，如有差异，请以英文原文为准。
分享
查看原文 本刊更多论文
Approximation algorithms for time constrained scheduling
In this paper we consider the following time constrained scheduling problem. Given a set of jobs J with execution times e(j)/spl isin/(0, .<>
求助全文
通过发布文献求助，成功后即可免费获取论文全文。 去求助
来源期刊
Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing
Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信