具有学习效应的超前有奖延误受罚的排序问题(英文)  

Tardiness Penalty and Earliness Award with Learning Effect Processing Time

作　　者：余英[1] 孙世杰[2] 王凯[1] 何龙敏[2] 

机构地区：[1]凯里学院理学院,贵州凯里556000 [2]上海大学理学院,上海200444

出　　处：《运筹学学报》2010年第4期41-52,共12页Operations Research Transactions

基　　金：凯里学院科研基金项目(编号:Z1014);凯里学院重点学科建设项目(编号:KZD2009001)资助

摘　　要：本文考虑具有学习效应和共同交货期的单机排序问题.目标函数是加权超前有奖延误受罚总和.我们的目标是寻找一个最优序使得目标函数的值最小.由于该问题是NP-hard的,我们给出一些特殊情况下多项式时间可解的特例.同时在快速估计下界的基础上给出了分支定界算法来求一般情况下的最有排序.In this paper,we consider a single-machine scheduling model with a given due date and learning effect processing time.The objective function is the total weighted tardiness penalty and earliness award.Our aim is to find an optimal sequence so as to minimize the objective function.As the problem is NP-hard,we give some polynomial time solvable cases of this problem.A branch and bound algorithm was given for general case of the problem based on a rapid method for estimating the lower bound.

关 键 词：运筹学 排序 单机 延误 超前 学习效应 

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