This paper studies single-machine fuzzy scheduling problem. We formulate three kinds of scheduling model on the basis of fuzzy processing time and fuzzy due date.
本文研究了单机模糊调度问题,基于模糊加工时间和模糊交货期建立了三种调度问题的模型,采用遗传算法搜索最优排序。
参考来源 - 用遗传算法解决模糊加工时间与模糊交货期下的单机调度问题·2,447,543篇论文数据，部分数据来源于NoteExpress
研究了一种具有模糊交货期的最小化全部满意度的单机调度问题。
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.
应用推荐