具有准备时间的模糊交货期的排序问题  

Fuzzy due Dates Scheduling Problems with Ready Time

作　　者：霍录景[1] 米洪海[1] 马茜[2] 

机构地区：[1]北京师范大学珠海分校应用数学学院,珠海519085 [2]军事交通学院基础部,天津300161

出　　处：《科学技术与工程》2010年第29期7223-7225,共3页Science Technology and Engineering

摘　　要：分析了一类具有准备时间的模糊交货期的单机排序问题。将任务具有不同准备时间,任务加工允许中断,目标函数是最大延误的排序问题由经典交货期推广到模糊交货期,并给出了最大模糊延误修正值的定义,给出了一些性质。在此基础上给出了此类问题的算法。为了便于计算,用三角形模糊数表示模糊交货期,用模糊交货期的隶属函数来比较任务的完工时间和交货期,判断任务是否误工。A kind of fuzzy due dates scheduling problems with the ready time are investigated.The problem that jobs have different ready time and are preemptive with maximum lateness object function and classic delivery time has been discussed a lot.The problem to fuzzy due dates is extended,and the definition of the revised value of maximum fuzzy lateness along with some properties is proposed.Then the algorithm for this problem is given.The membership functions of fuzzy due dates represented by triangle numbers are employed to compare the completion time and due dates and to decide whether jobs are tardy.

关 键 词：三角形模糊数 模糊交货期 最大模糊延误修正值 

分 类 号：O159[理学—数学]