A dual criteria sequencing problem with earliness and tardiness penalties

We consider the problem of sequencing n jobs on a single machine, with each job having a processing time and a common due date. The common due date is assumed to be so large that all jobs can complete by the due date. It is known that there is an O(n log n)‐time algorithm for finding a schedule with minimum total earliness and tardiness. In this article, we consider finding a schedule with dual criteria. The primary goal is to minimize the total earliness and tardiness. The secondary goals are to minimize: (1) the maximum earliness and tardiness; (2) the sum of the maximum of the squares of earliness and tardiness; (3) the sum of the squares of earliness and tardiness. For the first two criteria, we show that the problems are NP‐hard and we give a fully polynomial time approximation scheme for both of them. For the last two criteria, we show that the ratio of the worst schedule versus the best schedule is no more than . © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 422–431, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10020     

透明栅控SOI薄膜横向PIN光电探测器的光电特性

透明栅控SOI薄膜横向PIN光电探测器,是一种以SOI技术和互补金属氯化物半导体工艺为基础,综合SOI器件和传统双极、场效应光敏器件的新型光电探测器。利用半导体器件物理和基本方程,介绍和分析了器件结构及其工作原理,建立电压、电流物理模型。应用SILVACO器件仿真软件,完成器件的数值模拟与验证。在中短波长工作段,器件光电流随栅极电压的增大而增大,表现出明显的栅压控制特性。全耗尽状态下,器件的内部量子效率在中短波长(400nm,450nm,530nm,600nm)的光辐射下,可达到96%以上,甚至接近100%。短波长下(280nm,350nm),量子效率最大值近80%。此外,器件的暗电流很低,光暗电流之比超过106,具有高灵敏度。     

同态加密体制的构造研究

同态加密是近年来密码学中的热点研究领域。通过对现有构造方法的全面总结,分析了两种构造思路,即Gentry蓝图和BV11方法。同时还介绍了其他类型的同态加密方案,并归纳了现有构造方法存在的问题及研究前景。     

耗尽关机制导方法研究

本文研究了固体弹道导弹耗尽关机制导方法,提出了一种适用于无推力终止系统工作的固体弹道导弹．在要求能量随机耗尽条件下的混合制导模型,并进行仿真分析,论证了方案的可行性。     

对象边框标注数据的弱监督图像语义分割

针对图像语义分割应用中像素级标注数据费时昂贵的问题,主要研究以对象边框标注数据为代表的弱监督模型下的图像语义分割方法。使用基于金字塔的密集采样全卷积网络提取图像的像素级特征,并用GrabCut算法转化对弱监督数据进行数据标记,通过将图像特征和标记数据进行联合训练,构建了基于金字塔密集采样全卷积网络的对象边框标注弱监督图像语义分割模型,并在公开数据集上进行了验证。实验结果表明,所构建的弱监督模型与DET3-Proposed模型、全矩形转化模型以及Bbox-Seg模型相比,达到了更好的分割效果。     

全隐LU-SGS算法在高超声速热化学非平衡流刚性问题中的应用

在高超声速热化学非平衡流动计算中,当地气体能量松弛时间、化学反应特征时间与流动时间推进步长量级差异过大会带来严重数值刚性问题,且在高雷诺数条件下,壁面、拐角等强干扰区网格加密使得该问题加剧,导致初始最大CFL数极小,收敛速度缓慢.原始LU-SGS算法仅考虑化学反应源项和对流项的隐式处理,通过推导黏性项Jacobian矩...     

An FPTAS for scheduling a two‐machine flowshop with one unavailability interval

We study a deterministic two‐machine flowshop scheduling problem with an assumption that one of the two machines is not available in a specified time period. This period can be due to a breakdown, preventive maintenance, or processing unfinished jobs from a previous planning horizon. The problem is known to be NP‐hard. Pseudopolynomial dynamic programming algorithms and heuristics with worst case error bounds are given in the literature to solve the problem. They are different for the cases when the unavailability interval is for the first or second machine. The existence of a fully polynomial time approximation scheme (FPTAS) was formulated as an open conjecture in the literature. In this paper, we show that the two cases of the problem under study are equivalent to similar partition type problems. Then we derive a generic FPTAS for the latter problems with O(n⁵/ε⁴) time complexity. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Fully sequential procedures for comparing constrained systems via simulation

We consider the problem of finding the system with the best primary performance measure among a finite number of simulated systems in the presence of a stochastic constraint on a single real‐valued secondary performance measure. Solving this problem requires the identification and removal from consideration of infeasible systems (Phase I) and of systems whose primary performance measure is dominated by that of other feasible systems (Phase II). We use indifference zones in both phases and consider two approaches, namely, carrying out Phases I and II sequentially and carrying out Phases I and II simultaneously, and we provide specific example procedures of each type. We present theoretical results guaranteeing that our approaches (general and specific, sequential and simultaneous) yield the best system with at least a prespecified probability, and we provide a portion of an extensive numerical study aimed at evaluating and comparing the performance of our approaches. The experimental results show that both new procedures are useful for constrained ranking and selection, with neither procedure showing uniform superiority over the other.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

22 nm全耗尽型绝缘体上硅器件单粒子瞬态效应的敏感区域

基于3D-TCAD模拟,研究了22 nm全耗尽型绝缘体上硅(fully depleted silicon-on-insulator,FDSOI)器件单粒子瞬态(single-event transient,SET)效应的敏感性区域。对比了使用单管和使用反相器来研究器件SET敏感性区域的方法,从而分析实际电路中重离子轰击位置对22 nm FDSOI器件SET敏感性的影响,并从电荷收集机制的角度进行了解释。深入分析发现寄生双极放大效应对重粒子轰击位置敏感是造成器件不同区域SET敏感性不同的原因。而单管漏极接恒压源造成漏极敏感性增强是导致单管与反相器中器件SET敏感区域不同的原因。修正了FDSOI工艺下器件SET敏感性区域的研究方法,与单管相比,采用反相器进行仿真,结果更符合实际情况,这将为器件SET加固提供理论指导。     

Two-agent scheduling with linear resource-dependent processing times

This paper considers a two-agent scheduling problem with linear resource-dependent processing times, in which each agent has a set of jobs that compete with that of the other agent for the use of a common processing machine, and each agent aims to minimize the weighted number of its tardy jobs. To meet the due date requirements of the jobs of the two agents, additional amounts of a common resource, which may be in discrete or continuous quantities, can be allocated to the processing of the jobs to compress their processing durations. The actual processing time of a job is a linear function of the amount of the resource allocated to it. The objective is to determine the optimal job sequence and resource allocation strategy so as to minimize the weighted number of tardy jobs of one agent, while keeping the weighted number of tardy jobs of the other agent, and the total resource consumption cost within their respective predetermined limits. It is shown that the problem is -hard in the ordinary sense, and there does not exist a polynomial-time approximation algorithm with performance ratio unless ; however it admits a relaxed fully polynomial time approximation scheme. A proximal bundle algorithm based on Lagrangian relaxation is also presented to solve the problem approximately. To speed up convergence and produce sharp bounds, enhancement strategies including the design of a Tabu search algorithm and integration of a Lagrangian recovery heuristic into the algorithm are devised. Extensive numerical studies are conducted to assess the effectiveness and efficiency of the proposed algorithms.