By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Bettayeb, B. ; ISTIT-OSI, Univ. de Technologie de Troyes ; Kacem, I. ; Adjallah, K.H.

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

Published in:

Computational Engineering in Systems Applications, IMACS Multiconference on  (Volume:1 )

Date of Conference:

4-6 Oct. 2006