【摘要】 研究了模糊交货期窗口下，达到任务满意度的总数为最大的调度问题。定义了在有关任务完工时间的隶属函数，并假设只要任务的隶属函数达不到顾客的满意度，就导致固定惩罚。提出了最优调度的多项式算法，计算例子说明了算法的有效性更多还原

【Abstract】 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.更多还原