Ordinal Optimization
From MaRDI portal
Publication:3591376
DOI10.1007/978-0-387-68692-9zbMath1123.93007OpenAlexW4254845134MaRDI QIDQ3591376
Qing-Shan Jia, Yu-Chi Ho, Qian-Chuan Zhao
Publication date: 10 September 2007
Full work available at URL: https://doi.org/10.1007/978-0-387-68692-9
Feedback control (93B52) Research exposition (monographs, survey articles) pertaining to systems and control theory (93-02) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Selecting a Good Stochastic System for the Large Number of Alternatives, A combined statistical selection procedure measured by the expected opportunity cost, On the Control of a Queueing System with Aging State Information, Asymptotic optimality of myopic ranking and selection procedures, Hesitant adaptive search with estimation and quantile adaptive search for global optimization with noise, A New Budget Allocation Framework for the Expected Opportunity Cost, A three-stage optimization algorithm for the stochastic parallel machine scheduling problem with adjustable production rates, Unnamed Item, Optimal computing budget allocation for ordinal optimization in solving stochastic job shop scheduling problems, Solving a class of simulation-based optimization problems using ``optimality in probability, Bat algorithm assisted by ordinal optimization for solving discrete probabilistic bicriteria optimization problems, A simulation‐based differential evolution algorithm for stochastic parallel machine scheduling with operational considerations, Ordinal optimization based metaheuristic algorithm for optimal inventory policy of assemble-to-order systems, Suppressing phase damping decoherence by periodical imperfect projective measurements, Ordinal optimization of \(G/G/1/K\) polling systems with \(k\)-limited service discipline, An accelerated stopping rule for the nested partition hybrid algorithm for discrete stochastic optimization, A Genetic Algorithm for Finding Good Balanced Sequences in a Customer Assignment Problem with no State Information
