1.
Minimizing makespan on a batching machine with batch arrivals
极小化最大完工时间的批到达同时加工排序问题
2.
The Parallel Batch Scheduling Problem with Family Jobs and Equal Processing Time to Minimize the Weighted Total Completion Time
加工时间相同的分族分批排序加权总完工时间问题
3.
Scheduling Models with Jobs' Processing Times Being Nonconstant;
工件加工时间非恒定的排序模型研究
4.
A Special Model of on-line Scheduling on Three Related Machines with Total Processing Time Known in Advance;
预先知道总加工时间的一类特殊的三台平行同类机在线排序
5.
Some Scheduling Problems with Environment Dependent Processing Times
几类加工时间与环境有关的排序问题
6.
Single Machine Scheduling Problem with Minimizing Weighted Completion Times with Resource Constrained;
资源有限的加权总完工时间单机排序问题
7.
A Semi-Online Algorithm for Solving the Single Machine Scheduling Problem to Minimize Total Weighted Completion Time with Discounted Factor
折扣加权总完工时间问题的半在线排序算法
8.
Single Machine Scheduling Under job Processing time is a Linear Deterioration of its Start time
工件加工时间是开工时间线性函数的单机排序问题
9.
Single Machine Scheduling with Precedence Constraints and Processing Time Dependent on Starting Time;
具有优先约束和加工时间依赖开工时间的单机排序问题
10.
sequential processing
顺序加工，时序处理
11.
A Batching Scheduling Algorithm for Maximizing Total Weigted Number of Jobs Completed in Due Date Window;
交货时间区间内加权完工工件个数最大的分批排序算法
12.
Single Machine Primary-Secondary Criteria Scheduling Problem 1‖∑U_j︱T_(max)with the Jobs Processing Times Being Agreeable with Their Due Dates;
加工时间和工期一致的单机主次指标排序问题1‖∑U︱T_(max)
13.
Semi-online Scheduling with Machine Cost;
预先知道工件最大加工时间的带机器费用的排序
14.
An Unbounded Batch Scheduling Problem with Incompatbile Job Families to Minimize the Weighted Total Completion Time
一类无界的不相容工件族分批排序加权总完工时间问题
15.
Research on m*n Different Ordinal Scheduling Algorithm;
m*n不同顺序工件排序算法的研究
16.
The problem of minimizing the total weighted completed time on single batch processing machine is studied.
讨论了单机分批排序问题中目标是极小化加权总完工时间的问题。
17.
Dynamic Programming Algorithm on Two Machines Cross Docking Scheduling with Total Weighted Completion Time;
以总加权完工时间为目标的两台机越库排序的动态规划算法
18.
A Proof to the Algorithm for the Time-Based Learning Effect Scheduling Problem
加工时间基于学习因素的一类排序问题最优算法的证明