Results 11 to 20 of about 1,396 (174)

Queue layouts of iterated line directed graphs

open access: bronzeDiscrete Applied Mathematics, 2006
AbstractIn this paper, we study queue layouts of iterated line directed graphs. A k-queue layout of a directed graph consists of a linear ordering of the vertices and an assignment of each arc to exactly one of the k queues so that any two arcs assigned to the same queue do not nest.
Toru Hasunuma
openalex   +3 more sources

Design of a manufacturing facility layout with a closed loop conveyor with shortcuts using queueing theory and genetic algorithms [PDF]

open access: greenProceedings of the 2011 Winter Simulation Conference (WSC), 2011
Most current manufacturing facility layout problem solution methods aim at minimizing the total distance traveled, the material handling cost, and/or the time spent in the system (based on distance traveled at a specific speed). The methodology proposed in this paper solves the looped layout design problem for a looped layout manufacturing facility ...
Vernet Lasrado, Dima Nazzal
  +6 more sources

Layered Separators for Queue Layouts, 3D Graph Drawing and Nonrepetitive Coloring [PDF]

open access: green2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013
Graph separators are a ubiquitous tool in graph theory and computer science. However, in some applications, their usefulness is limited by the fact that the separator can be as large as Ω(√n) in graphs with n vertices. This is the case for planar graphs, and more generally, for proper minor-closed families.
Vida Dujmović, Pat Morin, David R. Wood
openalex   +3 more sources

Queue Layouts of Graphs with Bounded Degree and Bounded Genus

open access: green, 2019
Motivated by the question of whether planar graphs have bounded queue-number, we prove that planar graphs with maximum degree $Δ$ have queue-number $O(Δ^{2})$, which improves upon the best previous bound of $O(Δ^6)$. More generally, we prove that graphs with bounded degree and bounded Euler genus have bounded queue-number.
Vida Dujmović, Pat Morin, David R. Wood
openalex   +4 more sources

A Two-Stage Queue Model to Optimize Layout of Urban Drainage System considering Extreme Rainstorms [PDF]

open access: hybridMathematical Problems in Engineering, 2017
Extreme rainstorm is a main factor to cause urban floods when urban drainage system cannot discharge stormwater successfully. This paper investigates distribution feature of rainstorms and draining process of urban drainage systems and uses a two‐stage single‐counter queue method M/M/1 → M/D/1 to model urban drainage system.
Xinhua He, Wenfa Hu
openalex   +2 more sources

Queue length estimation at signalized intersections based on magnetic sensors by different layout strategies

open access: goldTransportation Research Procedia, 2017
Abstract This paper modeled and analyzed the queue length estimation mechanisms by different layout strategies. According to the lane allocations of intersections, several feasible layout strategies of magnetic sensors are proposed. Furthermore, a layout strategy with one single magnetic sensor is proposed to estimate the queue length.
Haijian Li   +4 more
openalex   +3 more sources

Process analysis and optimal facility layout planning in manufacturing systems [PDF]

open access: yesYugoslav Journal of Operations Research, 2023
In this article, it is emphasized that the process analysis for companies is carried out by using the DISCO process mining program and the results are interpreted and developed.
Ceylan Cemil   +3 more
doaj   +1 more source

On Linear Layouts of Graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2004
In a total order of the vertices of a graph, two edges with no endpoint in common can be crossing, nested, or disjoint. A k-stack (respectively, k-queue, k-arch) layout of a graph consists of a total order of the vertices, and a partition of the
Vida Dujmović, David R. Wood
doaj   +2 more sources

Track Layouts of Graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2004
A \emph(k,t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between each pair of colour classes no two monochromatic edges cross.
Vida Dujmović   +2 more
doaj   +3 more sources

Research of the layout optimization in robotic mobile fulfillment systems

open access: yesInternational Journal of Advanced Robotic Systems, 2020
To improve the order fulfillment throughput and space utilization in the robotic mobile fulfillment system (RMFS), the research developed two design aspects: the layout design and the warehouse structural parameter configuration.
Shasha Wu   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy