Results 81 to 90 of about 1,791 (171)
Layout of graphs with bounded tree-width
, 2002 . A queue layout of a graph consists of a total order of the vertices, and a partition of the edges into queues, such that no two edges in the same queue are nested. The minimum number of queues in a queue layout of a graph is its queue-number.
David +3 more
core
Stack and Queue Layouts of Halin Graphs
, 1995 A Halin graph the union of a tree with no degree-2 vertices and a cycle on the leaves of the tree. This paper examines the problem of laying out Halin graphs using stacks and queues.
Joseph L. Ganley
core
On Mixed Linear Layouts of Series-Parallel Graphs
, 2021 A mixed s-stack q-queue layout of a graph consists of a linear order of its vertices and of a partition of its edges into s stacks and q queues, such that no two edges in the same stack cross and no two edges in the same queue nest.
Bekos, M. A. +3 more
core
Order batching in multi-server pick-and-sort warehouses. [PDF]
In many warehouses, customer orders are batched to profit from a reduction in the order picking effort. This reduction has to be offset against an increase in sorting effort.
Van Nieuwenhuyse, Inneke +2 more
core
The Influence of Facility Layout on Operations Explored
, 2011 Purpose – The purpose of this study is to explore the influence of an office canteen layout on operations, specifically on customer behaviour before checkout, waiting times, and congestion.
Emma Zijlstra +5 more
core +1 more source
Mixed Linear Layouts of Planar Graphs
, 2017 A k-stack (respectively, k-queue) layout of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges with respect to the vertex ordering.
Pupyrev, Sergey, Sergey Pupyrev
core +1 more source
Many-server queues with customer abandonment: Numerical analysis of their diffusion model
, 2013 We use a multidimensional diffusion process to approximate the dynamics of aqueue served by many parallel servers. Waiting customers in this queue may abandonthe system without service.
Jim Dai, J. G. Dai, Shuangchi He
core +1 more source
, 2003 A track layout of a graph consists of a vertex colouring, an edge colouring, and a total order of each vertex colour class such that between each pair of vertex colour classes, there is no monochromatic pair of crossing edges.
Vida Dujmovic, David R. Wood
core
Nearly periodic behavior in the overloaded G/D/s+GI queue
, 2011 Under general conditions, the number of customers in a GI/D/s+GI many-server queue at time t converges to a unique stationary distribution as t → ∞. However, simulations show that the sample paths routinely exhibit nearly periodic behavior over long time
Yunan Liu, Ward Whitt
core
Performance Approximation and Design of Pick-and-Pass Order Picking Systems
In this paper, we discuss an approximation method based on G/G/m queuing network modeling using Whitt’s (1983) queuing network analyzer to analyze pick-and-pass order picking systems.
Yu, M., Koster, M.B.M. de
core