The search session has expired. Please query the service again.
Displaying 1241 –
1260 of
1566
We investigate the steady state behavior of an M/G/1 queue with modified Bernoulli
schedule server vacations. Batches of variable size arrive at the system according to a
compound Poisson process. However, all arriving batches are not allowed into the
system. The restriction policy differs when the server is available in the system and
when he is on vacation. We obtain in closed form, the steady state probability
generating functions for the number of customers in the queue for various states...
Agile development is a crucial issue within software engineering because one of the goals of any project leader is to increase the speed and flexibility in the development of new commercial products. In this sense, project managers must find the best resource configuration for each of the work packages necessary for the management of software development processes in order to keep the team motivated and committed to the project and to improve productivity and quality. This paper presents ReSySTER,...
The problem of hedging a contingent claim with minimization of quadratic risk is studied. Existence of an optimal strategy for the model with proportional transaction cost and nondelayed observation is shown.
In process robustness studies, it is desirable to minimize the influence of noise factors on the system and simultaneously determine the levels of controllable factors optimizing the overall response or outcome. In the cases when a random effects model is applicable and a fixed effects model is assumed instead, an increase in the variance of the coefficient vector should be expected. In this paper, the impacts of this assumption on the results of the experiment in the context of robust parameter...
We consider the scheduling of an interval order precedence graph of unit execution time tasks with communication delays, release dates and deadlines. Tasks must be executed by a set of processors partitioned into K classes; each task requires one processor from a fixed class. The aim of this paper is to study the extension of the Leung–Palem–Pnueli (in short LPP) algorithm to this problem. The main result is to prove that the LPP algorithm can be extended to dedicated processors and monotone communication...
This paper describes a procedure that uses particle swarm optimization (PSO) combined with the Lagrangian Relaxation (LR) framework to solve a power-generator scheduling problem known as the unit commitment problem (UCP). The UCP consists of determining the schedule and production amount of generating units within a power system subject to operating constraints. The LR framework is applied to relax coupling constraints of the optimization problem. Thus, the UCP is separated into independent optimization...
In this paper, we study the problem of makespan minimization for the multiprocessor
scheduling problem in the presence of communication delays. The communication delay
between two tasks i and j depends on the distance
between the two processors on which these two tasks are executed. Lahlou shows that a
simple polynomial-time algorithm exists when the length of the schedule is at most two
(the problem becomes 𝒩𝒫-complete when the length of the schedule
...
In this paper, we study the problem of makespan minimization for the multiprocessor
scheduling problem in the presence of communication delays. The communication delay
between two tasks i and j depends on the distance
between the two processors on which these two tasks are executed. Lahlou shows that a
simple polynomial-time algorithm exists when the length of the schedule is at most two
(the problem becomes 𝒩𝒫-complete when the length of the schedule
...
In this paper, open shop scheduling problems with limited machine availability are studied. Such a limited availability of machines may appear in many real-life situations, e.g. as preventive maintenance activities. Three types of jobs are distinguished: non-preemptable, resumable and preemptable. An operation of a resumable job if not completed before a non-availability period of a machine may be suspended and continued without additional cost when the machine becomes available. In the paper, results...
Currently displaying 1241 –
1260 of
1566