Parallel-machine scheduling with simple linear deterioration to minimize total completion time

We consider the parallel-machine scheduling problem in which the processing time of a job is a simple linear increasing function of its starting time. The objective is to minimize the total completion time. We give a fully polynomial-time approximation scheme (FPTAS) for the case with m identical machines, where m is fixed. This study solves an open problem that has been posed in the literature for ten years.     

我国下岗再就业政策存在问题的制度思考

为什么政府的下岗再就业政策会脱离社会整体性就业要求甚至不惜牺牲其他人群的就业利益?为什么政府采取了很多手段来促进下岗再就业现在却仍然步履维艰?政府在促进下岗再就业中应该发挥什么作用?本文试图从制度的视角对这三个问题加以思考和回答.     

带不同类型通用机的两组工件的Cmax问题

对每组都分别有一组同型号的专用机，另外不有一组与专用机不同类型的通用机的两组工件的Ｃｍａｘ问题，文中在专用机与通用机之间的选择上利用“最早完工”准则，依据ＬＰＴ法则，给出了一种近似算法。     

A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs

A fully polynomial approximation scheme for the problem of scheduling n deteriorating jobs on a single machine to minimize makespan is presented. Each algorithm of the scheme runs in O(n ⁵ L ⁴³) time, where L is the number of bits in the binary encoding of the largest numerical parameter in the input, and is required relative error. The idea behind the scheme is rather general and it can be used to develop fully polynomial approximation schemes for other combinatorial optimization problems. Main feature of the scheme is that it does not require any prior knowledge of lower and/or upper bounds on the value of optimal solutions.     

分组数据下简单步进应力加速寿命试验的极大似然估计

寿命分布为指数分布的场合下，对于简单步进应力加速寿命试验下所获得的寿命数据为分组数据的情形下，给出了加速方程中未知参数的极大似然估计（MLE），从而可计算出常应力下产品的平均寿命。     

高校贫困大学生择业心态现状调查及对策探讨

大学生,尤其是贫困大学生的择业心理问题不容忽视。本文在相关调查问卷的基础之上,重点分析了贫困大学生在择业过程中所表现出的复杂的心理状况,并提出了相应的对策,以期对贫困大学生顺利就业有所助益。     

对“翻译职位热”的思考

翻译是一种特殊形式的信息传播,在国际交往中的作用显而易见。以企业为主体、市场为导向、产学研相结合的技术创新体系的建立,促进了企业融入国际市场竞争,参与国际市场经济发展。我国加入WTO之后,采取有效政策措施,吸引更多的跨国公司在我国设立研发机构,同时,又鼓励更多有实力的中国企业实施"走出去的战略",到海外设立研发机构,这增加了对翻译人员的需求。翻译人员要提高自身素质,适应时代发展的需要。     

分组型数据三参数Weibull分布的参数估计

给出了在分组型数据下三参数Weibull分布的参数估计,并通过Monte-Carlo模拟说明了本文方法的可行性.     

RIBLL1终端实验装置

描述了一套HIRFL的放射性核次级束流引起反应测量的实验装置,它由RIB鉴别、测量系统、次级靶控制系统和次级反应产物鉴别、测量系统组成.高增益分组延迟线读出、重心定位PPAC,横向场IC,椭球面镜聚焦、PMT读出、闪烁薄膜时间拾取器,双叠层纵向场阳极分条读出IC,PMT矩阵读出x—y位置灵敏Phoswich闪烁探测器,康普顿抑制HpGeγ探测器等单元是这套装置的基本部件.目前,该装置已安装在兰州重离子加速器RIBLL1终端.性能测试和实验研究正在进行.     

Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines

In this paper, we study the permutation flow shop scheduling problems with deteriorating jobs on no-idle dominant machines. The objective is to minimize one of the two regular performance criteria, namely, makespan and total completion time. For each objective, the following dominant machines constraint: idm, ddm, idm–ddm and ddm–idm are considered. We present a polynomial time solution algorithm for each of the four cases.