A new multicommodity flow model for the job sequencing and tool switching problem

Full text
Author(s):	da Silva, Tiago Tiburcio ^[1] ; Chaves, Antonio Augusto ^[1] ; Yanasse, Horacio Hideki ^[1] Total Authors: 3
Affiliation:	^[1] Univ Fed Sao Paulo, Sao Jose Dos Campos - Brazil Total Affiliations: 1
Document type:	Journal article
Source:	INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH; v. 59, n. 12, p. 3617-3632, JUN 18 2021.
Web of Science Citations:	2
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 an 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. (AU)

FAPESP's process:	16/01860-1 - Cutting, packing, lot-sizing, scheduling, routing and location problems and their integration in industrial and logistics settings
Grantee:	Reinaldo Morabito Neto
Support Opportunities:	Research Projects - Thematic Grants


FAPESP's process:	18/15417-8 - Development of a hybrid metaheuristic with adaptive control flow and parameters
Grantee:	Antônio Augusto Chaves
Support Opportunities:	Research Grants - Young Investigators Grants - Phase 2