具有学习效应的两个单机排序问题(英文)  

Two single machine scheduling problems with a learning effect

作　　者：王吉波[1] 马力[2] 王利岩[1,3] 王丹[1] 殷那[1] 

机构地区：[1]沈阳航空工业学院理学院,辽宁沈阳110136 [2]沈阳职业技术学院软件学院,辽宁沈阳110045 [3]大连理工大学应用数学系,辽宁大连116024

出　　处：《大连理工大学学报》2008年第6期932-936,共5页Journal of Dalian University of Technology

基　　金：Supported by:Science Research Foundation of the Educational Depart ment of Liaoning Province(No.20060662)~~

摘　　要：研究工件具有学习效应的两个单机排序问题.工件的学习效应指的是工件的加工时间为所排位置的函数.对以下两个目标函数:加权总完工时间与最大延误,证明在某些特殊情况下加权最小加工时间优先(WSPT)规则和最早工期优先(EDD)规则可以分别给出最优算法.也给出了这两个规则在一般条件下的最坏情况界.Two single machine scheduling problems with a learning effect are considered. The learning effect of a job is assumed to be a function of its position. For the follow completion times and the shortest processing time ing two objective functions： the weighted sum of maximum lateness, it is shown that the weighted first （WSPT） rule and the earliest due date first （EDD） rule can construct the optimal sequence for some special cases, respectively. The worst case error bounds for these two rules in general cases are also given.

关 键 词：排序 单机 学习效应 加权总完工时间 最大延误 

分 类 号：O223[理学—运筹学与控制论]