Vol. 5 No. 2 (2021): Vol 5, Iss 2, Year 2021
Solving flow shop scheduling problems with the objective of minimizing TCT when tie occurs
Published October 20, 2021
- Flow shop scheduling problem, two machines, total completion time
How to Cite
R, S. S., R, M., S, J., & R, V. (2021). Solving flow shop scheduling problems with the objective of minimizing TCT when tie occurs. Journal of Computational Mathematica, 5(2), 1 - 8. https://doi.org/10.26524/cm102
Scheduling process arises naturally upon availability of resources through a systematic approach in which prior planning and decisions should be made. Two machine flow shop scheduling problem (FSSP) was solved by Johnson in the mid of 1954 with makespan minimization as objective. Earlier we proposed two algorithms for the makespan objective; in this paper we intend to investigate the same algorithms for the objective of Total Completion Time of all the jobs (TCT). Experimental results had shown that one of our algorithms gives better results than the other two when the machine order is reversed.
Download data is not yet available.