Flowshop scheduling problem with objective of minimizing TCT
*R. DurgadeviCorresponding authordurgadevi.apagri@gmail.comDepartment of Mathematics Arignar Anna Government Arts College Cheyyar 604407 Tamil Nadu IndiaView full profile → , S. Jayakumarsundarajayakumar@gmail.comDepartment of Mathematics Arignar Anna Government Arts College Cheyyar 604407 Tamil Nadu IndiaView full profile → , R. Vijayaragavanrvijayaraagavantvu@gmail.comDepartment of Mathematics Thiruvalluvar University Vellore Tamil Nadu IndiaView full profile →
* Corresponding author · click or hover a name for details
- Published Online:
- 31 Jan 2023
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JIM-1641
- Pages:
- 1–10
Abstract
Keywords
Subject Classifications
References
[1] Dannenbring D, “An evolution of flow shop scheduling heuristics”, Manage Science, 23(11), 1174-1182, (1977).
[2] Gupta J N D, “A functional heuristic for the flow shop scheduling problem”, Operational Research Quartely, 22, 39-47, (1971).
[3] Johnson S M , “Optimal two and three stage production schedules with setup times included”, Naval Research Logist Quartely, 1(1), 61-68, (1954).
[4] Jayakumar S, Meganathan R and Sathiya Shanthi R, “An Heuristic Approach for Solving two machine n-job flow shop scheduling problem with makespan objective”, IOSR Journal of Mathematics, 12(3), 23-26, (2016).
[5] Jayakumar Sundaramoorthy, Meganathan Rangaraji, Sathiya Santhi, “An Heuristic Approach for Solving permutation flow shop scheduling problem”, International Journal of Emerging Technology and advanced Engineering, 6(4) , 144-146, (2019).
[6] Jayakumar S and Vasudevan G, “Heuristic algorithm for permutation flow shop scheduling”, International Journal of Technology, 9(1), 5-7, (2019).
[7] Jayasankari S, Jayakumar S and Vijayaragavan R, “An efficient Flow shop Scheduling Problem with Makespan Objective”, Turkish Journal of Computer and Mathematics Education, 12(4), 461-466, (2021).
[8] Palmer D S, “Sequencing jobs through a multi-stage process in the minimum total time – a quick method to do obtaining a near optimum”, Operational research quartly,16(1), 101-107, (1965).
[9] Vasudevan G, Jayakumar S and Sathya Shanthi R , “A better heuristic approach for n-job m- machine flow shop scheduling problem”, Journal of Computational Mathematica, 4(1), 118-124, (2020) .
[10] Vasudevan G and Jayakumar S, “The heuristic algorithm for flow shop scheduling problem with TET objective”, Malaya Journal of Matematik, 8(4), 2071-2073, (2020).
[11] Vasudevan G and Jayakumar S, “An algorithm for solving n-job m-machine flow shop scheduling problem with objective of minimizing makespan”, International Journal of Advanced Research in Engineering and Technology (IJARET), 11(11), 1203-1207, (2020).
[12] Chang-Mingji, Hao Wu and Chuan-Gang Li, “Optimal scheduling system for reservoir electric power generation based on functional dynamic programming algorithm”, Journal of Interdisciplinary Mathematics, 21(5), 1267-1272, (2018).
[13] Xin-jun Li and Jian-jun Wang,”Parallel machines scheduling based on the impact of deteriorating maintenance”, Journal of Interdisciplinary Mathematics, 21(3), 729-741, (2018).
[14] Yahui Wang, Liuqiang Fu, Yongqiang Su, Qian Yang and Linfeng Wu, “Genetic algorithm in flexible workshop scheduling based on multi-objective optimization”, Journal of Interdisciplinary Mathematics, 21(5), 1249-1254, (2018).
