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

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.

Automated summary

A new multicommodity flow mathematical model for the Job Sequencing and Tool Switching Problem (SSP) is proposed, with computational tests showing better performance in execution time and solving optimization problems compared to existing literature models.