A new lower bound for the two-machine total tardiness flow shop scheduling problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

A new lower bound for the two-machine total tardiness flow shop scheduling problem

Résumé

We consider the classical two machine flow shop scheduling problem, with total tardiness criterion. This problem is strongly NP-hard and literature contains already some lower bounds and dominance conditions. The more recent lower bound of the literature is due to Pan Chen and Chao (COR 2002) and is an improvement of the lower bound proposed by Pan and Fan (IJSE, 1997), Kim (COR 1993) and Sen Dileepan and Gupta (COR 1989). We propose here a new lower bound. Computational experiments show that this bound allows to obtain better results, both in terms of generated nodes and computation time.
Fichier non déposé

Dates et versions

hal-01048625 , version 1 (25-07-2014)

Identifiants

  • HAL Id : hal-01048625 , version 1

Citer

Jean-Charles Billaut. A new lower bound for the two-machine total tardiness flow shop scheduling problem. 21st European Conference on Operational Research, Jul 2006, Reykjavic, Iceland. pp.136. ⟨hal-01048625⟩
40 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More