scheduling problem

Greedy Algorithm Solution of Flexible Flow Shop Scheduling Problem

柔性流水作业排序问题的贪心算法求解

This paper proposed a CAMR heuristic for the collection-aware scheduling problem. It lowered the whole responding time through transmitting input data and receiving result alternately.

本文提出了一个基于多次通信策略的算法，称为CAMR算法，它通过交替地传输输入数据和接收处理结果，更好地重叠计算和通信而降低整个应用的响应时间。

Under the assumption that the capacities of non-bottleneck machines are infinite, operations on the non-bottleneck machines are aggregated into a time delay. The job shop problem is then reduced into a single-machine scheduling problem with release time and delivery time constraints.

假设非瓶颈机加工能力无限大，将非瓶颈机上的工序集结成一个时间迟延环节，原问题则简化为一个带到达时间和传递时间约束的单机调度问题。

Modeling and Solution of A Multi-Resources Dynamic Scheduling Problem with Time Windows Based on DCSP

基于动态约束满足的一类含时间窗口的多资源动态调度模型与方法

This paper designs application of the algorithm in optimizing multi-objective flexible job-shop scheduling. ( 3) A simulation experiment is carried out to illustrate that the proposed hybrid genetic algorithm could solve the general multi-objective flexible job shop scheduling problem problem effectively.

对该算法在多目标柔性作业车间调度优化的应用进行了详细设计。（3）仿真结果表明，提出的混合遗传算法可以有效解决一般模式下的多目标柔性作业车间调度问题。

Owing to the high computational complexity, it is quite difficult to solve hybrid flow shop scheduling problem exactly. Heuristic algorithms and intelligent optimization algorithms ( e.g.genetic algorithm) have been proved to be effective and practical to achieve near optimal solution of this problem.

由于高度的计算复杂性（NP-hard问题），混合流水车间调度问题很难求得最优解，启发式算法和智能优化算法（如遗传算法）求解此类问题的近优解的有效性和实用性已被证实。

It relates to many factors such as classes, teachers, classrooms, time, course and so on, and is a scheduling problem with multiple objectives.

它涉及到班级、教师、教室、时间、课程等很多因素，是一个多目标的统筹调度问题。

Based on the research of the internal features of maintenance scheduling problem, this paper establishes its integer programming based optimization module and algorithm.

本文在研究检修计划问题的内在特点基础上，建立了基于整数规划的检修计划优化模型和算法。

As the test scheduling problem has been verified to be NP problem, this dissertation adopts a new optimization algorithm based on probability density distribution called cross-entropy method for test scheduling.

由于测试调度问题已被证明属于NP完全问题，本文采用一种新的基于概率密度分布的优化算法&交叉熵方法，对其进行求解。

For solving the temporal-relating planning and scheduling problem, a dynamic algorithm is proposed based on temporal constraints network ( TCN).

为解决与时间有关的规划调度问题，提出了一种基于时间约束网络的动态算法。

Study of Multi-machine Scheduling Problem Based on Greedy Algorithm

基于贪婪算法的多机床调度问题研究

An effective Hopfield neural network ( HNN) approach to multiprocessor job scheduling problem ( known to be a NP hard problem) is proposed, which is apt to resource and timing ( execution time and deadline) constraints.

针对具有时间约束（执行时间和最后执行期限）和若干资源约束的多处理器作业调度问题（已知是NP难解的），提出了一种基于离散的Hopfield神经网络的求解新方法。

The paper first presents an objective model of task scheduling, and then based on the analysis of Q learning algorithm, the Markov decision process description of the scheduling problem is given.

首先建立任务调度问题的目标模型，在分析Q学习算法的基础上，给出调度问题的马尔可夫决策过程描述；

Present a hybrid genetic algorithm to solve the scheduling problem of Reconfigurable Production Line which set capability of bottleneck as target.

根据可重组生产线的作业计划问题，研究了以瓶颈工序产能为目标的可重组生产线调度问题的核心算法&混合遗传算法。

Study on the Model and Its Tabu Search Algorithm for the JD Multi-vehicle Distribution Scheduling Problem

JD多车型配送车辆调度问题的模型及其禁忌搜索算法研究

Application of Improved Ant Colony Algorithm to Berth Scheduling Problem of Continuous Case

改进蚁群算法在泊位连续化调度问题中的应用

This paper presents a differential evolution algorithm to solve the multiprocessor scheduling problem with arbitrary task graph. Multiprocessor scheduling is a NP-hard problem, many papers employ heuristic.

本文主要基于现代启发式差分算法讨论多处理机调度，多处理机调度是NP组合优化问题，目前多采用启发算法。

The research and development of the scheduling problem for the networked control systems

网络控制系统调度问题的研究与进展

In this paper, we consider the scheduling and wavelength assignment ( SWA) problem which arises in optical wavelengthdivisionmultiplexing ( WDM) networks.

本文考虑基于波分复用技术（WDM）的光学网络中的排序与波长分配问题。

For the nonstandard Job-Shop scheduling problem ( NJSSP) in which some operations are processed on several identical machines, by the objective function of machine loads balancing nonstandard scheduling algorithm is presented.

针对加工工序的设备是多台具有相同加工能力的机器集合的非标准Job-Shop调度问题，利用机器负载平衡的思想构造目标函数，提出了非标准Job-Shop调度算法。

Experiment indicates our method may satisfy solving need of disruption management model of production scheduling problem.

实验表明，本文算法可以较好的满足生产调度干扰管理模型的求解需求。

Job Shop scheduling problem ( JSSP) is a class of combinatorial optimum problems with time, sequence and resource constraints.

车间作业调度问题（Job shop scheduling problem，JSSP）是一类具有时间约束、次序约束和资源约束的组合优化问题。

A Competitive Analysis for the Open On-line k Trucks Scheduling Problem with Time Window

带时间窗的局内开放式车调度问题的竞争分析

Production scheduling of batch process with parallel machines is studied in the production scheduling pattern. Sequence independent changeover time and sequence dependent changeover time are distinguished in the scheduling problem.

针对批量过程型多机器并行加工生产环境，研究了具有顺序无关型产品切换时间和顺序相关型产品切换时间两种调度问题。

In conformity to the general job shop scheduling problem, this paper constructs a gap network consisting of nodes, shortest paths and adjacent paths.

对应于一般单件车间排序问题，构造了一种由节点、最短路径和相邻路径组成的隙网络。

For the first hand TCP congestion control performance in two network situations where packet loss probability is a function of flow rates is studied. For the second hand the channel scheduling problem in OBS network is discussed.

一方面，研究了在分组丢失概率与流速率相关的两种网络情形下TCP的拥塞控制特性；另一方面，研究了在光突发交换网络中信道优化调度问题。

VRP and JSP Models of Coordinate Scheduling Problem for Observing Satellites

卫星观测联合调度问题的VRP与JSP模型

Flexible Job-Shop Scheduling Problem ( FJSS) in fuzzy environment is one of the most important issues in practical flexible manufacturing systems, chich extends and developes from classical job-shop scheduling ( JSS) problem.

模糊环境下的柔性作业车间调度（Flexible Job-Shop Scheduling，FJSS）问题是实际生产系统中的核心问题之一，它是由古典作业车间调度（Job-Shop Scheduling，JSS）问题逐渐引申、发展而来的。

The Infeasible Solution Problem of Shifting Bottleneck Procedure for Job Shop Scheduling

作业车间调度转换瓶颈算法的不可行解问题

To the best of the authors' knowledge, this is the first time Iterative Rounding Method is applied to scheduling problem.

这是第一次将迭代取整法应用到调度问题中。