Solving the job sequencing and tool switching problem as a nonlinear least cost Hamiltonian cycle problem

Torna indietro

Abstract

In the Job Sequencing and Tool Switching Problem (SSP) a number of part types, each requiring a set of tools, are to be manufactured on a single flexible machine with a capacitated tool magazine. The SSP aims at determining the processing sequence as well as the tools present in the magazine for each part, in order to minimize the total number of tools switches. In this paper, we cast the SSP as a nonlinear least cost Hamiltonian cycle problem. A branch-and-cut algorithm is proposed and compared to previous exact procedures. Computational results indicate that the algorithm is able to solve much larger instances than those reported in the literature.

Autore Pugliese

Tutti gli autori

  • G. GHIANI , A. GRIECO , E. GUERRIERO

Titolo volume/Rivista

NETWORKS

Anno di pubblicazione

2010

ISSN

0028-3045

ISBN

Non Disponibile

Numero di citazioni Wos

Nessuna citazione

Ultimo Aggiornamento Citazioni

Non Disponibile

Numero di citazioni Scopus

6

Ultimo Aggiornamento Citazioni

28/04/2018

Settori ERC

Non Disponibile

Codici ASJC

Non Disponibile