|
|||||
|
|
| 非对称模糊加工时间工期指派调度优化问题的一类多项式求解算法 | |
| 引用本文： | 李金权,曾文艺,王群智.非对称模糊加工时间工期指派调度优化问题的一类多项式求解算法[J].北京师范大学学报(自然科学版),2017,53(2):127-132. |
| 作者姓名： | 李金权 曾文艺 王群智 |
| 作者单位： | 北京师范大学珠海分校应用数学学院,519087,广东珠海;北京师范大学信息科学与技术学院,100875,北京;西安交通大学城市学院,710018,陕西西安 |
| 基金项目： | 国家自然科学基金资助项目，广东省高等学校优秀青年教师培养计划资助项目 |
| 摘 要： | 针对工件加工时间为非对称模糊数,极小化提前完工惩罚和拖期完工惩罚之和的均值的单机工期指派调度优化问题 |
| 关 键 词： | 工期指派 模糊调度 模糊数 提前完工/拖期完工惩罚 可能性均值 可能性方差 |
A class of polynomially solvable algorithm for due date assignment scheduling problem with asymmetric fuzzy processing time |
|
| LI Jinquan,ZENG Wenyi,WANG Qunzhi.A class of polynomially solvable algorithm for due date assignment scheduling problem with asymmetric fuzzy processing time[J].Journal of Beijing Normal University(Natural Science),2017,53(2):127-132. | |
| Authors: | LI Jinquan ZENG Wenyi WANG Qunzhi |
| Institution: | 1)School of Applied Mathematics,Beijing Normal University,519087,Zhuhai,Guangdong,China; 2)College of Information Science and Technology,Beijing Normal University,100875,Beijing,China; 3)City College,Xi’an Jiaotong University,710018,Xi’an,Shaanxi,China |
| Abstract: | A single machine due date assignment scheduling problem with asymmetric fuzzy processing is investigated,to minimize the total earliness and tardiness penalties,written as 1 |～p | n∑-M(eiEi + tiTi).Further,it is proven to be polynomially solvable when the processing times have the same width ratio.A numerical example is shown to illustrate that the proposed method is effective based on the due date assignment scheduling problems with historical data of processing time. |
| Keywords: | due date assignment fuzzy scheduling fuzzy number earliness/tardiness penalty possibility mean value possibility variance |
| 本文献已被 CNKI 万方数据 等数据库收录！ | |
| 点击此处可从《北京师范大学学报(自然科学版)》浏览原始摘要信息 | |
| 点击此处可从《北京师范大学学报(自然科学版)》下载免费的PDF全文 | |