COMPARATIVE ANALYSIS OF FLOW SHOP SCHEDULING FOR N-JOBS AND M-MACHINES | Asian Journal of Mathemati

One of the most commonly encountered scheduling problems in the literature is the flow shop scheduling problem (FSSP). Scheduling to improve capacity utilisation efficiency, lowering the time necessary to complete jobs and, as a result, enhancing an organization's profitability in today's global competitive climate. Scheduling is the process of balancing the load on a system, ensuring equal distribution of resources, and assigning some priority based on set criteria that govern our day-to-day actions. There are several production scheduling systems, including flow shops, in which jobs are processed through a sequence of equipment in order to optimise a variety of precondition measures. The goal of the FSSP is to discover the optimum sequence that minimises several objectives such as makespan, idle time, tardiness, flow time, and work in progress. Traditional approaches to scheduling problems based on priority principles still produce schedules with considerable idle hours. This study models the problem of flowshop scheduling with the goal of optimising these. Scheduling is done to balance the load on the system, ensure equitable resource allocation, and give some prioritisation according to specified rules, all with the goal of reducing the time to completion. The work weightage and processing times are both known and identical. Two test case studies are conducted using the literature's 16 jobs, 6 machines and 17 jobs, 5 machines problems. The two test cases are solved using a metaheuristic technique in MATLAB 2014. Some metaheuristic algorithms were selected and tested separately against the challenge. To determine the best optimum makespan, they were compared. The results reveal that one of the algorithms is capable of generating an optimal or near-optimal solution.

Please see the link :- https://www.ikprress.org/index.php/AJOMCOR/article/view/996