1) incompatble job families
不相容工件族分批排序
1.
This paper considers the unbounded parallel batch scheduling problem with incompatble job families to minimiee the weighted total completion time.
考虑极小化加权总完工时间的一类无界的不相容工件族分批排序问题,给出了最优排序的性质和算法,并加以证明。
2) parallel batch scheduling with family-jobs
平行批分族排序
3) batch scheduling
分批排序
1.
Complexity analysis of class of problems on batch scheduling and its approximated algorithm;
一类分批排序问题的复杂性分析及近似算法
2.
Formulating the batch scheduling with release time as a mathematical programming model;
带到达时间分批排序问题的数学模型
3.
Using genetic algorithm for single machine solving multiple batch scheduling problem;
求解多目标单机分批排序问题
4) batching scheduling
分批排序
1.
The paper focuses on the problem of batching scheduling with job sizes and precedence constraints.
研究了工件有优先约束和尺寸大小关系的分批排序问题,这里目标函数为工件的极大完工时间,这类问题是NP—完备的。
2.
The copy method for the batching scheduling problems is first degigned, and then applied to prove the NP_Completeness of minsum and minmax problems in the batching scheduling.
首次提出分批排序问题中的复制法,并用其证明了分批排序中的极小化求和问题以及极小化极大问题的NP＿完备性。
3.
In this paper,two batching scheduling problems of minimizing the weighted sum of job completion times on one and two batch machines are disscussed.
讨论了单台与两台批处理机上的、目标函数均为加权总完工时间的分批排序问题。
5) batch processing
分批排序
1.
In this paper, the problem of minimizing the total completion time on a single batch processing machine in the case of two arrival times is discussed .
讨论了分批排序中工件有两个到达时间 ,以工件完工时间总和为目标函数的批处理问题 ,证明了其NP_完备性 ,并以Brucker等[1] 给出的动态规划算法为基础 ,给出了一性能指标为 2的多项式时间近似算
2.
Batch processing scheduling is an important scheduling problem.
而其中的分批排序问题,因其明显的实际意义,更是吸引了国内外许多学者。
6) family jobs
分族排序
补充资料：分族
1.小宗之族。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条