Exact Algorithms for the Job Sequencing and Tool Switching Problem

, et

référence BibTeX

The Job Sequencing and Tool Switching Problem (SSP) involves optimally sequencing jobs and assigning tools to a capacitated magazine in order to minimize the number of tool switches. This article analyzes two integer linear programming formulations for the SSP. A branch-and-cut algorithm and a branch-and-bound algorithm are proposed and compared. Computational results indicate that instances involving up to 25 jobs can be solved optimally using the branch-and-bound approach.

, 16 pages

Axe de recherche

Application de recherche


Exact algorithms for the job sequencing and tool switching problem
, et
IIE Transactions, 36(1), 37–45, 2004 référence BibTeX