A new multicommodity flow model for the job sequencing and tool switching problem
| dc.contributor.author | Chaves, Antonio Augusto [UNIFESP] | |
| dc.contributor.author | Silva, Tiago Tiburcio da [UNIFESP] | |
| dc.contributor.author | Yanasse, Horacio Hideki [UNIFESP] | |
| dc.contributor.authorLattes | http://lattes.cnpq.br/4973949421738244 | |
| dc.date.accessioned | 2024-05-24T13:45:48Z | |
| dc.date.available | 2024-05-24T13:45:48Z | |
| dc.date.issued | 2021 | |
| dc.description.abstract | 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. | |
| dc.identifier | http://dx.doi.org/10.1080/00207543. 2020.1748906 | |
| dc.identifier.doi | 10.1080/00207543. 2020.1748906 | |
| dc.identifier.uri | https://hdl.handle.net/11600/71139 | |
| dc.language | eng | |
| dc.publisher | Taylor and Francis Online | |
| dc.relation.ispartof | International Journal Of Production Research | |
| dc.rights | Acesso restrito | |
| dc.subject | combinatorial optimization | |
| dc.subject | job sequencing and tool switching | |
| dc.subject | multicommodity flow | |
| dc.subject | integer programming | |
| dc.subject | linear programming relaxation | |
| dc.title | A new multicommodity flow model for the job sequencing and tool switching problem | |
| dc.type | Artigo | |
| unifesp.campus | Instituto de Ciência e Tecnologia (ICT) | |
| unifesp.departamento | Ciência e Tecnologia | |
| unifesp.graduacao | Não se aplica | |
| unifesp.graduateProgram | Pesquisa Operacional |