On both manufacturing and services, one can easily verify the complexity of the decision process of production systems, looking for improvement on indicators such as quality, cost and time. Mostly of the scheduling problems are considered as NP-Hard, imposing difficulties on the usage of exact methods. The problem of sequence jobs into a single machine environment with sequence-dependent setup times is an example of a NP-Hard problem. Aiming to allow decisions in shorter computational time, a significant set of the literature investigates the usage of algorithms to solve those problems. This project proposes to investigate, design and implement heuristic and local search methods to create viable solutions for this problem.
News published in Agência FAPESP Newsletter about the scholarship: