Given the characteristics of the flexible job-shop scheduling problem and the practical production of a given enterprise. a flexible job-shop scheduling model was proposed to minimize the maximum completion time. A novel algorithm was proposed to solve the model by integrating the dung beetle optimization algorithm and the simulated annealing algorithm. Algorithmic improvements includ... https://www.randdsoftindonesia.com/product-category/product-type/