scientific article; zbMATH DE number 805057

From MaRDI portal
Publication:4851772

zbMath0920.93003MaRDI QIDQ4851772

David D. W. Yao, Paul Glasserman

Publication date: 12 October 1995


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

Designing parsimonious scheduling policies for complex resource allocation systems through concurrency theoryCERTAIN DEVELOPMENTS ON SOLUTIONS OF DYNAMIC INEQUALITIES IN THE PREMISE OF TIME SCALESCoordinated production and inspection in a tandem systemOptimal couplings are totally positive and moreScheduling parallel processors: Structural properties and optimal policiesOptimality of monotonic policies for two-action Markovian decision processes, with applications to control of queues with delayed information\(S\)-modular games, with queueing applicationsMonotone optimal control for a class of Markov decision processesHeuristic policies for stochastic knapsack problem with time‐varying random demandAntimatroids and balanced pairsAn Overview for Markov Decision Processes in Queues and NetworksThe affine representation theorem for abstract convex geometriesAn algorithm approach to bounding aggregations of multidimensional Markov chainsOptimal control of a stochastic assembly production lineThe asymptotic value-to-capacity ratio for the multi-class stochastic knapsack problemStatistical Model Checking Using Perfect SimulationA survey of fundamental operations on discrete convex functions of various kindsOn basic operations related to network induction of discrete convex functionsSurgery scheduling of pelvic fracture patients with stochastic recovery timeFrom max-plus algebra to nonexpansive mappings: A nonlinear theory for discrete event systems.Optimal allocation of buffers and customers in a two-node cyclic network with multiple servers