https://www.journal.riverpublishers.com/index.php/JGEU/issue/feed 2025-06-02T11:14:04+00:00 JGEU Executive Editor & Editor-in-Chief mangeyram@geu.ac.in Open Journal Systems <h1>Journal of Graphic Era University</h1> <p>Published by Graphic Era (Deemed to be University), India</p> <p>The frequency of publication is Bi annual</p> <p><strong><em>Journal of Graphic Era University</em></strong> is an international journal of science and technology which published the articles/review papers/case studies that demonstrate interaction between various disciplines such as electronics engineering, mechanical and automobile engineering, petroleum engineering, computer science &amp; engineering, electrical engineering, civil engineering, management, mathematical sciences, space sciences, allied sciences and humanities, biotechnology and their applications.<br />JGEU is an Open Access Journal, and does not charge readers or their institutions for access to the journal articles. The open access supports the rights of users to read, download, copy, distribute, print, search, or link to the full texts of these articles provided they are properly acknowledged and cited.</p> https://www.journal.riverpublishers.com/index.php/JGEU/article/view/421 2025-06-02T11:14:04+00:00 Santosh Kumar OAM antosh.Kumarau@gmail.com Elias Munapo emunapo@gmail.com

<p>Nearest neighbour approach for determination of the minimum travelling salesman tour is a well-documented heuristic for a quick identification of the salesman tour and its associated cost. This heuristic has been used on large sized networks for a quick approximate solution to the travelling salesman problem. For the last several years, an alternative approach to the minimum travelling salesman tour has been developed through the minimum spanning tree (MST). The MST was converted to an index restricted MST (IRMST) and that IRMST was used to find the minimum travelling salesman tour. These two approaches, i.e., the greedy heuristics and the index restricted minimum spanning tree seems to have stronger relations and it is this relationship, which has been explored in this paper. The nearest neighbour approach to find the travelling salesman tour has been modified by incorporating the index balancing theorem. A further modification to this heuristic has been suggested to identify the minimum travelling salesman tour. Many small size problems have been attempted using the heuristic discussed in this paper, and it resulted in an optimal solution but an analytical proof for optimality remains a challenge. This approach further strengthens a natural question about the ‘NP Hard’ category associated with the minimum travelling salesman tour problem.</p>

2025-06-02T00:00:00+00:00 Copyright (c) 2025 https://www.journal.riverpublishers.com/index.php/JGEU/article/view/415 2025-05-10T12:30:32+00:00 Amit Surya amits.ip.22@nitj.ac.in Rakesh Kumar sharmark@nitj.ac.in Rajeev Trehan rtrehan@nitj.ac.in

<p class="noindent">The manufacturing sector has grown significantly during the last two to three decades. Because of the intense competition, customers now place a higher priority on price, delivery time, and product quality. This study employs lean methods and methodologies, including root-cause analysis, kaizen ideas, evaluation of kaizen ideas, and before-and-after comparison, to evaluate the operational performance of the organization. It accomplishes this by using kaizen analysis to assess the level of lean implementation in Indian manufacturing companies. A questionnaire was developed for the goal of collecting data, and industry experts were contacted personally and questioned. According to this study, common implementation of lean practices leads to a reduction of 68% in setup loss, 70% in setup time, 17% in energy consumption, 11% in electricity consumption, 51% in lead time, and an increase of 8.5 times in kaizen per team annually.</p>

2025-06-17T00:00:00+00:00 Copyright (c) 2025 Journal of Graphic Era University