Flow shop scheduling problems.
流水作业排序问题。
Batch scheduling is an important branch of scheduling problems.
批调度是调度问题的一个重要分支。
This paper studies semi online parallel machine scheduling problems.
本文主要考虑平行机半在线排序问题。
A survey on scheduling problems with controllable parameters is given.
给出参数可控的排序问题的一个综述。
Concerned with the scheduling problems about due Windows on a single machine.
研究了有关交货期窗口的单机调度问题。
Then, found its application in flow shop scheduling problems with two objects.
并应用该算法解决了双目标的流水车间调度问题。
Minimize the total weighted completion time single machine scheduling problems.
最小化加权总完工时间的单机排序问题。
This method is based on repeatedly solving certain one-machine scheduling problems.
它是基于反复的解决某些单机调度问题。
While applied to Job Shop scheduling Problems, it has some limitations to be solved.
但在解决单件车间作业计划问题时，仍存在一些局限。
It is one of the considerably complicated scheduling problems due to its NP-completeness.
由于其本身具有NP -完全的性质，求解具有很大的难度。
The purpose of this paper is using the algorithm to solve the dynamic Job shop scheduling problems.
在此基础上，本文尝试将缩短空闲时间法应用到多作业动态车间作业调度问题上。
Scheduling problems, batch scheduling with controllable processing times have deep roots in the real world.
分批排序问题和加工时间可压缩的排序问题有着深刻的根源。
In this paper, we propose an improved Lagrangian relaxation algorithm to solve job shop scheduling problems.
针对车间调度问题，提出了一种改进的拉氏松弛算法。
It introduces the queuing methods to resolve the scheduling problems of AGV in a tobacco automatic warehouse.
运用排队论方法解决某烟厂烟叶自动化立体仓库中agv的调度问题。
The modern scheduling problems are more complex than classical scheduling problems, most of which are NP-hard problems.
这些现代排序问题比经典排序问题更为复杂，绝大多数都是NP-难问题。
In the grid environment, the essence of resource scheduling problems of virtual logistics is how to match resources and tasks.
网格环境下的虚拟物流资源调度问题，实质就是资源与任务如何匹配的问题。
Production scheduling problems nearly exits everywhere in the real environment, especially in the field of industrial project.
生产调度问题几乎在现实环境中，特别是在工业工程领域无所不在。
A lot of real world scheduling problems are very complex essentially, so it is hard to solve with traditional optimization methods.
许多制造工业提出的调度问题从本质上讲非常复杂，难以用传统优化方法求解。
This Paper presents an example of complex scheduling problems to show the possibility and importance using Group Technique at first.
本文首先给出一个复杂调度问题的例子，说明应用成组技术求解调度问题的可能性和重要性。
No-wait flow shop scheduling problems with total flow time minimization is an important manufacturing system widely existing in industrial environments.
以总完工时间为目标的无等待流水车间调度问题是一个重要的制造加工系统，广泛应用于工业生产中。
There are mainly three scheduling problems in AS/RS, including optimization of rack zone, crane route scheduling and optimization of load and unload system.
自动化仓储系统中的调度问题主要包括：库位优化问题、堆垛机优化调度问题、输送系统调度问题等。
In this paper, the importance and necessity are expressed, which are concerned with the scheduling problems in virtual shop oriented to future agile manufacturing.
阐述研究基于未来敏捷制造模式的虚拟车间调度问题的重要性和必要性。
Batch scheduling is one kind of issue that is different from classical scheduling problems in which a number of jobs can be processed simultaneously in one machine.
批调度问题是重要的一类现代调度问题，它打破了经典调度问题中对机器的限制，即一台机器可以同时加工多个工件而非仅仅一个工件。
Then the optimization models of multi-mode project payment scheduling problems(MPPSP) are constructed from the contractor's and the client's viewpoints respectively.
随后分别从承包商和业主各自的角度构建了多模式项目支付进度的优化模型；
In this paper we discuss the scheduling problems arisen in operation of cabin stewards. Under some hypothesis, these problems can be modeled as network flow problems.
本文考虑了其中一类和飞机配餐清扫问题有关的人员安排问题，在一定的假设之下，该问题的模型可以转化为一种网络流问题。
In this paper we discuss the scheduling problems arisen in operation of cabin stewards. Under some hypothesis, these problems can be modeled as network flow problems.
本文考虑了其中一类和飞机配餐清扫问题有关的人员安排问题，在一定的假设之下，该问题的模型可以转化为一种网络流问题。
应用推荐