Application of tabu search, TS, to solve a flow shop scheduling problem with changeover times in operations: A case study
Article Sidebar
| flow shop scheduling problems |
| tardiness time |
| changeover times |
| tabu search |
| mega heuristic |
Main Article Content
Abstract
Flow Shop Scheduling (FSS) Problems are NP-hard combinatorial optimization problems. It is quite difficult to achieve an optimal solution for FSS problems with mathematical modelling approaches because of its NP-hard structure. Tabu search (TS), a mega-heuristic algorithm, plays a major role in searching for near-optimal solutions for NP-hard optimization problems. This paper develops a TS model for solving a FSS problem with the objective to reduce total weighted tardiness time, and constraint on changeover time in operations. The performance of the TS model is compared with that of traditional EDD heuristics, being used. The result shows that the objective value has been reduced by 43%, from 215.95 to 123.07 (h). It indicates that the TS model is a good approach for FSS problems.
Article Details
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgment of the work’s authorship and initial publication in this journal.
This has been implemented from Jan 2024 onwards