Title of article
Exact Algorithms for the Job Sequencing and Tool Switching Problem
Author/Authors
Gilbert، Laporte, نويسنده , , José، Salazar-Gonz?lez, Juan نويسنده , , Frédéric، Semet, نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
-36
From page
37
To page
0
Abstract
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.
Keywords
classification and confirmation , Analysis of fitting ridge models with linear and nonlinear regression , Use of the linear regression models , Method of ridge identification , Canonical form and rising ridges
Journal title
IIE TRANSACTIONS
Serial Year
2004
Journal title
IIE TRANSACTIONS
Record number
7923
Link To Document