摘要
对于单机的排序与工期分配问题,于刚曾经给出了一些结果.本文则考虑成组加工时总误工问题的排序与工期分配.对于不同模式,或给出其最优序,或转化为目前研究得比较成熟的问题.
Yu Gang has studied single machine scheduling with assignable due dates and obtained goodresults.This paper discusses single machine scheduling with assignable due dates to minimize totaltardiness in batch processing.For all these models,we give the optimal schedules,or change them intoproblems which have been well studied.
出处
《黄冈师范学院学报》
2004年第6期21-25,36,共6页
Journal of Huanggang Normal University
关键词
分配问题
工时
工期
模式
排序
成熟
最优序
成组加工
单机
batch processing
total tardiness
scheduling
assignment of due dates
assignment of arrival times