Results 111 to 120 of about 1,396 (174)

Developing customer convenience and experience through increased competency and efficiency: A strategic approach to retail operations mastery. [PDF]

Heliyon
C V SK, Agrawal R.
europepmc   +1 more source

Characteristics of a Miniature Fiber-Optic Inorganic Scintillator Detector for Electron-Beam Therapy Dosimetry. [PDF]

Sensors (Basel)
Qin Z, Chen Z, He B, Sun W, Gao Y.
europepmc   +1 more source

GW: ultra-fast chromosome-scale visualisation of genomics data

Cleal K, Kearsey A, Baird DM.
europepmc   +1 more source

OPERATIONAL FEASIBILITY ANALYSIS OF QUEUE MANAGEMENT SYSTEM IN A DECENTRALIZED OUTPATIENT DEPARTMENT LAYOUT AT RUKMANI BIRLA HOSPITAL, JAIPUR

, 2023
Ankita Kulshrestha; Dr.
Ankita Kulshrestha
openalex   +2 more sources

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

The International 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
Leela Nagasrinivasarao Pitchuka, Gajendra K. Adil, Usha Ananthakumar   +2 more
openalex   +4 more sources

Stack and Queue Layouts of Directed Acyclic Graphs: Part I

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, Sriram V. Pemmaraju, Ann N. Trenk   +2 more
openalex   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

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$.
Vida Vukašinović, Petr Gregor, Riste Škrekovski   +2 more
openaire   +2 more sources