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

Belgacem Bettayeb 1 Imed Kacem 2 Kondo Hloindo Adjallah 1
1 LOSI - Laboratoire d'Optimisation des Systèmes Industriels
ICD - Institut Charles Delaunay
2 LCOMS - Laboratoire de Conception, Optimisation et Modélisation des Systèmes
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
Keywords : Family setup times Frequency Costs Lagrangian functions Scheduling Branch and bound Identical parallel machines Job production systems Processor scheduling Systems engineering and theory Noise measurement Parallel machines Job shop scheduling Scheduling algorithm
Document type :
Conference papers
Complete list of metadata
https://hal-utt.archives-ouvertes.fr/hal-02490601
Contributor : Daniel Gavrysiak Connect in order to contact the contributor
Submitted on : Tuesday, February 25, 2020 - 12:25:51 PM
Last modification on : Thursday, September 30, 2021 - 6:26:02 PM

Identifiers

Collections

UNIV-LORRAINE | LCOMS-UL | UTT | CNRS

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⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

71