带窗时分流的单机准时生产制问题  

Due-Window Assignment and Common Flow Allowance on Single Machine Scheduling Problems with Just-in-Time

作　　者：倪镇钰 李步奖 刘静[1] Ni Zhenyu Li Bujiang Liu Jing(College of Mathematics, Physics and Information Engineering, Jiaxing University, Jiaxing, Zhejiang 314001)

机构地区：[1]嘉兴学院数理与信息工程学院,浙江嘉兴314001

出　　处：《嘉兴学院学报》2016年第6期83-88,共6页Journal of Jiaxing University

基　　金：浙江省大学生科研创新团队资助项目(2015R417027)

摘　　要：带窗口的单机准时制排序问题,即工件的交货期是一个窗口区间(窗时),工件在窗时完成加工就认为是准时的.每个工件的交货窗时不同,且加工时间带有不同的恶化因子.目标为所有工件寻找各自不同的最优交货窗时和一个最优序以极小化这些工件的总提前时间、总延误时间及窗时位置和大小的和.对此问题文中给出了一O(nlogn)时间的最优算法.Each job has its own due-window, and that the processing of each job is finished in its due- window is considered to be punctual. All jobs have different due-windows and the processing time possesses different deterioration factors. The paper provides the 0 （nlogn） time algorithm to find different and optimal dew-windows for different jobs, and minimizes the sum of time advanced and the time delayed.

关 键 词：单机排序 窗时 恶化因子 准时 多项式时间算法 

分 类 号：O221.7[理学—运筹学与控制论]