Computational Study on Job Flow Shop Scheduling Using MiniMax Optimizing Algorithm

Author(s)	Margia Yesmin, Md. Abdul Alim
Country	Bangladesh
Abstract	Shop scheduling is a critical part of manufacturing systems. The goal is to find an efficient schedule that optimizes system performance. Finding a feasible schedule becomes more difficult as the number of jobs and machines increases. The present research aims to study the computational study of different optimization methods to solve job flow shop scheduling problems. This paper reviews computational research of varying optimization methods to solve job flow shop scheduling problems. We discuss Johnson's algorithm, Campbell, Dudek, and Smith's (CDS) Approach, and Gantt chart and propose a Minimax optimization. This new method has the least processing time in the machine in the current situation. We present substantial computational results using MiniMax optimization techniques. From the result, we can conclude that the proposed algorithm gives less processing time and more frequently an optimal schedule than the other studied methods.
Keywords	Job flow shop scheduling, Johnson's algorithm, CDS Approach, Gantt chart, MiniMax Optimizing algorithm
Field	Mathematics
Published In	Volume 6, Issue 6, November-December 2024
Published On	2024-12-31
DOI	https://doi.org/10.36948/ijfmr.2024.v06i06.34085
Short DOI	https://doi.org/g8xgn8

About IJFMR Fees & Payment Current Issue Publication Archive	Submit Research Paper Track Submission Status Publication Guidelines Publication Ethics Peer Review & Plagiarism	Join as a Reviewer Editors & Reviewers Reviewer Referral Program Get Reviewer Membership Certi.	Website/Journal Policies Usage Policy Content Policies Privacy Policy

Contact Us		+91-9687-828-838	editor@ijfmr.com

International Journal For Multidisciplinary Research