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 3 Next

Displaying 41 – 60 of 96

Showing per page

Minimization of the total completion time for asynchronous transmission in a packet data-transmission system

Adam Piórkowski, Jan Werewka (2010)

International Journal of Applied Mathematics and Computer Science

The minimization of the total completion time for asynchronous transmission in distributed systems is discussed. Attention is focused on the problem of message scheduling on part of the sender. Messages to be sent form a queue, and the order in which they are to be sent has to be first established. The methods of scheduling messages, which minimize the factor of the total completion time, are presented herein. The message-scheduling problem becomes considerably complicated when the stream of data...

Multistage interconnection networks in multiprocessor systems. A simulation study.

Víctor López de Buen (1987)

Qüestiió

The principal modelling and simulation features of multistage interconnection networks operating in packet switching are discussed in this paper. The networks studied interconnect processors and memory modules in multiprocessor systems. Several methods are included to increase the bandwidth achievable with this kind of networks. Besides using network buffering, the possibility of having queues of requests at the memory modules is considered. Network conflicts can be reduced using a second network...

On minimizing total tardiness in a serial batching problem

Philippe Baptiste, Antoine Jouglet (2001)

RAIRO - Operations Research - Recherche Opérationnelle

We study the problem of scheduling jobs on a serial batching machine to minimize total tardiness. Jobs of the same batch start and are completed simultaneously and the length of a batch equals the sum of the processing times of its jobs. When a new batch starts, a constant setup time s occurs. This problem 1 | s-batch | ∑ T i is known to be NP-Hard in the ordinary sense. In this paper we show that it is solvable in pseudopolynomial time by dynamic programming.

On Minimizing Total Tardiness in a Serial Batching Problem

Philippe Baptiste, Antoine Jouglet (2010)

RAIRO - Operations Research

We study the problem of scheduling jobs on a serial batching machine to minimize total tardiness. Jobs of the same batch start and are completed simultaneously and the length of a batch equals the sum of the processing times of its jobs. When a new batch starts, a constant setup time s occurs. This problem 1|s-batch | ∑Ti is known to be NP-Hard in the ordinary sense. In this paper we show that it is solvable in pseudopolynomial time by dynamic programming.

On the M/G/1 retrial queue subjected to breakdowns

Natalia V. Djellab (2002)

RAIRO - Operations Research - Recherche Opérationnelle

Retrial queueing systems are characterized by the requirement that customers finding the service area busy must join the retrial group and reapply for service at random intervals. This paper deals with the M/G/1 retrial queue subjected to breakdowns. We use its stochastic decomposition property to approximate the model performance in the case of general retrial times.

On the M/G/1 retrial queue subjected to breakdowns

Natalia V. Djellab (2010)

RAIRO - Operations Research

Retrial queueing systems are characterized by the requirement that customers finding the service area busy must join the retrial group and reapply for service at random intervals. This paper deals with the M/G/1 retrial queue subjected to breakdowns. We use its stochastic decomposition property to approximate the model performance in the case of general retrial times.

On the proper intervalization of colored caterpillar trees

Carme Àlvarez, Maria Serna (2009)

RAIRO - Theoretical Informatics and Applications

This paper studies the computational complexity of the proper interval colored graph problem (PICG), when the input graph is a colored caterpillar, parameterized by hair length. In order prove our result we establish a close relationship between the PICG and a graph layout problem the proper colored layout problem (PCLP). We show a dichotomy: the PICG and the PCLP are NP-complete for colored caterpillars of hair length ≥2, while both problems are in P for colored caterpillars of hair length <2. For...

Currently displaying 41 – 60 of 96