Journal of Human Resource Management
Volume 3, Issue 2, April 2015, Pages: 6-16
Received: Apr. 3, 2015;
Accepted: Apr. 29, 2015;
Published: May 13, 2015
Views 5093 Downloads 229
Ahmed M. Abed, Industrial Engineering Department, Zagazig University, Zagazig, Egypt
The heijunka tracking matrix has a direct impact on turn overtimes of the inventory to revamp existing orders as well as new technique, and increase the utilization of the inventory’ labors by eliminating the waste in transportation and over-processing actions. The tracking problem is interested in rearranging the location of VSM (e.g., items, pallets and stations) in a grouping of cellular aspect using 5’S concepts, which increase performance level. One of the successful recommendations used in this context is traveler salesman technique but with periodically update (i.e., Dynamic Gemba), it may be need reformulation. Its importance is the capture of work, information, and material (WIP, setup time, process time/unit, error rates, idle time, etc.) which is essential in quantifying and determining waste in terms of cost, delivery time and transportation frequency. This paper is interest in review the dynamic Gemba model to improve the inventory handling via modifying the traveler salesman model with aided proposed heuristic procedures, which are interested in arrange the inventory in minimum time and maximum flexibility in preparing the different orders. The Gemba tasks displayed via (Gemba KPI/DOE board) which contain cost and time information (NNVA: preparing tasks, VA: traveling||tracking tasks and NNVA: unloading tasks). The optimized cost and time analysis after reducing NNVA time and total VA time were sent to the central heijunka matrix. The methodology which includes elimination movements, motion and extra actions wastes are lean, and aim to increase the ability of prepare a lot of service in minimum time.
Ahmed M. Abed,
Create Heijunka 5’s Matrix to Control the Dynamic Gemba as Lean Tool, Journal of Human Resource Management.
Vol. 3, No. 2,
2015, pp. 6-16.
Aiello G, Enea M, Galante G,. Multi-objective approach to facility layout problem by genetic search algorithm and Electre method. Robotics and Computer-Integrated Manufacturing, 22, 447–455.(2006)
Aleisha EE, Lin L. For effectiveness facilities planning: Layout optimization then simulation, or vice versa? In Proceedings of the (2005).
Asef-Vaziri A, Laporte G. Loop based facility planning and material handling. European Journal of Operational Research, 164 (1), 1–11, (2005).
Bazargan-Lari M., Kaebernick H. Intra-cell and inter-cell layout designs for cellular manufacturing. International Journal of Industrial Engineering ± Applications and Practice 3,139±150, (1996).
Bazargan-Lari M., Kaebernick H. An approach to the machine layout problem in a cellular manufacturing environment. Production Planning and Control 8(1), 41±55, (1997).
Baykasoglu, A., Dereli, T., Sabuncu, I. An ant colony algorithm for solving budget constrained and unconstrained dynamic facility layout problems. Omega, 34(4), 385–396, (2006).
VanCamp, D.J., Carter, M.W., and Vannelli, A. Anon-linear optimization approach for solving facility layout problems. European Journal of Operational Research57, 174±189,(1992).
Heragu, S. S. Group technology and cellular manufacturing. IEEE Transactions on Systems, Man, and Cybernetics 24(2), (1994).
Heragu, S.S. and Kusiak, A. Efficient models for the facility layout problem. European Journal of Operational Research 53,1±13,1991.
Jumpup ^ Womack, Jim. Gemba Walks. Lean Enterprise Institute, Inc.p.348.ISBN978-1-934109-15-1,(2011).
Jumpup ^ http://ajm.sagepub.com/content/27/4/352.extract
Jumpup ^ Andrew Castle, Rachel Harvey. "Lean information management: the use of observational data in healthcare".InternationalJournalofProductivityandPerformanceManagement, Vol. 58 Iss: 3, pp. 280-299. ISSN 1741-0401., (2009)
Jumpup ^ Mann, David W. (2005). Creating a lean culture; tools to sustain lean conversions. Productivity Press. p. 211. ISBN1563273225.
H. Ku, H. Wang, N. A solution to the unequal is a facilities layout problem by genetic algorithm. Computers in Industry, 56(2), 207–220, (2005).