A single machine preemptive scheduling problem with arbitrary release dates and fuzzy due dates

Xie Yuan, L. Ou
{"title":"A single machine preemptive scheduling problem with arbitrary release dates and fuzzy due dates","authors":"Xie Yuan, L. Ou","doi":"10.1109/CCCM.2009.5267472","DOIUrl":null,"url":null,"abstract":"Preemptive scheduling problem of a single machine subject to arbitrary release dates under uncertain situation is discussed. The release dates of jobs are independence and different with each other. Uncertainty means due dates are not accurate, which can be described by fuzzy set. The memberships of fuzzy due dates denote grade of satisfaction of completion times of corresponding jobs. The objective of the problem is to find an optimal schedule which maximizes the minimal grade of satisfaction of jobs completion times with respect to fuzzy due dates. By extending the method of corresponding problem with accurate due dates into fuzzy situation for the problem, an O(n2) algorithm is presented.","PeriodicalId":268670,"journal":{"name":"2009 ISECS International Colloquium on Computing, Communication, Control, and Management","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 ISECS International Colloquium on Computing, Communication, Control, and Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCCM.2009.5267472","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Preemptive scheduling problem of a single machine subject to arbitrary release dates under uncertain situation is discussed. The release dates of jobs are independence and different with each other. Uncertainty means due dates are not accurate, which can be described by fuzzy set. The memberships of fuzzy due dates denote grade of satisfaction of completion times of corresponding jobs. The objective of the problem is to find an optimal schedule which maximizes the minimal grade of satisfaction of jobs completion times with respect to fuzzy due dates. By extending the method of corresponding problem with accurate due dates into fuzzy situation for the problem, an O(n2) algorithm is presented.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有任意发布日期和模糊到期日的单机抢占调度问题
讨论了不确定情况下任意发布日期的单机抢占调度问题。工作的发布日期是独立的,彼此不同的。不确定性是指到期日不准确,可以用模糊集来描述。模糊到期日的隶属度表示相应工作完成时间的满意程度。该问题的目标是在模糊到期日的情况下,找到一个使作业完成时间满意度最小的最优调度。通过将具有准确到期日的对应问题的方法推广到问题的模糊情形,提出了一种O(n2)算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
The design of multi-signature certification algorithm protocol in emergency response system Operating characteristics analysis and deadband compensation for electric power system motor Significant differences between metaphoric idioms and literal expressions in Chinese comprehension: An ERP proof supporting left-hemisphere activation gradients and spatial involvement Using LPP and LS-SVM for spam filtering Cross-layer optimization based on utility maximization with delay constraints in ad hoc wireless networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1