Je nový algoritmus lineárního programování lepší nebo horší než simplexová metoda?
Page 1
Displaying 1 – 9 of 9
Jedna úloha optimální obsluhy několika výrobních procesů s náhodnými parametry
Karel Sladký (1967)
Kybernetika
Jeux différentiels et approximation numérique de fonctions valeur. 2e partie : étude numérique
B. Alziary de Roquefort (1991)
ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique
Job shop scheduling with unit length tasks
Meike Akveld, Raphael Bernhard (2012)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
In this paper, we consider a class of scheduling problems that are among the fundamental optimization problems in operations research. More specifically, we deal with a particular version called job shop scheduling with unit length tasks. Using the results of Hromkovič, Mömke, Steinhöfel, and Widmayer presented in their work Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms, we analyze the problem setting for 2 jobs with an unequal number of tasks. We contribute a deterministic algorithm...
Job shop scheduling with unit length tasks
Meike Akveld, Raphael Bernhard (2012)
RAIRO - Theoretical Informatics and Applications
In this paper, we consider a class of scheduling problems that are among the fundamental optimization problems in operations research. More specifically, we deal with a particular version called job shop scheduling with unit length tasks. Using the results of Hromkovič, Mömke, Steinhöfel, and Widmayer presented in their work Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms, we analyze the problem setting for 2 jobs with an unequal...
Joint distribution of the busy and idle periods of a discrete modified queue
Anatolij Dvurečenskij (1988)
Aplikace matematiky
For a discrete modified queue, , where the service times of all customers served during any busy period are independent random variables with not necessarily identical distribution functions, the joint distribution of the busy period, the subsequent idle period and the number of customers served during the busy period is derived. The formulae presented are in a convenient form for practical use. The paper is a continuation of [5], where the discrete modified queue has been studied.
Joint distribution of the number of customers in the queue and the number of batches served at time within a busy period
A. Borthakur (1981)
RAIRO - Operations Research - Recherche Opérationnelle
Joint distribution of waiting time and queue size for single server queues [Book]
Władysław Szczotka (1986)
Joint queue-perturbed and weakly coupled power control for wireless backbone networks
Thomas Otieno Olwal, Karim Djouani, Okuthe P. Kogeda, Barend Jacobus van Wyk (2012)
International Journal of Applied Mathematics and Computer Science
Wireless Backbone Networks (WBNs) equipped with Multi-Radio Multi-Channel (MRMC) configurations do experience power control problems such as the inter-channel and co-channel interference, high energy consumption at multiple queues and unscalable network connectivity. Such network problems can be conveniently modelled using the theory of queue perturbation in the multiple queue systems and also as a weak coupling in a multiple channel wireless network. Consequently, this paper proposes a queue perturbation...
Currently displaying 1 – 9 of 9
Page 1