首页 | 本学科首页   官方微博 | 高级检索  
     

任务无准备时间最小化加权最大延误单机调度问题的若干结果
引用本文:孙秀平,谷云东,李洪兴. 任务无准备时间最小化加权最大延误单机调度问题的若干结果[J]. 北京师范大学学报(自然科学版), 2006, 42(5): 459-462
作者姓名:孙秀平  谷云东  李洪兴
作者单位:北京师范大学数学科学学院,100875,北京;北京师范大学管理学院,100875,北京
基金项目:国家重点基础研究发展计划(973计划),国家自然科学基金,中国博士后科学基金
摘    要:研究任务无准备时间最小化加权最大延误的单机调度问题,给出逆向最小带权延误排序法并证明其最优性.随后,引入延误差函数概念,借助它给出简化的基于延误差函数的排序算法.特别地,对于工期相同的情形,给出更简便的权值关于期限正态分布算法.最后,借助实例说明了上述算法的应用.

关 键 词:加权最大延误  调度  算法设计  最优化
收稿时间:2006-03-03
修稿时间:2006-03-03

MINIMIZE THE MAXIMUM LATENESS WITH WEIGHTED IN A SINGLE MACHINE PROBLEM
Sun Xiuping,Gu Yundong,Li Hongxing. MINIMIZE THE MAXIMUM LATENESS WITH WEIGHTED IN A SINGLE MACHINE PROBLEM[J]. Journal of Beijing Normal University(Natural Science), 2006, 42(5): 459-462
Authors:Sun Xiuping  Gu Yundong  Li Hongxing
Affiliation:1.school of Mathematical Sciences, Beijing Normal University, 100875, Beijing, China; 2.Department of System Science, School of Management, Beijing Normal University, 100875, Beijing, China
Abstract:The scheduling of production systems has been studied extensively for over fifty years.Although the scheduling problem with delay has attracted some attention,the most of them consider only weighted tardiness.In this paper,reversed order algorithm according to the minimum of job with weighted lateness and difference function algorithm are given to minimize the maximum of job with weighted lateness.If the deadline of every job is the same,it is shown that normal distribution order algorithm is an algorithm to minimize the maximum of job with weighted lateness.
Keywords:weighted lateness  scheduling  algorithm  optimize
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号