公共交货期窗口待定的单机成组分批排序  

Single processor scheduling with batching and with penalty of common due window location

作　　者：赵洪銮[1] 王骁力[2] 亓兴勤[1] 

机构地区：[1]山东大学数学与系统科学学院,山东济南250100 [2]南阳师范学院数学系,河南南阳473061

出　　处：《山东大学学报（理学版）》2006年第1期74-77,81,共5页Journal of Shandong University(Natural Science)

基　　金：国家自然科学基金资助项目(10271065)

摘　　要：研究有组安装任务的单机窗时排序问题,所有工件的提前/延误惩罚费用相同;公共交货期窗口大小给定但位置待定,由线性定位费用衡量;最优排序是使所有这些费用的和最小.给出了最优排序的一些性质,提出一个多项式时间算法.Single processor scheduling with a common due window and family setups is studied. All jobs have common earliness cost and common tardiness penalty, but the window location with linear cost is a decision variable. The objective is to minimize the sum of all the costs. Following some properties of the optimal scheduling, a polynomial algorithm is proposed.

关 键 词：分批排序 交货期窗口 组安装任务 窗时排序 最优排序算法 

分 类 号：TP301[自动化与计算机技术—计算机系统结构] O157[自动化与计算机技术—计算机科学与技术]