• Timetabling is also called the scheduling problem.

    排课表问题又称时间表问题。

    youdao

  • A scheduling problem with rejection has been researched.

    研究了工件可拒绝排序问题。

    youdao

  • The boiler steam system cyclic scheduling problem was investigated.

    对锅炉蒸汽系统循环调度问题进行了研究。

    youdao

  • It provides a suitable mathematical model for solving the scheduling problem.

    它为解决调度问题提供了一个较好的数学模型。

    youdao

  • Don't ask me what to do about the scheduling problem. He is running the show.

    别问我时间表出问题怎么办,他才是结果拍板的人。

    youdao

  • The single machine scheduling problem with continuous resources is discussed.

    讨论具有连续资源的单机排序问题。

    youdao

  • This paper considers the parallel machine scheduling problem with delivery times.

    本文考虑了带传递时间的平行机排序问题。

    youdao

  • It is proved that ACA is efficient and robust in solving transit scheduling problem.

    证明了改进蚁群算法解决公交调度问题的高效性和较强的适用性。

    youdao

  • Two kinds of model are formulated based on the studies of job shop fuzzy scheduling problem.

    在研究作业车间模糊调度问题的基础上,建立了两种作业车间模糊调度模型。

    youdao

  • Example: One of your duties was doing staff scheduling, and you solved a big scheduling problem.

    例如:你的一项职责就是安排员工的工作,而你解决了一项很大的安排问题。

    youdao

  • The resulting log can be used for further analysis to determine whether there is a scheduling problem.

    结果日志文件可以用于进一步分析以决定是否存在日程安排上的问题存在。

    youdao

  • Flow-shop scheduling problem is known to be notoriously intractable, both in theory and practice.

    流水作业调度问题在理论和实践方面均是一个著名的难题。

    youdao

  • The scheduling Problem that maximize the number of jobs completed in due date window is NP - hard.

    使尽量多的工件在其对应交货时间区间内完工的排序问题是NP困难的。

    youdao

  • A single machine-scheduling problem with fuzzy delays and mixed precedence relations is discussed.

    分析了一类带有模糊时间延迟和混合优先关系的单机调度问题。

    youdao

  • A discrete Particle Swarm Optimization (PSO) algorithm was presented for Job Shop scheduling problem.

    提出了用于解决作业车间调度问题的离散版粒子群算法。

    youdao

  • The job shop scheduling problem is a classical problem with both highly theoretical and practical value.

    工件车间调度问题具有很高的理论价值和实际价值。

    youdao

  • The vehicle-scheduling problem with time window is also a NP-hard problem being more complicated than VSP.

    带有时间窗的车辆优化调度问题是比VSP复杂程度更高的NP难题。

    youdao

  • This paper studies the so called two-stage cross docking logistics scheduling problem and its algorithms.

    本文主要研究两阶段越库物流作业调度问题及其算法设计。

    youdao

  • The test results demonstrate the effectiveness of the RHSA to solve the dynamic vehicle scheduling problem.

    测试结果验证了算法在求解动态车辆调度问题中的有效性。

    youdao

  • A preemptive uniform machine scheduling problem with arrival time and minimum makespan is studied in this paper.

    研究了可中断的带有到达时间的使总完工时间最小的恒速机排序问题。

    youdao

  • Also, the deterministic counterpart of this single machine scheduling problem is a special case of fuzzy version.

    指出确定性环境下的最小化误工任务数单机调度问题是模糊情况的特例。

    youdao

  • Therefore, the choice of sea area is the coupling of the facility location problem and job-shop scheduling problem.

    因此试验海区的选择是工厂选址运输问题和车间调度问题的耦合。

    youdao

  • Vehicle scheduling problem with full-loads has long been a hot research issue in logistics & transportation industry.

    满载车辆调度问题是物流运输领域中一个非常值得研究的问题。

    youdao

  • The port tugboat operation scheduling is a kind of parallel machines scheduling problem with special process constraint.

    港口的拖轮调度过程是一类带特殊工艺约束的并行多机调度问题。

    youdao

  • This paper will study under layered real-time scheduling problem, which is based on the theory of MAS (Multi-agent System).

    本文基于多智能体系统理论,研究了多智能体机器人系统的底层实时调度问题。

    youdao

  • This paper studies the resources scheduling problem in virtual real image-based walkthrough system and presents relative algorithm.

    针对虚拟实景空间漫游系统中资源调度问题进行了研究,提出了相关算法。

    youdao

  • The scheduling problem can be transformed into assignment problem, and the optimization solution can be obtained by Hungarian algorithm.

    首先建立了该类问题的数学模型,然后将其转化为指派问题,通过匈牙利算法可以得到最优解。

    youdao

  • The scheduling problem can be transformed into assignment problem, and the optimization solution can be obtained by Hungarian algorithm.

    首先建立了该类问题的数学模型,然后将其转化为指派问题,通过匈牙利算法可以得到最优解。

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定