The Heuristic algorithm for flow shop scheduling problem with TET objective

G. Vasudevan; S. Jayakumar

doi:10.26637/MJM0804/0126

Abstract

In this paper, we have focused our attention on minimizing the TET for solving flow shop scheduling. We have given a simple heuristic algorithm to solve the permutation flow shop scheduling problem. The analysis and result indicates that our algorithm performs better than the algorithms available in the literature. In fact our algorithm is simple and easy to use when compared with others.

Keywords:

Flow Shop, Heuristic, Total Elapsed Time, Scheduling, TET.

Mathematics Subject Classification:

Mathematics

Authors Imprint References Funding Related Articles Downloads

G. Vasudevan PG and Research Department of Mathematics, Arignar Anna Government Arts College, Cheyyar-604407, Tamil Nadu, India.
S. Jayakumar PG and Research Department of Mathematics, Arignar Anna Government Arts College, Cheyyar-604407, Tamil Nadu, India.

Pages: 2071-2073
Date Published: 01-10-2020
Vol. 8 No. 04 (2020): Malaya Journal of Matematik (MJM)

K. R. Baker, Introduction to Sequence and Scheduling, Wiley, 1974.

H. G. Campbell, R. A. Dudek and M. L. Smith, A heuristic algorithm for the $n$-job, mmachine sequencing problem. Management Science, 16(1970), B630-B637.

D. Dannenbring, An evolution of flow shop scheduling heuristics. Manage Science, 23(11)(1977), 1174-1182.

J. N. D. Gupta, A functional heuristic for the flow-shop scheduling problem, Operational Research Quarterly, 22(1971), 39-47.

S. Jayakumar, et. al., An Heuristic Approach for Solving two machine $n$-job flow shop scheduling problem with Makespan objective, IOSR journal of Mathematics, 12(3)(2016), 23-26.

S. Jayakumar, et. al., An Heuristic Approach for Solving Permutation Flow Shop Scheduling Problem, International Journal of Emerging Technology and advanced Engineering, 6(4)(2019), 144-146.

S. M. Johnson, Optimal two and three stage production schedules with setup times included, Naval Research Logist Quarterly, 1(1)(1954), 61-68.

${ }^{[8]}$ M. Nawaz, E. E. Enscore and I. Ham, A heuristic algorithm for the $m$-machine, $n$-job flow-shop sequencing problem, OMEGA, 11(1983), 91-95.

D. S. Palmer, Sequencing jobs through a multi stage process in the minimum total time - a quick method to obtaining a near optimum, Operational research quarterly, 16(1)(1965), 101-107.

A. K. Sahu, Efficient heuristics for scheduling tasks on a flow shop environment to optimize make span, National Institute of Technology, Rourkela, INDIA (2009).