• The DAG scheduling problem has shown to be NP complete in general.

    一般情况下,这种DAG调度是个NP完全问题。

    youdao

  • We show that the scheduling problem is NP-hard in the strong sense.

    本文证明了上述排序模型是强NP困难的。

    youdao

  • The first problem is the fuzzy flexible job shop scheduling problem.

    第一类问题为模糊柔性作业车间调度问题。

    youdao

  • The performance measure of the scheduling problem is schedule length.

    排序问题的性能测度是排序长度。

    youdao

  • Production scheduling problem has been shown to be a NP complete problem.

    经证明,生产调度问题是NP完全问题。

    youdao

  • The dramatic characteristic of the job shop scheduling problem is its complexity.

    车间调度问题的突出特点是其复杂性。

    youdao

  • It is very difficult for solving the planning and scheduling problem because of its complexity.

    由于计划调度问题本身的复杂性,很难寻求到最优解。

    youdao

  • The second problem is the fuzzy flexible job shop scheduling problem with preventive maintenance.

    第二类问题为具有预防性维修的模糊柔性作业车间调度问题。

    youdao

  • Resource-constrained project scheduling problem is a typical issue in project scheduling management.

    资源约束项目调度问题是项目进度管理中的典型问题。

    youdao

  • Resource-constrained project scheduling problem is a typical issue in project scheduling management.

    资源约束项目调度问题是项目进度管理中的典型问题。

    youdao

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

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

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