Title :

Improved integer linear programming formulations for the job Sequencing and tool Switching Problem

Author(s) :

Catanzaro, Daniele [Auteur]
Université Catholique de Louvain = Catholic University of Louvain [UCL]
Labbé, Martine [Auteur]
Graphes et Optimisation Mathématique [Bruxelles] [GOM]
Integrated Optimization with Complex Structure [INOCS]
Gouveia, Luís [Auteur]
Centro de Investigação Operacional [CIO]

Journal title :

European Journal of Operational Research

Pages :

766–777

Publisher :

Elsevier

Publication date :

2015

ISSN :

0377-2217

HAL domain(s) :

Computer Science [cs]/Operations Research [math.OC]

English abstract : [en]

In this article we investigate the job Sequencing and tool Switching Problem (SSP), a NPNP-hard combinatorial optimization problem arising from computer and manufacturing systems. Starting from the results described in ...
Show more >In this article we investigate the job Sequencing and tool Switching Problem (SSP), a NPNP-hard combinatorial optimization problem arising from computer and manufacturing systems. Starting from the results described in Tang and Denardo (1987), Crama et al. (1994) and Laporte et al. (2004), we develop new integer linear programming formulations for the problem that are provably better than the alternative ones currently described in the literature. Computational experiments show that the lower bounds obtained by the linear relaxation of the considered formulations improve, on average, upon those currently described in the literature and suggest, at the same time, new directions for the development of future exact solution approaches.Show less >

Language :

Anglais

Peer reviewed article :

Oui

Audience :

Internationale

Popular science :

Non

Comment :

Language of publication: en

Collections :

• Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189

Source :

Harvested from HAL