THE CLASSIFICATION AND PERIOD OF STATES FOR MARKOV CHAIN IN RANDOM ENVIRONMENT

This paper is a continuation of [8]. In Section 1, three kinds of communication are introdnced for two states and the relations among them are investigated. In Section 2, two kinds of period of a state are introdnced and it is obtained that the period is a “class property” ,i.e. two states x and y belong to same class implies the period of x is equal to the period of y.     

一个强极限定理

设是可列非齐次马氏链，本文通过利用［１］中提出的在Ｗｉｅｎｅｒ概率空间的一种实现，而给出了一个对任意可列非齐次马氏链普遍成立的强极限定理。     

Minimizing makespan on a single machine subject to random breakdowns

We investigate optimal sequencing policies for the expected makespan problem with an unreliable machine, where jobs have to be reprocessed in their entirety if preemptions occur because of breakdowns. We identify a class of uptime distributions under which LPT minimizes expected makespan.     

Photoinitiated curing of mono‐ and bifunctional epoxides by combination of active chain end and activated monomer cationic polymerization methods

Photoinitiated cationic polymerization of mono‐ and bifunctional epoxy monomers, namely cyclohexeneoxide (CHO), 4‐epoxycyclohexylmethyl‐3′,4′‐epoxycyclohexanecarboxylate (EEC), respectively by using sulphonium salts in the presence of hydroxylbutyl vinyl ether (HBVE) was studied. The real‐time FTIR spectroscopic, gel content determination, and thermal characterization studies revealed that both hydroxyl and vinyl ether functionalities of HBVE take part in the polymerization. During the polymerization, HBVE has the ability to react via both active chain end (ACE) and activated monomer mechanisms through its hydroxyl and vinyl ether functionalities, respectively. Thus, more efficient curing was observed with the addition of HBVE into EEC‐containing formulations. It was also demonstrated that HBVE is effective in facilitating the photoinduced crosslinking of monofunctional epoxy monomer, CHO in the absence of a conventional crosslinker. © 2007 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 4914–4920, 2007     

Optimal vaccine scheduling in cancer immunotherapy

Cancer immunotherapy aims at stimulating the immune system to react against cancer stealth capabilities. It consists of repeatedly injecting small doses of a tumor-associated molecule one wants the immune system to recognize, until a consistent immune response directed against the tumor cells is observed.

We have applied the theory of optimal control to the problem of finding the optimal schedule of injections of an immunotherapeutic agent against cancer. The method employed works for a general ODE system and can be applied to find the optimal protocol in a variety of clinical problems where the kinetics of the drug or treatment and its influence on the normal physiologic functions have been described by a mathematical model.

We show that the choice of the cost function has dramatic effects on the kind of solution the optimization algorithm is able to find. This provides evidence that a careful ODE model and optimization schema must be designed by mathematicians and clinicians using their proper different perspectives.     

Scheduling orders for multiple product types to minimize total weighted completion time

We consider the problem of scheduling orders for multiple different product types in an environment with m dedicated machines in parallel. The objective is to minimize the total weighted completion time. Each product type is produced by one and only one of the m dedicated machines; that is, each machine is dedicated to a specific product type. Each order has a weight and may also have a release date. Each order asks for certain amounts of various different product types. The different products for an order can be produced concurrently. Preemptions are not allowed. Even when all orders are available at time 0, the problem has been shown to be strongly NP-hard for any fixed number (?2) of machines. This paper focuses on the design and analysis of efficient heuristics for the case without release dates. Occasionally, however, we extend our results to the case with release dates. The heuristics considered include some that have already been proposed in the literature as well as several new ones. They include various static and dynamic priority rules as well as two more sophisticated LP-based algorithms. We analyze the performance bounds of the priority rules and of the algorithms and present also an in-depth comparative analysis of the various rules and algorithms. The conclusions from this empirical analysis provide insights into the trade-offs with regard to solution quality, speed, and memory space.     

Parametric and Non Homogeneous Semi-Markov Process for HIV Control

In AIDS control, physicians have a growing need to use pragmatically useful and interpretable tools in their daily medical taking care of patients. Semi-Markov process seems to be well adapted to model the evolution of HIV-1 infected patients. In this study, we introduce and define a non homogeneous semi-Markov (NHSM) model in continuous time. Then the problem of finding the equations that describe the biological evolution of patient is studied and the interval transition probabilities are computed. A parametric approach is used and the maximum likelihood estimators of the process are given. A Monte Carlo algorithm is presented for realizing non homogeneous semi-Markov trajectories. As results, interval transition probabilities are computed for distinct times and follow-up has an impact on the evolution of patients.      

FMS scheduling based on timed Petri Net model and reactive graph search

This paper presents a new scheduling method for manufacturing system based on the Timed Petri Net model and a reactive fast graph search algorithm. The following two typical problems are addressed in this paper. (1) Minimization of the maximum completion time. (2) Minimization of the total tardiness. As for the problem (1), a new search algorithm which combines the RTA^∗ and a rule-based supervisor is proposed. As for problem (2), the original Petri Net model is converted to its reverse model and the algorithm developed for the problem (1) is applied, regarding the due date as the starting time in the reverse model. Some numerical experiments are carried out to demonstrate usefulness of our algorithm.     

Heuristic Algorithms and Scatter Search for the Cardinality Constrained P||Cmax Problem

We consider the generalization of the classical P||C_max problem (assign n jobs to m identical parallel processors by minimizing the makespan) arising when the number of jobs that can be assigned to each processor cannot exceed a given integer k. The problem is strongly NP-hard for any fixed k > 2. We briefly survey lower and upper bounds from the literature. We introduce greedy heuristics, local search and a scatter search approach. The effectiveness of these approaches is evaluated through extensive computational comparison with a depth-first branch-and-bound algorithm that includes new lower bounds and dominance criteria.     

关于任意随机变量序列泛函的强极限定理

本文在k是固定的正整数，{fn}是R^k 1上的Borel可测函数列时，得到了任意随机变量序列{Xrn≥0}的泛函{fn(Xn-k,…,Xn)}的强极限定理，它是Chung的关于独立随机变量序列的强大数律的推广，作为推论，得到了k重非齐次马尔科夫链的一类强极限定理．