| 模糊环境下单机调度中的总提前完工量问题 |
| |
| 引用本文： | 李裕梅,李洪兴. 模糊环境下单机调度中的总提前完工量问题[J]. 北京师范大学学报(自然科学版), 2006, 42(3): 236-239 |
| |
| 作者姓名： | 李裕梅 李洪兴 |
| |
| 作者单位： | 北京师范大学数学科学学院,100875,北京 |
| |
| 基金项目： | 国家高技术研究发展计划(863计划)，高等学校博士学科点专项科研项目，教育部科学技术基金，国家研究发展基金 |
| |
| 摘 要： | 在工件的加工时间及工期均为模糊参数的情况下,研究了单机调度中的总提前完工量问题.当工件具有共同工期及相同提前隶属水平时,给出了使得总提前完工量达到最大的最优调度;当工件具有共同工期及不同提前隶属水平时,给出了调度为最优的必要条件,并构造了求解该问题的分枝定界算法.
|
| 关 键 词： | 模糊环境 单机调度 提前完工量 最优调度 分枝定界算法 |
| 收稿时间： | 2005-12-21 |
| 修稿时间： | 2005-12-21 |
TOTAL COMPLETION EARLINESS PROBLEM OF SINGLE MACHINE SCHEDULING IN FUZZY ENVIRONMENTS |
| |
| Li Yumei,Li Hongxing. TOTAL COMPLETION EARLINESS PROBLEM OF SINGLE MACHINE SCHEDULING IN FUZZY ENVIRONMENTS[J]. Journal of Beijing Normal University(Natural Science), 2006, 42(3): 236-239 |
| |
| Authors: | Li Yumei Li Hongxing |
| |
| Affiliation: | School of Mathematical Sciences, Beijing Normal University, 100875, Beijing, China |
| |
| Abstract: | In the fuzzy environment that the processing times and the duedates of jobs are fuzzy parameters,the total completion earliness problem of single machine scheduling is investigated.In the case that the jobs have a common due-date and the same membership grade of earliness,an optimal scheduling is obtained in which the total completion earliness is maximized.In another case that the jobs have a common due-date and different membership grades of earliness,a necessary condition is given such that a schedule is optimal,and a corresponding branch and bound algorithm is proposed by which an optimal schedule can be found. |
| |
| Keywords: | fuzzy environment single machine scheduling total completion earliness optimal schedule branch and bound algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
