Preemptive scheduling on two identical parallel machines with a single transporter

We consider a scheduling problem on two identical parallel machines, in which the jobs are moved between the machines by an uncapacitated transporter. In the processing preemption is allowed. The objective is to minimize the time by which all completed jobs are collected together on board the transporter. We identify the structural patterns of an optimal schedule and design an algorithm that either solves the problem to optimality or in the worst case behaves as a fully polynomial-time approximation scheme.     

真空纳米微电子结构自发射阴极的电磁场研究

介绍了一种改进的“透镜”算法。用该算法和相应的实验研究了两种自发射阳极的静电场特性（尖锥直径为１０~１ｎｍ）,其电场放大系数达到１０~２。并研究了在阴极尖锥附近的电场强度与尖锥结构的关系：分析了表面粗糙程度的影响。最后所得的计算机算法和程序适用于研究任意形状的纳米尖锥阴极。     

Single machine scheduling with general positional deterioration and rate-modifying maintenance

We present polynomial-time algorithms for single machine problems with generalized positional deterioration effects and machine maintenance. The decisions should be taken regarding possible sequences of jobs and on the number of maintenance activities to be included into a schedule in order to minimize the overall makespan. We deal with general non-decreasing functions to represent deterioration rates of job processing times. Another novel extension of existing models is our assumption that a maintenance activity does not necessarily fully restore the machine to its original perfect state. In the resulting schedules, the jobs are split into groups, a particular group to be sequenced after a particular maintenance period, and the actual processing time of a job is affected by the group that job is placed into and its position within the group.     

Flow Shop Scheduling Problems Under Machine–Dependent Precedence Constraints

The paper considers the flow shop scheduling problems to minimize the makespan, provided that an individual precedence relation is specified on each machine. A fairly complete complexity classification of problems with two and three machines is obtained.