Scheduling on same-speed processors with at most one downtime on each machine

We consider the problem of scheduling a set of independent tasks on multiple same-speed processors with planned shutdown times with the aim of minimizing the makespan. We give an LPT-based algorithm, LPTX, which yields a maximum completion time that is less than or equal to 3/2 the optimal maximum completion time or 3/2 the time that passes from the start of the schedule until the latest end of a downtime. For problems where the optimal schedule ends after the last downtime, and when the downtimes represent fixed jobs, the LPTX maximum completion time is within 3/2 of the optimal maximum completion time. In addition, we show that this result is asymptotically tight for the class of polynomial algorithms assuming that P≠NP. We also show that the bound obtained previously for a similar problem, when no more than half of the machines are shut down at the same time, for the LPT algorithm is asymptotically tight in the class of polynomial algorithms if P≠NP.     

Single-machine group scheduling with processing times dependent on position,starting time and allotted resource

This article considers scheduling problems on a single machine with learning effect, deteriorating jobs and resource allocation under group technology (GT) assumption. We assume that the actual processing time of a job depends on the job position, the group position, the starting time and the amount of resource allocated to them concurrently, and the actual setup times of groups depend on the group position and the amount of resource allocated to them concurrently. Two resource allocation functions are examined for minimizing the weighted sum of makespan and total resource cost. We prove that the problems have polynomial solutions under the condition that the number of jobs in each group are the same.     

A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines

The main results in a recent paper [M. Cheng, S. Sun, L. He, Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines, European Journal of Operational Research 183 (2007) 115–124] are incorrect because job processing times are variable due to deteriorating effect, which is not taken into account by the authors. In this note, we show first by counter-examples that the published results are incorrect, and then we provide corrected results.     

Necessary and sufficient conditions of optimality for some classical scheduling problems

A scheduling problem is generally to order the jobs such that a certain objective function f(π) is minimized. For some classical scheduling problems, only sufficient conditions of optimal solutions are concerned in the literature. In this paper, we study the necessary and sufficient conditions by means of the concept of critical ordering (critical jobs and their relations). These results are meaningful in recognition and characterization of optimal solutions of scheduling problems.     

Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem

We study a static stochastic single machine scheduling problem in which jobs have random processing times with arbitrary distributions, due dates are known with certainty, and fixed individual penalties (or weights) are imposed on both early and tardy jobs. The objective is to find an optimal sequence that minimizes the expected total weighted number of early and tardy jobs. The general problem is NP-hard to solve; however, in this paper, we develop certain conditions under which the problem is solvable exactly. An efficient heuristic is also introduced to find a candidate for the optimal sequence of the general problem. Our illustrative examples and computational results demonstrate that the heuristic performs well in identifying either optimal sequences or good candidates with low errors. Furthermore, we show that special cases of the problem studied here reduce to some classical stochastic single machine scheduling problems including the problem of minimizing the expected weighted number of early jobs and the problem of minimizing the expected weighted number of tardy jobs which are both solvable by the proposed exact or heuristic methods.     

创新:学报编辑工作的灵魂

高校学报是知识的重要载体和传媒，要想更好地发挥其传播人类文明的作用，要想生存和发展，唯有不断创新，创新是时代赋予学报编辑工作的崇高历史使命，是学报编辑工作的本质特征，是学报发展的不竭动力，学报编辑工作创新应主要从编辑观念，选题策划，编辑手段，编辑人才，编辑管理等方面着手。     

新工件到达锁定初始调度的单机重调度问题

研究了新工件到达锁定初始调度的单机重调度问题.即有一组带有不同释放时间的初始工件已经按照最小化完成时间和的优化目标调度完毕,形成初始调度且已锁定,此时有一组释放时间为零的新工件到达,且需要插入初始调度进行加工,其优化目标为最小化新工件的完工时间和.文中研究了新工件的加工过程可中断和新工件的加工过程不可中断,共2类新工件到达锁定初始调度的单机重调度问题.分析了重调度问题的复杂性,针对第一类重调度问题提出了多项式算法并证明了其最优性.证明了第二类重调度问题为NP完全问题,提出了一个多项式算法,并证明了该算法的有效性和最优解的特征,解决了企业实际问题并进一步丰富了重调度理论.     

一类变系数分组Cox回归模型及其估计

讨论了一类变系数分组Cox回归模型.该模型提高了线性分组Cox回归模型的灵活性和适应性.基于局部加权极大似然估计方法,讨论了该模型的参数估计问题,利用迭代加权最小二乘法给出了局部似然方程的迭代算法.     

关于实验动物从业人员岗位培训的几点建议

生命科学的快速发展对实验动物从业人员的素质提出了更高的要求,为此建议实验动物学岗位培训应根据 管理、实验和饲养岗位的不同,按各自的需要分类培训,并组织、编写实验动物学岗位系列培训教材,在培训过程中 充分利用网络的实验动物教学资源,注重多媒体演示教材的制作与利用,充分发挥远程教育在实验动物岗位培训 中的作用。     

群桩加筋效应机理研究

把Poulos的弹性理论法推广到对群桩进行整体分析,群桩中每根桩的形状和荷载可以互不相同．对2根桩的分析表明,受荷桩使其邻桩的桩身产生了附加轴应力及附加剪应力,桩对土的加筋效应就是通过附加剪应力发生的．对群桩的分析表明,其他桩的加筋效应使受荷桩的沉降产生了折减,当桩土模量比和桩间距较小时,忽略桩的加筋效应会对群桩分析带来很大的误差．对群桩内的应力分布分析表明,与单桩相比,由于桩的加筋效应,使得群桩能够把较多的荷载直接传递到桩端平面．