The modified-offered-load approximation can be used to choose a staffing function (the time-varying number of servers) to stabilize delay probabilities at target levels in multi-server delay models with time-varying arrival rates, with or without customer abandonment. In contrast, as we confirm with simulations, it is not possible to stabilize blocking probabilities to the same extent in corres...

This paper considers a three-stage assembly flowshop scheduling problem with sequence-dependent setup < /div> times at the first stage and blocking times between each stage in such a way that the weighted mean completion time and makespan are minimized. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time using traditiona...

Previous work has shown that (i) it is not possible to find a time-varying staffing policy (number of servers) to stabilize blocking probabilities in a multi-server loss model with flexible staffing and a nonhomogeneous Poisson arrival process to the same extent as in a corresponding delay model, because the blocking probabilities necessarily change dramatically after each staffing change, but ...

In this paper we propose the use of genetic algorithms (GA) for solving the problem of dynamic establishment of all-optical connections in wavelengthrouted optical networks. All-optical connections can be required to be either fault tolerant or not. We first consider the case where no failure restoration capability is demanded to the optical layer. In this case, an all-optical connection consis...

We propose new non-blocking interfaces for the collective group communication functions defined in MPI1 and MPI-2. This document is meant as a standard extension and written in the same way as the MPI standards. It covers the MPI-API as well as the semantics of the new operations.

to compare intubating conditions and hemodynamic changes between bonfils intubation fiberscope and macintosh laryngoscopy without administering neuromuscular blocking drugs (nmbds). methods: in this randomized controlled trial,80 male and female patients, scheduled for elective surgery, aged 15 to 60 years, asa class ii or i, non-obese, non smokers, without anticipated difficult intubation; wer...

In this paper we study single-server tandem queues with general service times and finite buffers. Jobs are served according to the Blocking-After-Service protocol. To approximately determine the throughput and mean sojourn time, we decompose the tandem queue into single-buffer subsystems, the service times of which include starvation and blocking, and then iteratively estimate the unknown param...

Hybrid flow-shop or flexible flow shop problems have remained subject of intensive research over several years. Hybrid flow-shop problems overcome one of the limitations of the classical flow-shop model by allowing parallel processors at each stage of task processing. In many papers the assumptions are generally made that there is unlimited storage available between stages and the setup times a...