Indian Journal of Science and Technology

Abstract

Objectives: In this paper, we consider the Flexible Flowshop Scheduling (FFS) problem with parallel machines. The main objective of this paper is to obtain a good schedule of jobs to minimize the makespan of FFS problem. Methods/Statistical analysis: In this study, two heuristic algorithms have been developed of FFS to reduce the makespan. First, we constructed the new heuristic algorithm based on Minimum Processing Time Selective Approach (MPTSA) and Longest Processing Times (LPT) approach to find the optimal or near optimal sequence for minimization of makespan of FFS problem with parallel machines. Next, we developed the heuristic algorithm using PALMER approach. In the PALMER approach we sequence the jobs based on Longest Slope Value (LSV) and obtained the value of objective function. Findings: We compared both the heuristic algorithms with the help of numerical illustrations. We solved the same numerical by both the heuristic algorithm and result show that our constructed heuristic algorithm has resulted in a better industrial production makespan. The percentage improvement of our constructive heuristic algorithm is also calculated. Gantt chart is also generated to verify the effectiveness of constructed heuristic algorithm. Application/Improvements: Our constructed heuristic algorithm is more effective to reduced the makespan of FFS problems as compare to classic heuristic algorithm as Palmer approach and provide an important tool for decision makers in production management.

Keywords: Flexible Flowshop Scheduling, Gantt Chart, LPT Approach, Makespan, MPTSA Approach, Parallel Machines, Percentage Improvement