摘要
讨论了单机分批排序问题中目标是极小化加权总完工时间的问题.对于所有工件的加工时间都相等的情况,分别对常数个到达时间和任意个到达时间的情况给出了两个最优算法,并给出了其算法复杂性.
The problem of minimizing the total weighted completed time on single batch processing machine is studied. For the case of all jobs with constant processing time, corresponding to the case when there are only a constant number of job release times and the general released case, we provide two optimal algorithms and analysis their algorithm complexity.
出处
《洛阳大学学报》
2006年第4期43-45,共3页
Journal of Luoyang University
基金
国家自然科学基金资助项目(项目编号:10671108)
山东省自然科学基金资助项目(项目编号:Y2005A04)
关键词
分批排序
到达时间
极小化加权总完工时间
最优算法
batch Scheduling
release times
the iotal weighted completed time
optimal algorithm
