Sciweavers

4320 search results - page 461 / 864
» Functional Objects
Sort
View
COR
2008
112views more  COR 2008»
15 years 6 months ago
Buffer allocation in general single-server queueing networks
-- The optimal buffer allocation in queueing network systems is a difficult stochastic, non-linear, integer mathematical programming problem. Moreover, the objective function, the ...
Frederico R. B. Cruz, A. R. Duarte, Tom Van Woense...
CORR
2008
Springer
112views Education» more  CORR 2008»
15 years 6 months ago
Approximating Transitivity in Directed Networks
We consider the minimum equivalent digraph (directed network) problem (also known as the strong transitive reduction) and its maximum objective function variant, with two types of...
Piotr Berman, Bhaskar DasGupta, Marek Karpinski
EOR
2010
96views more  EOR 2010»
15 years 6 months ago
The hybrid flow shop scheduling problem
The scheduling of flow shops with multiple parallel machines per stage, usually referred to as the Hybrid Flow Shop (HFS), is a complex combinatorial problem encountered in many r...
Rubén Ruiz, José Antonio Vázq...
EOR
2008
91views more  EOR 2008»
15 years 6 months ago
Dominance-based heuristics for one-machine total cost scheduling problems
We study the one-machine scheduling problem with release dates and we look at several objective functions including total (weighted) tardiness and total (weighted) completion time...
Antoine Jouglet, David Savourey, Jacques Carlier, ...
EOR
2008
150views more  EOR 2008»
15 years 6 months ago
Portfolio optimization when asset returns have the Gaussian mixture distribution
Abstract. Portfolios of assets whose returns have the Gaussian mixture distribution are optimized in the static setting to find portfolio weights and efficient frontiers using the ...
Ian Buckley, David Saunders, Luis Seco