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

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

    youdao

  • Minimize the total weighted completion time single machine scheduling problems.

    最小化加权总完工时间的单机排序问题。

    youdao

  • The improved tabu algorithm of single machine scheduling with job class setups is proposed.

    基于改进禁忌搜索算法,建立了此类单机成组作业调度模型,可搜索到该问题的最优解。

    youdao

  • This paper considers the single machine scheduling problem with chain-structured and linear processing time.

    本文主要研究了带有链优先约束的单机分批排序与平行机排序问题。

    youdao

  • We consider a single machine scheduling problem involving both the processing and scheduling of job delivery.

    本文考虑了一个包含工件生产和工件送货的单机调度问题。

    youdao

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

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

    youdao

  • Secondly we formulate the optimization problem of sorting plan using the single machine scheduling problem and sequently illustrate a simple algorithm. Finally, the method is acco...

    其次,利用机器排序问题处理解体计划问题,并给出一简单算法,由此得到优化的解体计划时间表。

    youdao

  • Secondly we formulate the optimization problem of sorting plan using the single machine scheduling problem and sequently illustrate a simple algorithm. Finally, the method is accomplished on the mi...

    其次,利用机器排序问题处理解体计划问题,并给出一简单算法,由此得到优化的解体计划时间表。

    youdao

  • This paper is concerned with single machine stochastic scheduling problems with random ready times, processing times and due dates to minimize the number of tardy jobs.

    讨论了工件准备时间、加工时间和交货期都为随机变量的单机调度问题。

    youdao

  • Q-learning was applied to resolution of the adaptive dispatching rule selection problem under dynamic single-machine scheduling environment.

    提出了一种利用Q-学习解决动态单机调度环境下的自适应调度规则选择的方法。

    youdao

  • Aiming at the problem of the single machine group scheduling with continuous resources, the model of single machine group scheduling with resources dependent setup time is set up.

    针对具有连续资源的单机成组调度问题,建立一类安装时间受资源约束的单机成组调度模型。

    youdao

  • In this paper, a scheduling problem with a class of objective functions on a single machine which is subjected to stochastic breakdowns is discussed.

    本文讨论了机器随机故障的情形下一类目标函数的调度问题。

    youdao

  • Concerned with the scheduling problems about due Windows on a single machine.

    研究了有关交货期窗口的单机调度问题。

    youdao

  • Through the analysis of the problem, it is proved that the problem is equivalent to a single-machine scheduling for minimizing an analogous function of delay.

    基于对问题的分析,证明了这一问题等价于单机调度中极小化类似的延迟量函数。

    youdao

  • A problem of scheduling jobs on a single machine subject to fuzzy due dates and mixed precedence constraints is discussed.

    讨论了一类模糊交货期和混合优先约束下的单机调度问题。模糊交货期表示对任务完成时间的满意程度;

    youdao

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

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

    youdao

  • This paper discusses the stochastic scheduling on a single machine to minimize total weighted completion time subject to precedence constraints of chains.

    研究具有链式约束的单机随机排序问题,目标函数为加权总完工时间的数学期望。

    youdao

  • In this thesis, we study the single machine step-deterioration scheduling problem and the single machine deteriorating scheduling problem with resource constrain.

    本文讨论了分段恶化排序问题和带资源约束的恶化排序问题。

    youdao

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

    连续资源的单机成组调度进行了讨论。

    youdao

  • This paper is concerned with single machine stochastic scheduling problems with random ready times, processing times and due dates to minimize the number of tardy jobs.

    针对机器速度和准备时间不同,探讨了带机器准备时间的两台同类机半在线排序问题,以达到优化工作效率的目的。

    youdao

  • This paper is concerned with single machine stochastic scheduling problems with random ready times, processing times and due dates to minimize the number of tardy jobs.

    针对机器速度和准备时间不同,探讨了带机器准备时间的两台同类机半在线排序问题,以达到优化工作效率的目的。

    youdao

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

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

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