您要查找的是不是：
- The computational results show that the PSO is a viable and effective approach to solve the semiconductor furnace batch scheduling problem. 实例计算的结果表明，该算法是解决半导体炉管区调度问题可行且高效的方法。
- 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-完备性。
- A Kind of Single Machine Parallel Batch Scheduling Problems with Three Hierarchical Criteria 一类具有三重指标的分批排序问题
- Single Machine Parallel Batch Scheduling Problems with Two Hierarchical Criteria to Minimize Maximum Lateness First 主指标为最大延迟的主次指标分批排序问题
- batch scheduling problems 分批排序问题
- The batching scheduling problem for sequential batch process and some useful properties 大规模定制中顺序间歇过程批调度研究
- Well, I have a scheduling problem. 嗯，我在安排工作方面遇到困难。
- Fixed a scheduling problem with the Danish Under 18 leagues. 修正了丹麦18岁以下联赛的赛程问题。
- The DAG scheduling problem has shown to be NP complete in general. 一般情况下，这种DAG调度是个NP完全问题。
- This IGA can also been extended to multi-objective scheduling problems. 这一算法还可以扩展到多目标调度问题。
- The single machine scheduling problem with continuous resources was discussed. 摘要讨论具有连续资源的单机排序问题。
- To help you identify schedule problems. ,以帮助您确定日程中的问题。
- What makes a service desirable is that a service can be invoked many times without going through batch scheduling, program initiation, and later termination housekeeping over and over again. 需要服务的原因在于服务可以多次调用,而不需要反复进行批处理调度,程序初始化,以及稍后的终止回收工作。
- The critical path method was originally developed to solve scheduling problems in an industrial setting. 关键路线方法最初的发展是为了解决一项工业安装的安排问题。
- This paper presents suffcient conditions of the existence of optimal batch sequences when all jobs form one batch for some batching scheduling models. 摘要研究了目标函数为完工时间平方和及最大延迟的分批排序问题存在仅分一批的最优解的充分条件。
- But this approach poses scheduling problems and negates any benefit of shadow copy backups. 但是使用这种方法必须进行计划,并且不具备卷影复制备份的任何优点。
- If you miss the deadline, payment of grant will be deferred to the next batch scheduled 4 weeks later. 假如你未能在截止日期前交回文件,有关资助的发放将延迟4个星期。
- Job-shop Scheduling Problem is a typical NP problems, which is one of the hardest combinatorial optimization problem. 作业车间调度问题是一个典型的NP难问题，是最困难的组合优化问题之一。
- We consider that online scheduling problems with master jobs to minimize the make-span, using restarts. 摘要研究了一个带有霸王工件且允许重启的单机在线分批排序，其目标函数值为求时间表长。
- The single machine group scheduling problems with continuous resources is discussed. 讨论了具有连续资源的单机成组排序问题。
