首页 | 本学科首页   官方微博 | 高级检索  
     

Minimizing Tardy Jobs in a Single Machine Scheduling Problem with Fuzzy Processing Times and Due Dates
引用本文:谢源 谢剑英. Minimizing Tardy Jobs in a Single Machine Scheduling Problem with Fuzzy Processing Times and Due Dates[J]. 东华大学学报(英文版), 2005, 22(4): 5-8
作者姓名:谢源 谢剑英
作者单位:Department of Automation, Shanghai Jiaotong University, Shanghai 200030
摘    要:IntroductionThere are many scheduling problems of practicalinterest in which the input data are uncertain or i mprecise,and this kind of uncertainty or i mprecision cannot bedescribed by probability theory.For these situations wherecharacteristics and constraints are neither deter ministic norprobabilistic,the problems may often be modeled withfuzzy sets.Fuzzy logic,which was introduced by Zadeh[1]hasbeen appliedto various industrial problems including productionsystems[2,3].Recently,there ha…

关 键 词:单机排定问题 模糊逻辑 模糊过程时间 模糊到期日 必然性测度 最小化迟缓工作 数学规划
收稿时间:2004-06-30

Minimizing Tardy Jobs in a Single Machine Scheduling Problem with Fuzzy Processing Times and Due Dates
XIE Yuan,XIE Jian-ying. Minimizing Tardy Jobs in a Single Machine Scheduling Problem with Fuzzy Processing Times and Due Dates[J]. Journal of Donghua University, 2005, 22(4): 5-8
Authors:XIE Yuan  XIE Jian-ying
Abstract:The optimality of a fuzzy logic alternative to the usual treatment of uncertainties in a scheduling system using fuzzy numbers is examined formally. Processing times and due dates are fuzzified and presented by fuzzy numbers. With introducing the necessity measure, we compare fuzzy completion times of jobs with fuzzy due dates to decide whether jobs are tardy. The object is to minimize the numbers of tardy jobs. The efficient solution method for this problem is proposed. And deterministic counterpart of this single machine scheduling problem is a special case of fuzzy version.
Keywords:Fuzzy logic  one machine scheduling  necessity measure  tardy jobs
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号