Flexible Job Shop Scheduling using Software
Prathipati Nikhil1, K.N.Phanindra2, P.Venkata Chalapathi3, Mohammed Ikram4, B.Akhi5
1Prathipati Nikhil*, B. Tech, KL deemed to be university in INDIA
2K.N.Phanindra, B.Tech, Kluniversity, india
3P. Venkata Chalapathi, Professor in KL deemed to be University, received B.Tech in Mechanical Engineering from Acharya Nagarjuna University
4Mohammed Ikram, B. Tech in Mechanical engineering at KL deemed to be University.
5B.Akhil, B.Tech, KL deemed to be University.
Manuscript received on February 01, 2020. | Revised Manuscript received on February 05, 2020. | Manuscript published on February 30, 2020. | PP: 67-70 | Volume-9 Issue-3, February, 2020. | Retrieval Number: B3430129219/2020©BEIESP | DOI: 10.35940/ijeat.B3430.029320
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: This present paper speaks about Flexible Job Shop scheduling Problem using a software. Flexible Job shop scheduling is most typical and complex manufacturing environments in production planning issues. A case study was conducted on a manufacturing business set in Vijayawada. Information collected from the producing company to get the time taken by the conventional scheduling method and gathered data for 5 jobs requiring 8 machines that arrived during the analysis period. The Project additionally speaks about the study of varied programming strategies, learning of LEKIN programming package is a software tool has a flexibility to develop new heuristic models to produce effective schedules be applied practically. Input data, taken from the manufacturing company, converted to tables and routing sequences. The LEKIN programming package , develops the different schedules for given data with reference to priority rules, such as First Come First Serve (FCFS), Longest Processing Time (LPT), Shortest Processing Time (SPT), Earliest Due Date (EDD), Critical Ratio (CR) . The schedules obtained from priority rules analysed through performance measures like Make Span, No of late jobs, Total Flow Time, Total Tardiness, Maximum Tardiness, Total Weighted Tardiness, Total Weighted Flow Time. Our goal is to come up with a optimized schedule with in the process of flexible job shop scheduling by using LEKIN scheduling software, using various priority rules as mentioned above and to minimize the make span i.e. the time length of the schedule, during which all the operations for all jobs is completed in an engineering company.
Keywords: Flexible job shop scheduling, dispatching rules, performance measures, simulation on software.