检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张新功[1]
出 处:《计算机工程与应用》2014年第15期235-239,共5页Computer Engineering and Applications
基 金:重庆市教委技术研究项目(No.KJ120624);重庆师范大学重点项目(No.11XLB027;No.2011XLZ05)
摘 要:针对工件具有位置退化效应,机器具有多个维修区间的单机调度问题。工件的加工时间为位置相关的函数。每次机器维修后回到初始的水平。目标函数为总的提前费用,误工费用,共同交货期的窗时费用和开始时间费用。对于共同交货期分为包括维修区间和不包括维修区间两种情形进行讨论,采用线性规划建立指派问题的数学模型,并分别提出最优序列的一些最优性质和相应的多项式时间算法。This paper deals with single-machine scheduling with rate-modify activities and position-dependent deteriorated job. The machine can be performed multiple rate-modify activities to change the processing times of the jobs scheduled after the activity. The objective is to find a common due window for all the jobs and a location of the rate-modifying activ-ities for each job to minimize the sum of earliness, tardiness and the cost and the starting time of common due window. The common due window is divided into two cases:in maintenance interval or out maintenance interval. Some properties of the optimal schedule are provided for the problem and present polynomial algorithms, respectively.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249