Skip to Main content Skip to Navigation
Conference papers

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

Abstract : 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
Document type :
Conference papers
Complete list of metadatas

https://hal-utt.archives-ouvertes.fr/hal-02490601
Contributor : Daniel Gavrysiak <>
Submitted on : Tuesday, February 25, 2020 - 12:25:51 PM
Last modification on : Wednesday, February 26, 2020 - 2:03:07 AM

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

55