1) late jobs
误工工件数
1.
This paper studies the single machine scheduling problem for minimizing the number of late jobs (1‖∑Ui) in the following aspects:(1) the condition of unique optimal solution;(2) the structure of the set of all optimal solutions;(3) an algorithm for generating all optimal solutions.
本文研究经典排序问题——最小化误工工件数的单机排序问题。
2) delays
误工
1.
In this paper,we consider the delays problems in single resource scheduling with compressible processing time.
本文采用作业时间可压缩的方法来解决单资源调度中的误工问题。
3) tardy job
延误工件
1.
In order to minimize the total weighted number of early and tardy jobs of a scheduling problem with common due window,a branch algorithm with almost fewer than a half of the branches in an existent algorithm is developed.
以优势准则构建一个分枝状精确算法,最小化一个存在共同宽容交货期单机调度(排序)问题的加权超前延误工件总数,分枝个数可减少50%。
4) total tardiness
总误工
1.
Disruption management for single machine scheduling with assignable due dates to total tardiness;
单机排序中带可分配工期的总误工问题的应急管理
2.
Single machine scheduling with assignable due dates to total tardiness in batch processing;
成组加工中带可分配工期的总误工问题
3.
This paper discusses disruption recovery for single machine scheduling with assignable due dates to total tardiness.
本文考虑了单机排序中带可分配工期的总误工问题的应急管理问题。
5) total tardiness problem
总误工时间
6) number of tardy tasks
误工任务数
1.
In this paper,we discuss single machine scheduling with assignable due dates to minimize number of tardy tasks in batch processing.
本文研究了成组加工时带可分配工期的误工任务数问题的排序与工期分配。
参考词条
补充资料：误工
1.指未能参加生产劳动而耽误的劳动日。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。