模糊交货期窗口下极大化顾客满意数的最优调度  

Optimal Scheduling Problem to Maximum the Number of Satisfied Customers about Fuzzy Due Date Windows

作　　者：吴悦[1] 汪定伟[1] 

机构地区：[1]东北大学信息科学与工程学院

出　　处：《系统工程理论方法应用》1999年第1期33-38,共6页Systems Engineering Theory·Methodology·Applications

基　　金：国家863CIMS资助项目;国家自然科学基金

摘　　要：研究了模糊交货期窗口下，达到任务满意度的总数为最大的调度问题。定义了在有关任务完工时间的隶属函数，并假设只要任务的隶属函数达不到顾客的满意度，就导致固定惩罚。提出了最优调度的多项式算法。This paper is concerned with the scheduling problem which maximizes the number of satisfied customers in fuzzy due date windows. We define the membership function for the completion time. It is assumed that the fixed penalty will occur if the value of the membership function is less than the grade of satisfaction. A polynomial time algorithm is presented to determined optimal scheduling. An example is shown to illustrate the effectiveness of the algorithm.

关 键 词：提前/拖期调度 模糊交货期 调度 隶属函数 

分 类 号：F713.53[经济管理—市场营销]