查询词典 scheduling problem

The High Speed Uplink Packet Access technology includes Adaptive Modulation and Coding, Hybrid Automatic Repeat Request, and Node B fast scheduling. It also solves the problem of sharing the uplink channel resources for User Equipment.

为了改善上行性能，高速上行分组接入主要考虑的技术包括自适应调制编码、混合自动重传、节点B快速调度，以及用户终端如何共享上行信道资源，同时包括增加增强的媒体访问控制实体，对协议进行增强和优化。

The High Speed Uplink Packet Access technology includes Adaptive Modulation and Coding, Hybrid Automatic Repeat Request, and Node B fast scheduling. It also solves the problem of sharing the uplink channel resources for User Equipment. Moreover, it has Medium Access Control protocol entities (MAC-e and MAC-es) to enhance and optimize the protocol.

为了改善上行性能，高速上行分组接入主要考虑的技术包括自适应调制编码、混合自动重传、节点B快速调度，以及用户终端如何共享上行信道资源，同时包括增加增强的媒体访问控制实体，对协议进行增强和优化。

We realize TCP/IP distributed simulation in client/server computing mode on Novell Network by Network programming interface NETBIOS (Network Basic Input/Output System) and provide Graphic User Interface for users in WINDOWS development environment. We solve upgrading problem of WINDOWS FOR WORKGROUPS in installation and contradiction between NETBIOS interrupt call with windows multitask scheduling and memory management.

在协议实现方面，以NOVELL网络为开发环境，用WINDOWS为用户提供图形界面，以客户/服务器方式，运用网络编程接口NETBIOS实现了TCP/IP分布式仿真，并解决了Windows for Workgroups安装过程中的升级问题及NETBIOS中断调用与WINDOWS多任务调度、内存管理的冲突。

In this paper we consider the problem of scheduling jobs on a single batch processing machine.

对于这一类问题，国内外很多学者做了大量的研究工作。

Batching machine scheduling problem has its root in various application areas and has attracted a lot of attention recently.

排序论作为运筹学的一个重要分支，有深刻的实际背景和广阔的应用前景，一直受到国内外学术界的重视。

The idea of zero cost cycle is devised to solve the critical problem of minimum cost flow. Additional related results obtained include: the theory of bottleneck analysis based on minimum cost augmentation chain and zero cost cycle; the proof of the existence condition and the coherence condition of bottlenecks based on network output; methods to solve various kinds of process bottlenecks; the development of the algorithms of optimization and bottleneck analysis of MCPN (i. e, MCPN-CBA1 and MCPN-CBA2); a series of scheduling strategies and algorithms based on cost analysis, profit evaluation and bottlenecks of process flow line.

四。提出了基于工艺流程成本分析、利润评价的两类生产网络模式：最小成本生产网络和最大利润生产网络；首次提出零成本圈的概念，从而提出并研究了最小费用流的临界问题；创建了基于最小成本增广链、零成本圈的瓶颈分析理论，证明了过程瓶颈的存在性条件以及基于网络加工量的瓶颈一致性条件；给出了求解各类瓶颈的关键技术，研究开发了MCPN的瓶颈分析算法MCPN-CBA1、MCPN-CBA2；提出了一系列基于工艺流程成本分析、利润评价及过程瓶颈的调度策略和调度算法。

Scheduling is a kind of important combinatorial optimization problem.

排序问题是一类重要的组合最优化问题。

Scheduling is an important combinatorial optimization problem.

调度问题是一类重要的组合最优化问题。

It introduces a mathematic model on the scheduling problem for discrete manufacturing system.

首先介绍了离散制造业中生产调度的最大加工时间最短的数学模型。

In the scheduling layer, we discussed such papermaking workshop which has stochastic demand and failure. Mathematical model is setup. This problem are inverted into discrete dynamic programming.

在调度层针对具有随机需求和纸机故障的造纸车间，建立了数学模型，并利用一致化转移方法将其转化为离散动态规划问题。

When this condition occurs, inbound replication with the source partner is stopped on the destination domain controller and event ID 2042 is logged in the Directory Services event log.

计算机密码学是研究计算机信息加密、解密及其变换的科学，是数学和计算机的交义学科，也是一门新兴的学科。

Instructions: click on the thumbnails to see a larger image, then use the left-right arrow keys to scroll through the slideshow.

使用说明：滑鼠点在小图上即可放大观赏。开启后键盘左右键可用来换照片。