Stochastic Model for Multiple Classes and Subclasses Simple Documents Processing

The issue of document management has been raised for a long time, especially with the appearance of office automation in the 1980s, which led to dematerialization and Electronic Document Management (EDM). In the same period, workflow management has experienced significant development, but has become more focused on the industry. However, it seems to us that document workflows have not had the same interest for the scientific community. But nowadays, the emergence and supremacy of the Internet in electronic exchanges are leading to a massive dematerialization of documents;which requires a conceptual reconsideration of the organizational framework for the processing of said documents in both public and private administrations. This problem seems open to us and deserves the interest of the scientific community. Indeed, EDM has mainly focused on the storage (referencing) and circulation of documents (traceability). It paid little attention to the overall behavior of the system in processing documents. The purpose of our researches is to model document processing systems. In the previous works, we proposed a general model and its specialization in the case of small documents (any document processed by a single person at a time during its processing life cycle), which represent 70% of documents processed by administrations, according to our study. In this contribution, we extend the model for processing small documents to the case where they are managed in a system comprising document classes organized in subclasses;which is the case for most administrations. We have thus observed that this model is a Markovian ML×K/ML×K/1 queues network. We have analyzed the constraints of this model and deduced certain characteristics and metrics. In fine, the ultimate objective of our work is to design a document workflow management system, integrating a component of global behavior prediction.

A Novel Real-time Optimization Methodology for Chemical Plants

In this paper, a novel approach termed process goose queue (PGQ) is suggested to deal with real-time optimization (RTO) of chemical plants. Taking advantage of the ad-hoc structure of PGQ which imitates biologic nature of flying wild geese, a chemical plant optimization problem can be re-formulated as a combination of a multi-layer PGQ and a PGQ-Objective according to the relationship among process variables involved in the objective and constraints. Subsequently, chemical plant RTO solutions are converted into coordination issues among PGQs which could be dealt with in a novel way. Accordingly, theoretical definitions, adjustment rule and implementing procedures associated with the approach are explicitly introduced together with corresponding enabling algorithms. Finally, an exemplary chemical plant is employed to demonstrate the feasibility and validity of the contribution.

Heavy Traffic Limit Theorems for a Queue with Poisson ON/OFF Long-range Dependent Sources and General Service Time Distribution

In Internet environment, traffic flow to a link is typically modeled by superposition of ON/OFF based sources. During each ON-period for a particular source, packets arrive according to a Poisson process and packet sizes （hence service times） can be generally distributed. In this paper, we establish heavy traffic limit theorems to provide suitable approximations for the system under first-in first-out （FIFO） and work-conserving service discipline, which state that, when the lengths of both ON- and OFF-periods are lightly tailed, the sequences of the scaled queue length and workload processes converge weakly to short-range dependent reflecting Gaussian processes, and when the lengths of ON- and/or OFF-periods are heavily tailed with infinite variance, the sequences converge weakly to either reflecting fractional Brownian motions （FBMs） or certain type of long- range dependent reflecting Gaussian processes depending on the choice of scaling as the number of superposed sources tends to infinity. Moreover, the sequences exhibit a state space collapse-like property when the number of sources is large enough, which is a kind of extension of the well-known Little＇s law for M/M/1 queueing system. Theory to justify the approximations is based on appropriate heavy traffic conditions which essentially mean that the service rate closely approaches the arrival rate when the number of input sources tends to infinity.