The single machine scheduling problem with continuous resources is discussed.
讨论具有连续资源的单机排序问题。
This paper considers the parallel machine scheduling problem with delivery times.
本文考虑了带传递时间的平行机排序问题。
This paper considers the single machine scheduling problem with chain-structured and linear processing time.
本文主要研究了带有链优先约束的单机分批排序与平行机排序问题。
We consider a single machine scheduling problem involving both the processing and scheduling of job delivery.
本文考虑了一个包含工件生产和工件送货的单机调度问题。
A preemptive uniform machine scheduling problem with arrival time and minimum makespan is studied in this paper.
研究了可中断的带有到达时间的使总完工时间最小的恒速机排序问题。
Also, the deterministic counterpart of this single machine scheduling problem is a special case of fuzzy version.
指出确定性环境下的最小化误工任务数单机调度问题是模糊情况的特例。
We discuss the nonpreemptive parallel machine scheduling problem with nonsimultaneous available time, the objective function is to minimize the makespan.
讨论任务的加工是不可中断，机器速度相同且机器具有不同开始加工时间的排序问题，目标函数是极小化最大完工时间。
Meanwhile, the concept of virtual machine is placed here, and the efficiently execution and simplify on machine scheduling problem is fulfilled in the case of outsourcing.
同时引入虚拟机器的概念，实现了对外包情形下机器调度问题的有效处理和简化。
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...
其次，利用机器排序问题处理解体计划问题，并给出一简单算法，由此得到优化的解体计划时间表。
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...
其次，利用机器排序问题处理解体计划问题，并给出一简单算法，由此得到优化的解体计划时间表。
Aiming at the total weighted tardiness scheduling problem of unrelated parallel machine, a kind of hybrid ant colony optimization algorithm was proposed.
针对一类变速机总加权拖期调度问题，提出一种混合蚁群优化算法。
In this paper, a scheduling problem with a class of objective functions on a single machine which is subjected to stochastic breakdowns is discussed.
本文讨论了机器随机故障的情形下一类目标函数的调度问题。
Q-learning was applied to resolution of the adaptive dispatching rule selection problem under dynamic single-machine scheduling environment.
提出了一种利用Q-学习解决动态单机调度环境下的自适应调度规则选择的方法。
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.
针对具有连续资源的单机成组调度问题，建立一类安装时间受资源约束的单机成组调度模型。
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.
基于对问题的分析，证明了这一问题等价于单机调度中极小化类似的延迟量函数。
The problem of uniform parallel machine scheduling was considered so as to minimizing total completion times.
研究了目标函数是最小最大完成时间的同类机调度问题，其中作业到达时间可能不同。
A problem of scheduling jobs on a single machine subject to fuzzy due dates and mixed precedence constraints is discussed.
讨论了一类模糊交货期和混合优先约束下的单机调度问题。模糊交货期表示对任务完成时间的满意程度；
A single machine-scheduling problem with fuzzy delays and mixed precedence relations is discussed.
分析了一类带有模糊时间延迟和混合优先关系的单机调度问题。
In this thesis, we study the single machine step-deterioration scheduling problem and the single machine deteriorating scheduling problem with resource constrain.
本文讨论了分段恶化排序问题和带资源约束的恶化排序问题。
The algorithm based on model decomposition was proposed for the problem of multi-machine task scheduling with time Windows.
针对多机带时间窗口任务规划问题，提出了基于模型分解的规划求解算法。
This concept is the integration of identical parallel machine scheduling with flow shop scheduling. The solution to IFSP is a non- polynomial computation of time problem.
采用网络理论构造了平行流水作业的非连接图模型，提出了采用蚁群算法求解平行流水作业计划问题，以及求解过程中可行路径表的建立方法。
This concept is the integration of identical parallel machine scheduling with flow shop scheduling. The solution to IFSP is a non- polynomial computation of time problem.
采用网络理论构造了平行流水作业的非连接图模型，提出了采用蚁群算法求解平行流水作业计划问题，以及求解过程中可行路径表的建立方法。
应用推荐