最小化提前/延误赋权工件数及时窗惩罚的排序问题(英文)  

Determination of the CDW to Minimize the Weighted Number of Early and Tardy Jobs

作　　者：赵洪銮[1] 王琦[1] 李曙光[1] 

机构地区：[1]山东大学数学与系统科学学院,山东济南250100

出　　处：《应用数学》2006年第2期336-341,共6页Mathematica Applicata

基　　金：SupportedbytheNationalNaturalSciencesFoundationofChina(10271065,60373025)

摘　　要：研究赋权提前/延误工件数的公共时窗单机排序问题,时窗的位置和大小待定且由惩罚费用衡量.首先给出最优排序的一些性质,进而提出一个多项式时间算法以最小化这些费用的和.Concerning the weighted number of early and tardy jobs, a single machine scheduling problem with a common due window is investigated. The window location and size are decision variables with penalties. Following several properties of an optimal schedule, a polynomial algorithm is proposed to minimize the sum of all the penalties.

关 键 词：:排序 时窗 提前 延误 

分 类 号：O224[理学—运筹学与控制论] TP301[理学—数学]