Malaysian Journal of Mathematical Sciences, September 2022, Vol. 16, No. 3
Bi-Objective Flow Shop Scheduling with Equipotential Parallel Machines
Malhotra, K., Gupta, D., Goel, S., and Tripathi, A. K.
Corresponding Email: sonia.mangla14@gmail.com
Received date: 11 October 2021
Accepted date: 22 June 2022
Abstract:
Scheduling is very important concept in each and every field of life especially in case of manufacturing
process. Actually, a production schedule is the time table that tells the time at which
an assignment will be processed on various machines. The Schedule also gives the information
about starting and finishing of a work on one machine. This paper also deals with the theory of
Scheduling. The main attraction of this study is the optimization done on like Parallel machines
with the help of Fuzzy Processing Times. Here the problem of optimization on Two Stage Flow
Shop Model has been taken into consideration. This paper reveals an algorithm using Branch
and bound method for scheduling on three like parallel machines available at initial stage and
solo machine at next stage having processing period of all works as fuzzy triangular numbers
involving transportation time from first stage to second stage. Algorithm provides an optimal
sequence of jobs for minimizing make span as well as the unit operational cost of each job on all
three parallel machines. Numerical example has also been discussed for elaborating this situation.
The proposed model is the extension of model presented by Deepak Gupta and Sonia Goel
[18].
Keywords: scheduling; parallel machines; fuzzy triangular number;branch and bound; make span
