Results 141 to 150 of about 1,791 (171)

Effect of conversion of functional layout to a cellular layout on the queue time performance: some new insights

open access: yesInternational Journal of Advanced Manufacturing Technology, 2006
Transition from a functional system to a cellular system involves partitioning the machine and part populations. Partitioning the machine population degrades the queue time performance. This paper investigates whether splitting the part population into part families can offset the effect of partitioning the machine population on queue time. Queue times
Usha Ananthakumar
exaly   +4 more sources

Queue layouts on folded hypercubes

Discrete Applied Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Weihua Yang, Weihua Yang
exaly   +3 more sources

Stack and Queue Layouts of Directed Acyclic Graphs: Part II

SIAM Journal on Computing, 1999
Summary: Stack layouts and queue layouts of undirected graphs have been used to model problems in fault tolerant computing and in parallel process scheduling. However, problems in parallel process scheduling are more accurately modeled by stack and queue layouts of directed acyclic graphs (dags).
Lenwood S Heath
exaly   +3 more sources

Evaluation of the virtual cell layout through simulation and design of experiments with regard to queue time

International Journal of Services Operations and Informatics, 2010
Virtual cellular manufacturing combines the high production routing flexibility of the job shop layout with the efficiency in terms of set-up of traditional cells. However, since this is a relatively recent concept, the implementation of the virtual cell layout in industry is still almost inexistent, despite the significant potential that this layout ...
João Carlos Espíndola Ferreira
exaly   +2 more sources

Queue Layouts of Hypercubes

SIAM Journal on Discrete Mathematics, 2012
A queue layout of a graph consists of a linear ordering $\sigma$ of its vertices and a partition of its edges into sets, called queues, such that in each set no two edges are nested with respect to $\sigma$. We show that the $n$-dimensional hypercube $Q_n$ has a layout into $n-\lfloor \log_2 n \rfloor$ queues for all $n\ge 1$.
Petr Gregor   +2 more
openaire   +1 more source

Planar Graphs of Bounded Degree Have Bounded Queue Number

open access: yesSIAM Journal on Computing, 2019
A queue layout of a graph consists of a linear order of its vertices and a partition of its edges into queues, so that no two independent edges of the same queue are nested.
Michael A Bekos   +2 more
exaly   +2 more sources

Stack and Queue Layouts of Directed Acyclic Graphs: Part I

SIAM Journal on Computing, 1993
Summary: Stack layouts and queue layouts of undirected graphs have been used to model problems in fault-tolerant computing and in parallel process scheduling. However, problems in parallel process scheduling are more accurately modeled by stack and queue layouts of directed acyclic graphs (dags).
Lenwood S. Heath   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy