Improved integer linear programming formulations for the job Sequencing and tool Switching Problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue European Journal of Operational Research Année : 2015

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

Résumé

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.
Fichier non déposé

Dates et versions

hal-01255516 , version 1 (13-01-2016)

Identifiants

Citer

Daniele Catanzaro, Martine Labbé, Luís Gouveia. Improved integer linear programming formulations for the job Sequencing and tool Switching Problem. European Journal of Operational Research, 2015, 244 (3), pp.766-777. ⟨10.1016/j.ejor.2015.02.018⟩. ⟨hal-01255516⟩
137 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More