Exact algorithms for the job sequencing and tool switching problem

被引：48

作者：

Laporte, G

Salazar-González, JJ

Semet, F

机构：

[1] Univ Montreal, Ctr Rech Transports, Montreal, PQ H3C 3J7, Canada

[2] Univ La Laguna, Fac Matemat, Dept Estad Invest Operat & Computac, Tenerife 38271, Spain

[3] Univ Valenciennes & Hainaut Cambresis, LAMIH, Bur 85, F-59313 Valenciennes 9, France

来源：

IIE TRANSACTIONS | 2004年 / 36卷 / 01期

基金：

加拿大自然科学与工程研究理事会;

关键词：

D O I：

10.1080/07408170490257871

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

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.

引用

页码：37 / 45

页数：9

共 25 条

[1] Tool magazine arrangement and operations sequencing on CNC machines [J].