A new multicommodity flow model for the job sequencing and tool switching problem
Carregando...
Arquivos
Data
2021
Autores
Chaves, Antonio Augusto [UNIFESP]
Silva, Tiago Tiburcio da [UNIFESP]
Yanasse, Horacio Hideki [UNIFESP]
Orientadores
Tipo
Artigo
Título da Revista
ISSN da Revista
Título de Volume
Resumo
In this paper a new multicommodity flow mathematical model for the Job Sequencing and Tool Switching Problem (SSP) is presented. The proposed model has a LP relaxation lower bound equal to the number of tools minus the tool machine’s capacity. Computational tests were performed comparing the new model with the models of the literature. The proposed model performed better, both in execution time and in the number of instances solved to optimality.