具有任意发布日期和模糊到期日的单机抢占调度问题

2009 ISECS International Colloquium on Computing, Communication, Control, and Management Pub Date : 2009-09-29 DOI:10.1109/CCCM.2009.5267472

Xie Yuan, L. Ou

{"title":"具有任意发布日期和模糊到期日的单机抢占调度问题","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":"{\"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}","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

摘要

讨论了不确定情况下任意发布日期的单机抢占调度问题。工作的发布日期是独立的，彼此不同的。不确定性是指到期日不准确，可以用模糊集来描述。模糊到期日的隶属度表示相应工作完成时间的满意程度。该问题的目标是在模糊到期日的情况下，找到一个使作业完成时间满意度最小的最优调度。通过将具有准确到期日的对应问题的方法推广到问题的模糊情形，提出了一种O(n2)算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2009 ISECS International Colloquium on Computing, Communication, Control, and Management

自引率

0.00%

发文量