摘要
研究单机模糊加工时间下确定最迟开工时间的调度问题。目标是在满足每个工作都以大于等于各自指定的隶属度属于完工集合的约束下，寻找工作的最大最迟开工时间。通过模糊数学知识对模型进行分析，对于特殊情况给出了问题的最优解，对于一般情况给出了一个最优解的必要条件。
A scheduling problem on the single machine with fuzzy processing time is studied. The objective is to obtain maximize the ready time of the scheme as late as possibility within the constraint that the grade of each jobs in the completion set is not less than a given value respectively. Through analyzing the model by applying fuzzy mathematics extension principles and the properties of jobs with fuzzy processing times, the optimal solutions of the problem are presented under some special cases, and a necessary condition of optimal solution is given under the general case.
出处
《控制与决策》
EI
CSCD
北大核心
2000年第1期71-74,共4页
Control and Decision
基金
国家自然科学基金项目!(69684005)
灿坤电器实业股份有限公司项目
关键词
模糊加工时间
最迟开工时间
隶属函数
调度
fuzzy processing time, ready time, membership function, scheduling problems
