| dc.description.abstract | This study undertakes a comparative analysis for solving the Flexible Flow
Shop Scheduling Problem (FFSP), with a practical application in the context of a
furniture manufacturing company in Vietnam, alongside a benchmark for the
flowshop scheduling problem. Three optimization approaches, namely CPLEX,
Simulated Annealing (SA), and Tabu Search (TS), are implemented with the
objective of minimizing both the makespan and total flow time. Benchmark
instances from the literature are employed to assess the solution quality and
computational efficiency of each method. CPLEX consistently provides optimal
or near-optimal solutions; however, it exhibits limitations in scalability. On the
other hand, Simulated Annealing and Tabu Search offer good-quality solutions
with reasonable computational times, making them viable alternatives for
handling large-scale instances. The study conducts comparisons and functions to
assess the robustness of each method concerning different problem parameters.
Overall, this research provides valuable insights into the performance and
effectiveness of these optimization techniques, facilitating the selection of the
most appropriate method for addressing the challenges posed by the FFSP.
Following the comparison between Mixed Integer Linear Programming (MILP),
Tabu Search, and Simulated Annealing, an implementation will be applied for a
larger dataset.. | en_US |
