scheduling problem的例句大全

Whereas such circumstances, we studied a type of vehicle scheduling problem that single motor pool, multi-vehicles with time window in this paper.

鉴于这种情况，本文对单车场多车型非满载并带有时间窗的车辆优化调度问题进行了研究。

PSO based scheduling algorithm for open shop scheduling problem

基于粒子群优化的开放式车间调度

Open shop scheduling is an important scheduling problem and has wide engineering applications in manufacturing.

开放式车间调度（OSP）是重要的调度问题，它在制造领域中的应用非常广泛。

Open Shop Scheduling Problem ( OSSP) as one of various scheduling problems, can be encountered widely in diagnostic tests and service industry such as vehicle maintenance center.

开放式车间调度问题（Open-Shop scheduling problem，OSSP）是众多生产调度问题中的一种，广泛存在于检测和服务行业如汽车保养中心。

PESO ( Plant Engineering Shop Order) Group Technology Scheduling Problem with Linear Deterioration of Processing Time for Single-machine

工厂机加工车间任务单工件加工时间线性恶化的单机成组加工问题

Firstly, a fixed charge transportation ( FCT) model is formulated to solve the scheduling problem with sequence independent changeover time. Genetic local search algorithm ( GLSA) is developed for solving the problem.

针对产品切换时间顺序无关型调度问题，建立了相应的固定费用运输问题模型，研究了求解此模型的遗传局部搜索算法。

A job-shop scheduling problem was optimized with the proposed method. First, a EPN model of JSS was set up.

使用本优化方法，对一个车间调度问题进行了优化。

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）问题逐渐引申、发展而来的。

To resolve resource scheduling problem efficiently in manufacturing grid, a multi-objective optimization mathematical model was put forward, which was based on task time, machining quality, cost and service quality.

摘要为有效地解决制造网格中的资源调度问题，提出了以任务流程时间、加工质量、流程成本和服务质量为目标的多目标优化数学模型。

A new multiqueue method with variable priority is presented to solve the real time dynamic scheduling problem of automatic transportation system in flexible electrophoresis production line.

提出可变优先级的多重任务队列方法，解决电泳柔性生产线自动输送系统的实时动态调度问题。

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

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

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神经网络的求解新方法。

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

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

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完全问题，本文采用一种新的基于概率密度分布的优化算法&交叉熵方法，对其进行求解。

Greedy Algorithm Solution of Flexible Flow Shop Scheduling Problem

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

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学习算法的基础上，给出调度问题的马尔可夫决策过程描述；

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问题），混合流水车间调度问题很难求得最优解，启发式算法和智能优化算法（如遗传算法）求解此类问题的近优解的有效性和实用性已被证实。

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

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

VRP and JSP Models of Coordinate Scheduling Problem for Observing Satellites

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

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

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