Please use this identifier to cite or link to this item:
Title: Simulation and Modelling of Hybrid Heuristics Distribution Algorithm for Flow Shop Scheduling Problem to Optimize Makespan in an Indian Manufacturing Industry
Authors: Singh, Harpreet
Oberoi, Jaspreet Singh
Singh, Doordarshi
Keywords: Completion time;Genetic algorithm;Meta-heuristics;Non-permutation;Permutation;Sequence-based
Issue Date: Feb-2021
Publisher: NISCAIR-CSIR, India
Abstract: This study presents a heuristic formulation of the flow shop scheduling problem by the hybrid algorithm fitness function. The genetic algorithm is used to model the time-estimates such as makespan and completion time. This paper aims to optimize the sequence-independent and sequence-dependent time-estimates. The production scheduling parameters such as permutation, non-permutation, no-wait, tardiness, and several workstations are identified from a piston manufacturing industry, in Northern India. Different machine operating parameters were collected from the piston manufacturing industry to work on reducing the makespan. The MATLAB programming in heuristics algorithm distribution function resulted in a reduction of makespan of the product by five times. The reduced completion time is 23 minutes for the piston ring product and 26 minutes in the cumulative validation of the proposed model. The cumulative optimized standard error of 0.26; (n=3) simulate and synthesize the suggested model with its validation. The system efficiency through completion time optimization ranged from 70–82 percent in piston ring, and 63–89 percent in cumulative validation of the model has been worked out for each machine type. The data generated through system optimization helps the scientific world and entrepreneurs in the advancement of sequence-based transportation.
Page(s): 137-142
ISSN: 0975-1084 (Online); 0022-4456 (Print)
Appears in Collections:JSIR Vol.80(02) [February 2021]

Files in This Item:
File Description SizeFormat 
JSIR 80(2) 137-142.pdf890.59 kBAdobe PDFView/Open

Items in NOPR are protected by copyright, with all rights reserved, unless otherwise indicated.