研究了一种具有模糊交货期的最小化全部满意度的单机调度问题。
The problem of sequencing jobs with fuzzy due-dates on a single machine to maximize the degree of satisfaction among all the jobs is considered.
单机模糊交货期总加权满意程度最大化问题是一个NP -难问题。
The problem of maximizing total weighted satisfaction level for single machine with fuzzy due-date is a NP-hard problem.
调度的目的是同时最大化模糊交货期和混合优先约束的最小满意程度。
The objective is to maximize the minimum satisfaction level of fuzzy due dates and mixed precedence constraints.
讨论了一类模糊交货期和混合优先约束下的单机调度问题。模糊交货期表示对任务完成时间的满意程度；
A problem of scheduling jobs on a single machine subject to fuzzy due dates and mixed precedence constraints is discussed.
为了便于计算，用三角形模糊数表示模糊交货期，本文用模糊交货期的隶属函数来比较任务的完工时间和交货期，判断任务是否误工。
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 .
为了便于计算，用三角形模糊数表示模糊交货期，本文用模糊交货期的隶属函数来比较任务的完工时间和交货期，判断任务是否误工。
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 .
应用推荐