An improved branch and bound algorithm for solving the identical parallel machnmes scheduling problem with family setup times - Université de technologie de Troyes Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

An improved branch and bound algorithm for solving the identical parallel machnmes scheduling problem with family setup times

Résumé

This article investigates identical parallel machines scheduling with family setups. The objective function is the sum of the weighted completion times. We propose an efficient constructive heuristic and three complementary lower bounding methods that we incorporate in a branch-and-bound algorithm. The results obtained by the above algorithm are satisfactory and encouraging
Fichier non déposé

Dates et versions

hal-02490601 , version 1 (25-02-2020)

Identifiants

Citer

Belgacem Bettayeb, Imed Kacem, Kondo Hloindo Adjallah. An improved branch and bound algorithm for solving the identical parallel machnmes scheduling problem with family setup times. Multiconference on "Computational Engineering in Systems Applications, Oct 2006, Beijing, China. pp.1040-1046, ⟨10.1109/CESA.2006.4281800⟩. ⟨hal-02490601⟩
26 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More