摘要
本文在同组工件连续加工的条件下考虑了单机加工中的二个排序问题,其目标函数分别为极小加工全程和延误工件数。文中在不同的条件下对它们给出了多项式时间算法。
This paper considers two single-machine scheduling problems where the objectives are to minimize the makespan and the number of tardy jobs under the group technology assumption, respectively. Some polynomial algorithms are developed for them under different conditions.
出处
《应用数学与计算数学学报》
1996年第1期48-52,共5页
Communication on Applied Mathematics and Computation
基金
国家自然科学基金资助课题
关键词
排序
成组加工
加工全程
延误工件数
schednling, process in group, makespan, number of tardy job.
