Λ-Shaped Policies to Schedule Deteriorating Jobs

We study a problem of scheduling deteriorating jobs, i.e. jobs whose processing times are an increasing function of their starting times. We consider the case of a single machine and linear job-independent deterioration. The objective is to minimize the sum of weighted completion times, with weights proportional to the basic processing times. The optimal schedule is shown to be Λ-shaped, i.e. the sequence of the basic processing times has a single local maximum. Moreover, we show that the problem is solved in O(N log N) time. In the last section we test heuristics for the case of general weights.     

Single generator problem

Using the Stone-\v{C}ech compactification of integers, we introduce a free extension of an almost periodic flow. Together with some properties of outer functions, we see that, in a certain class of ergodic Hardy spaces , , the corresponding subspaces are all singly generated. This shows the existence of maximal weak- Dirichlet algebras, different from of the disc, for which the single generator problem is settled.

     

Analysis of Open Discrete Time Queueing Networks: A Refined Decomposition Approach

This paper deals with approximate analysis methods for open queueing networks. External and internal flows from and to the nodes are characterized by renewal processes with discrete time distributions of their interarrival times. Stationary distributions of the waiting time, the queue size and the interdeparture times are obtained using efficient discrete time algorithms for single server (GI/G/1) and multi-server (GI/D/c) nodes with deterministic service. The network analysis is extended to semi-Markovian representations of each flow among the nodes, which include parameters of the autocorrelation function.     

Project Management Duration/Resource Tradeoff Analysis: an Application of the Cut Search Approach

The paper presents an application oriented procedure for solving the project management duration/resource tradeoff problem. A procedure is presented for reducing a project from a normal to a crash duration state at a minimum amount of additional resource expenditure assuming a linear utilization functions. The procedure is network based using a graphical Cut Search Approach to locate the minimal resource level at each reduction in total project duration. Activity-on-arc networks and flow networks are utilized. The paper is presented for practical application and for conceptual development as compared to a theoretical treatment.     

Hyperfine quantum beat of short-lived beta-emitter8Li polarized by the tilted foil technique

To disclose the basic mechanisms of nuclear polarization creation realized by the tilted foil technique, hyperfine quantum beats of the nuclear polarization of the short-lived beta-emitter⁸Li(I =2⁺,T _1/2=840 ms) were measured as a function of the distance between two tilted foils. From the observed beats of the⁸Li nuclear polarization, it was found that the Fermi-contact interaction of the⁸Li nucleus with the ground 1s-electron in LiIII plays a main role in the final stage of polarization transfer from polarized orbital electrons to the⁸Li nucleus.