All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 66 Next

Displaying 1301 – 1320 of 1566

Showing per page

Single-use reliability computation of a semi-Markovian system

Guglielmo D'Amico (2014)

Applications of Mathematics

Markov chain usage models were successfully used to model systems and software. The most prominent approaches are the so-called failure state models Whittaker and Thomason (1994) and the arc-based Bayesian models Sayre and Poore (2000). In this paper we propose arc-based semi-Markov usage models to test systems. We extend previous studies that rely on the Markov chain assumption to the more general semi-Markovian setting. Among the obtained results we give a closed form representation of the first...

Solution approaches to large shift scheduling problems

Monia Rekik, Jean-François Cordeau, François Soumis (2008)

RAIRO - Operations Research

This paper considers large shift scheduling problems with different shift start times and lengths, fractionable breaks and work stretch duration restrictions. Two solution approaches are proposed to solve the problems over a multiple-day planning horizon. The first approach is based on a local branching strategy and the second one is based on a temporal decomposition of the problem. Local branching is very efficient in finding good feasible solutions when compared to a classical branch-and-bound...

Solving intuitionistic fuzzy multi-objective linear programming problem and its application in supply chain management

Hassan Hassanpour, Elham Hosseinzadeh, Mahsa Moodi (2023)

Applications of Mathematics

The aim of this paper is solving an intuitionistic fuzzy multi-objective linear programming problem containing intuitionistic fuzzy parameters, intuitionistic fuzzy maximization/minimization, and intuitionistic fuzzy constraints. To do this, a linear ranking function is used to convert the intuitionistic fuzzy parameters to crisp ones first. Then, linear membership and non-membership functions are used to manipulate intuitionistic fuzzy maximization/minimization and intuitionistic fuzzy constraints....

Solving multi-agent scheduling problems on parallel machines with a global objective function

F. Sadi, A. Soukhal, J.-C. Billaut (2014)

RAIRO - Operations Research - Recherche Opérationnelle

In this study, we consider a scheduling environment with m(m ≥ 1) parallel machines. The set of jobs to schedule is divided into K disjoint subsets. Each subset of jobs is associated with one agent. The K agents compete to perform their jobs on common resources. The objective is to find a schedule that minimizes a global objective function f0, while maintaining the regular objective function of each agent, fk, at a level no greater than a fixed value, εk (fk ∈ {fkmax, ∑fk}, k = 0, ..., K). This...

Solving systems of two–sided (max, min)–linear equations

Martin Gavalec, Karel Zimmermann (2010)

Kybernetika

A finite iteration method for solving systems of (max, min)-linear equations is presented. The systems have variables on both sides of the equations. The algorithm has polynomial complexity and may be extended to wider classes of equations with a similar structure.

Solving the simple plant location problem by genetic algorithm

Jozef Kratica, Dušan Tošic, Vladimir Filipović, Ivana Ljubić (2001)

RAIRO - Operations Research - Recherche Opérationnelle

The simple plant location problem (SPLP) is considered and a genetic algorithm is proposed to solve this problem. By using the developed algorithm it is possible to solve SPLP with more than 1000 facility sites and customers. Computational results are presented and compared to dual based algorithms.

Solving the simple plant location problem by genetic algorithm

Jozef Kratica, Dušan Tošic, Vladimir Filipović, Ivana Ljubić (2010)

RAIRO - Operations Research

The simple plant location problem (SPLP) is considered and a genetic algorithm is proposed to solve this problem. By using the developed algorithm it is possible to solve SPLP with more than 1000 facility sites and customers. Computational results are presented and compared to dual based algorithms.

Some aspects of balking and reneging in finite buffer queues

Amit Choudhury, Pallabi Medhi (2011)

RAIRO - Operations Research

In this paper, a single server finite buffer Markovian queuing system is analyzed with the additional restriction that customers may balk as well as renege. Reneging considered in literature is usually of position independent type where the reneging rate is constant irrespective of the position of the customer in the system. However there are many real world situations where this assumption does not hold. This paper is an attempt to model balking with position dependent reneging. Explicit closed...

Some aspects of balking and reneging in finite buffer queues

Amit Choudhury, Pallabi Medhi (2011)

RAIRO - Operations Research

In this paper, a single server finite buffer Markovian queuing system is analyzed with the additional restriction that customers may balk as well as renege. Reneging considered in literature is usually of position independent type where the reneging rate is constant irrespective of the position of the customer in the system. However there are many real world situations where this assumption does not hold. This paper is an attempt to model balking with position dependent reneging. Explicit closed...

Some examples of non-monotonicities in a two-unit redundant system

Antonín Lešanovský (1984)

Aplikace matematiky

A cold-standby redundant sytem with two identical units and one repair facility is considered. Units can be in three states: good ( I ) , degraded ( I I ) , and failed ( I I I ) . It is supposed that only the following state-transitions of a unit are possible: I → I I , I I → I I I , I I → I , I I I → I . The paper deals with the comparison of some initial situations of the system and with a stochastical improvement of units (stochastical increase of time of work in state I and/or stochastical decrease of times of repairs of the types I I → I and/or I I I → I ) and...

Currently displaying 1301 – 1320 of 1566