摘要
分批排序和可控排序是两类重要的现代排序模型,该文中把这两类排序模型相结合,讨论加工时间离散可控的单机分批排序问题:对于所有工件具有相同的可控加工时间和控制费用这一情形,分别考虑机器容量有限及无限两种情况下,分别使最大完工时间和总完工时间加上加工时间可控所需费用的总和为最小作为优化的目标,讨论了这四个问题的最优解的性质,并在此基础上提出了相应的多项式时间最优算法.
Batch Scheduling and Controllable Scheduling are two important Scheduling models. This paper combines these two models, studys scheduling a batching machine with discretely controllable processing times. When all jobs are of the same controllable processing times and costs, problems to minimize the makespan or the total completion time plus costs of controlling the processing times are discussed when batch capacity is bounded or unbound- ed, respectively. Properties of optimal scheduling are analyzed and four polynomial time optimal algorithms are presented.
出处
《曲阜师范大学学报（自然科学版）》
CAS
2008年第3期37-41,共5页
Journal of Qufu Normal University(Natural Science)
基金
国家自然科学基金(10671108)
山东省自然科学基金(Y2005A04)
关键词
分批排序
离散可控
最大完工时间
总完工时间
batch scheduling
discretely controllable
makespan
total completion time
