Untangling Spaghetti

Flinchbaugh, Jamie
February 2009
Assembly;Feb2009, Vol. 52 Issue 2, p72
The author offers tips on understanding spaghetti diagrams in lean transformation. He recommends using a two-dimensional (2D) scale layout of a work area for new beginners in spaghetti diagrams. He enumerates the three distinct flows that must be understood in analyzing the current state of a process including the flows of material, people and information. He also suggests taking into account the boundaries of the process to be mapped before and during the mapping exercise.


Related Articles

  • LIPSCHITZIAN MULTIFUNCTIONS AND A LIPSCHITZIAN INVERSE MAPPING THEOREM. Levy, A. B. // Mathematics of Operations Research;Feb2001, Vol. 26 Issue 1, p105 

    We introduce a new class of multifunctions whose graphs under certain "kernel inverting" matrices, are locally equal to the graphs of Lipschitzian (single-valued) mappings. We characterize the existence of Lipschitzian localizations of these multifunctions in terms of a natural condition on a...

  • Rock and Roads in Ohio: A More Sophisticated Look at Ohio's Major Roads Leading to the Rock Hall. Sharp, Sister Mary Theresa // Ohio Journal of School Mathematics;Spring2005, Issue 51, p81 

    This article presents exercises which require knowledge of graphing line segments given in a variety of information sources. The exercises could enhance one's knowledge of Ohio's major roads leading to the Rock and Roll Hall Fame and Museum which is located in Cleveland, Ohio.

  • SCHOLASTIC News Teacher's Edition Vol. 73, No. 24, May 16, 2005.  // Scholastic News -- Edition 5/6 (Teacher's Edition);5/16/2005, Vol. 73 Issue 24, p1 

    Presents several information resources on zoos and other topics. Background on the Central Park Zoo in New York City; Overview of the All-American Soap Box Derby in the U.S.; Quiz on graphs.

  • Sparse H-Colourable Graphs of Bounded Maximum Degree. Hossein Hajiabolhassan; Xuding Zhu // Graphs & Combinatorics;Mar2004, Vol. 20 Issue 1, p65 

    Let F be a graph of order at most k. We prove that for any integer g there is a graph G of girth at least g and of maximum degree at most 5 k 13 such that G admits a surjective homomorphism c to F, and moreover, for any F-pointed graph H with at most k vertices, and for any homomorphism h from G...

  • On the 7 Total Colorability of Planar Graphs with Maximum Degree 6 and without 4-cycles. Lan Shen; Yingqian Wang // Graphs & Combinatorics;Aug2009, Vol. 25 Issue 3, p401 

    Vizing and Behzad independently conjectured that every graph is (Δ + 2)-totally-colorable, where Δ denotes the maximum degree of G. This conjecture has not been settled yet even for planar graphs. The only open case is Δ = 6. It is known that planar graphs with Δ ≥ 9 are...

  • Total Restrained Domination in Cubic Graphs. Hongxing Jiang; Liying Kang; Erfang Shan // Graphs & Combinatorics;Aug2009, Vol. 25 Issue 3, p341 

    A set S of vertices in a graph G = ( V, E) is a total restrained dominating set (TRDS) of G if every vertex of G is adjacent to a vertex in S and every vertex of V − S is adjacent to a vertex in V − S. The total restrained domination number of G, denoted by γ tr( G), is the...

  • Lipschitz mappings, contingents, and differentiability. Ponomarev, Stanislav.; Turowska, Małgorzata. // Siberian Mathematical Journal;Jul2007, Vol. 48 Issue 4, p669 

    The main purpose of the paper is to show that, for each real normed space Y of infinite dimension, each number L > 0, and each at most countable set Q ⊂ ℝ, there exists a Lipschitz mapping ƒ: ℝ → Y, with constant L, whose graph has a tangent everywhere, whereas ƒ...

  • Full Graph Methods of Switched Current Circuit Solution. Brtník, Bohumil // Computer Technology & Application;2011, Vol. 2 Issue 5, p471 

    Circuits with switched current are described by an admittance matrix and seeking current transfers then means calculating the ratio of algebraic supplements of this matrix. As there are also graph methods of circuit analysis in addition to algebraic methods, it is clearly possible in theory to...

  • MINIMAL SETS OF FUNCTIONS WITH CONNECTED Gδ GRAPH.  // Real Analysis Exchange;Jun2006 Conference, Vol. 32, p67 

    The article discusses minimal sets of functions with connected Gδ graph. The authors state that a map f ∈ J has a positive topological entropy if and only if f has a periodic point whose period is not a power of 2. They add that for a map f in J, a non-empty set M ⊂ I is minimal if...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics