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.
针对具有连续资源的单机成组调度问题，建立一类安装时间受资源约束的单机成组调度模型。
Minimize the total weighted completion time single machine scheduling problems.
最小化加权总完工时间的单机排序问题。
We discuss the nonpreemptive parallel machine scheduling problem with nonsimultaneous available time, the objective function is to minimize the makespan.
讨论任务的加工是不可中断，机器速度相同且机器具有不同开始加工时间的排序问题，目标函数是极小化最大完工时间。
A preemptive uniform machine scheduling problem with arrival time and minimum makespan is studied in this paper.
研究了可中断的带有到达时间的使总完工时间最小的恒速机排序问题。
This paper discusses the stochastic scheduling on a single machine to minimize total weighted completion time subject to precedence constraints of chains.
研究具有链式约束的单机随机排序问题，目标函数为加权总完工时间的数学期望。
This paper considers the single machine scheduling problem with chain-structured and linear processing time.
本文主要研究了带有链优先约束的单机分批排序与平行机排序问题。
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.
采用网络理论构造了平行流水作业的非连接图模型，提出了采用蚁群算法求解平行流水作业计划问题，以及求解过程中可行路径表的建立方法。
应用推荐