COMPARATIVE ANALYSIS OF FLOW SHOP SCHEDULING FOR N-JOBS AND M-MACHINES

Purchase PDF

Published: 2018-03-14

Page: 13-21


DHIREN KUMAR BEHERA *

Indira Gandhi Institute of Technology, Sarang, Odisha, India.

SITAL KUMAR SARANGI

Indira Gandhi Institute of Technology, Sarang, Odisha, India.

S. A. OHID

Indira Gandhi Institute of Technology, Sarang, Odisha, India.

*Author to whom correspondence should be addressed.


Abstract

Flow shop scheduling problem (FSSP) is one of the most observed scheduling problems in literature. Scheduling to increase in capacity utilization efficiency and thus reducing the time required to complete jobs and subsequently increasing the profitability of an organization in contemporaneous competitive environment across the globe. Scheduling is the plan done to balance the load on the system and ensure equivalent distribution of resources and give some prioritization according to set rules prevailed in our day to day activities. There are varieties systems of production scheduling including flow shop in which jobs are to be processed through series of machines for optimizing number of prerequisite measures. The aim of FSSP is to find best sequence which minimizes the different objectives like makespan, idle time, tardiness, flow time and work in process. Orthodox methods of solving scheduling problems based on priority rules still results in schedules, sometimes with significant idle times. To optimize these, this paper models the problem of a flowshop scheduling with the Scheduling is done to balance the load on the system and ensure equal distribution of resources and give some prioritization according to set rules with a motive of minimizing the makespan. The processing times and the job weightage are known and identical. Two test case studies are done using 16 jobs, 6 machines problem and 17 jobs, 5 machines problem from literature. Metaheuristic approach is taken to solve the two test cases using MATLAB 2014. Some metaheuristic algorithms were taken and tested against the problem separately. They were compared to find out the best optimum makespan. The results show that one of the offered algorithms is efficient in producing optimal or near optimal solution.

Keywords: Flow shop scheduling, makespan, meta-heuristics, SA, GA, PSO


How to Cite

BEHERA, D. K., SARANGI, S. K., & OHID, S. A. (2018). COMPARATIVE ANALYSIS OF FLOW SHOP SCHEDULING FOR N-JOBS AND M-MACHINES. Asian Journal of Mathematics and Computer Research, 24(1), 13–21. Retrieved from https://ikprress.org/index.php/AJOMCOR/article/view/996

Downloads

Download data is not yet available.