Header menu link for other important links
X
A TLBO and a Jaya heuristics for permutation flow shop scheduling to minimize the sum of inventory holding and batch delay costs
Published in Elsevier Ltd
2018
Volume: 124
   
Pages: 509 - 522
Abstract
This paper deals with permutation flow shop scheduling problem in which an integrated cost model consisting of work-in-process inventory carrying cost and penalty cost due to batch delay is proposed. The objective is to obtain an optimum production schedule which minimizes the expected total cost per unit time of scheduling. To optimize the objective function, we apply two new metaheuristic optimization techniques namely TLBO (teaching-learning based optimization) and Jaya and two traditional algorithms: PSO (particle swarm optimization) and SA (simulated annealing). The problem is solved for several instances ranging from 8 jobs and 5 machines to 500 jobs and 20 machines. Computational results show that for small instances, all algorithms performed equally good when compared with the exact solution (total enumeration method). However, for medium and large size problems, enumeration method was unable to give the results in a reasonable computation time period. Therefore the results of all four algorithms are compared among themselves and found that Jaya outperforms all algorithms. However, for a few large instances, SA yields better results in less computation time as against other heuristics. The overall performance of all algorithms reveals that TLBO and Jaya have considerable potential to solve discrete combinatorial problems such as permutation flow-shop scheduling problems. © 2018 Elsevier Ltd
About the journal
Published in Elsevier Ltd
Open Access
no
Impact factor
N/A