Ordinal optimization of \(G/G/1/K\) polling systems with \(k\)-limited service discipline
From MaRDI portal
Publication:1016394
DOI10.1007/s10957-008-9444-9zbMath1176.90121MaRDI QIDQ1016394
Shih-Cheng Horng, Shin-Yeu Lin
Publication date: 5 May 2009
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-008-9444-9
90B22: Queues and service in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Embedding evolutionary strategy in ordinal optimization for hard optimization problems, Ordinal optimization of \(G/G/1/K\) polling systems with \(k\)-limited service discipline
Cites Work
- A new approach to analysis of polling systems
- Mean value analysis for polling systems
- Applications of optimization heuristics to estimation and modelling problems
- Ordinal optimization of \(G/G/1/K\) polling systems with \(k\)-limited service discipline
- Universal alignment probabilities and subset selection for ordinal optimization
- Simulation budget allocation for further enhancing the efficiency of ordinal optimization
- Multilayer feedforward networks are universal approximators
- Gated polling systems with Lévy inflow and inter-dependent switchover times: A dynamical-systems approach
- An explanation of ordinal optimization: Soft computing for hard problems
- Simulation-based optimization: Parametric optimization techniques and reinforcement learning
- Mathematical methods to study the polling systems
- Tabu search directed by direct search methods for nonlinear global optimization
- Computational intelligence in time series forecasting. Theory and engineering applications
- Analysis of finite-capacity polling systems
- A comparison of various tests of normality
- A survey of simulated annealing as a tool for single and multiobjective optimization
- Ordinal Optimization
- Introduction to Stochastic Search and Optimization
- Practical Genetic Algorithms
