摘要
研究了考虑单机成组加工排序问题,目标函数为超前有奖延迟受罚的问题。对于该问题的3种特殊情形,均给出了最优算法并分析了其时间复杂度。
This paper considers a group processing and scheduling problem on a single machine.The objective is to minimize the sum of earliness award and tardiness penalty of all jobs.Optimal algorithms are provided and their complexity is also analyzed.
出处
《河北科技师范学院学报》
CAS
2009年第4期69-71,共3页
Journal of Hebei Normal University of Science & Technology
基金
曲阜师范大学科研基金资助项目(项目编号:XJZ200849)
关键词
排序论
成组加工
最优算法
时间复杂度
scheduling
group processing
optimum algorithm
time complexity
