We have designed and implemented a framework assisting client-side applications to utilize asynchronous Web services that deliver results by calling back the applications in the context of enterprise network security. This framework can support a number of rich features such as resumable client applications, the Single-Request/Multiple-Response (SRMR) message exchange pattern, intra-enterprise ...

We study the two-machine flow shop scheduling problem with no-wait in process, in which one of the machines is not available during a given time interval. The objective is to minimize the makespan. The problem is known to be NP-hard, and in the case of several non-availability intervals is not approximable within a constant factor. We consider all possible scenarios of handling the operation af...

This paper proposes a hybrid chemical-reaction optimization (HCRO) algorithm for solving the job-shop scheduling problem with fuzzy processing time. The flexible maintenance activities under both resumable and non-resumable situations are also considered to make the problem more close to the reality. In the proposed algorithm, each solution is represented by a chemical molecule. Four elementary...

In this article, we consider the non-resumable case of the single machine scheduling problem with a fixed non-availability interval. We aim to minimize the weighted sum of completion times. No polynomial 2-approximation algorithm for this problem has been previously known. We propose a 2-approximation algorithm with O(n) time complexity where n is the number of jobs. We show that this bound is ...

Application-level survivability, the ability to reconfigure an application to transparently maintain services when part of a system becomes unavailable, is the most flexible and comprehensive approach to supporting mission fulfillment since it can provide assurance over all lower layers within a networked system. We have developed Resumable FTP, an application based on RFC 959, which has the ab...

We describe an AI behavior architecture that supports responsive collaborative interruptible and resumable behaviors using behavior queues. This architecture wraps sets of behaviors into roles, which provide a simple efficient mechanism for encapsulating behaviors into components that can change dynamically, based on environmental criteria. To illustrate the viability of this architecture in a ...

We study the problem of scheduling n jobs in a two-machine flow shop where the second machine is not available for processing during a given time interval. A resumable scenario is assumed, i.e if a job cannot be finished before the down period it is continued after the machine becomes available again. The objective is to minimize the makespan. The best fast approximation algorithm for this prob...

I have argued in the past that there are commonalities between the different coroutine proposals and that there are opportunities for a unified proposal. This paper is meant to provide more detail about this. So far, the proposals have been presented as separate vertical solutions, and it has been claimed that there is no substantial common ground between them. However, I believe we should be l...