This paper studies semi online parallel machine scheduling problems.
本文主要考虑平行机半在线排序问题。
The single machine scheduling problem with continuous resources is discussed.
讨论具有连续资源的单机排序问题。
Minimize the total weighted completion time single machine scheduling problems.
最小化加权总完工时间的单机排序问题。
This paper considers the parallel machine scheduling problem with delivery times.
本文考虑了带传递时间的平行机排序问题。
This method is based on repeatedly solving certain one-machine scheduling problems.
它是基于反复的解决某些单机调度问题。
The improved tabu algorithm of single machine scheduling with job class setups is proposed.
基于改进禁忌搜索算法，建立了此类单机成组作业调度模型，可搜索到该问题的最优解。
This paper considers the single machine scheduling problem with chain-structured and linear processing time.
本文主要研究了带有链优先约束的单机分批排序与平行机排序问题。
The problem of uniform parallel machine scheduling was considered so as to minimizing total completion times.
研究了目标函数是最小最大完成时间的同类机调度问题，其中作业到达时间可能不同。
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.
研究了可中断的带有到达时间的使总完工时间最小的恒速机排序问题。
In literatures of classical parallel machine scheduling, people often study the precedence constraint among jobs.
在经典的平行机排序文献中，人们往往研究工件间的序约束。
Also, the deterministic counterpart of this single machine scheduling problem is a special case of fuzzy version.
指出确定性环境下的最小化误工任务数单机调度问题是模糊情况的特例。
Q-learning was applied to resolution of the adaptive dispatching rule selection problem under dynamic single-machine scheduling environment.
提出了一种利用Q-学习解决动态单机调度环境下的自适应调度规则选择的方法。
We discuss the nonpreemptive parallel machine scheduling problem with nonsimultaneous available time, the objective function is to minimize the makespan.
讨论任务的加工是不可中断，机器速度相同且机器具有不同开始加工时间的排序问题，目标函数是极小化最大完工时间。
Computation shows that the algorithm is efficient and can be used to solve the complicated combinatorial optimization problems such as machine scheduling.
计算表明，该算法具有较高的效率，能有效地求解机器排序等复杂的组合优化问题。
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.
基于对问题的分析，证明了这一问题等价于单机调度中极小化类似的延迟量函数。
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.
采用网络理论构造了平行流水作业的非连接图模型，提出了采用蚁群算法求解平行流水作业计划问题，以及求解过程中可行路径表的建立方法。
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...
其次，利用机器排序问题处理解体计划问题，并给出一简单算法，由此得到优化的解体计划时间表。
Scheduling machine: a job submission results in the submission being placed in a queue managed by a scheduling machine.
调度机器(scheduling machine)：作业提交的结果是，提交来的作业放置在调度机器所管理的一个队列中。
Each machine in a LoadLeveler cluster performs one or more roles in scheduling jobs. These roles and the implications of their failure are as follows.
在作业的调度中，LoadLeveler集群的每一台机器都要扮演一个或者多个角色。
The machine ha2 will act as a standby scheduling machine.
机器ha2将作为备份调度机器。
Configure heartbeat to manage the scheduling machine.
配置heartbeat来管理调度机器。
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.
讨论了工件准备时间、加工时间和交货期都为随机变量的单机调度问题。
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.
讨论了工件准备时间、加工时间和交货期都为随机变量的单机调度问题。
应用推荐