Title :
An improved branch and bound algorithm for solving the identical parallel machnmes scheduling problem with family setup times
Author :
Bettayeb, B. ; Kacem, I. ; Adjallah, K.H.
Author_Institution :
ISTIT-OSI, Univ. de Technologie de Troyes
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 :
scheduling; tree searching; branch and bound algorithm; family setup times; identical parallel machines scheduling problem; lower bounding method; objective function; weighted completion time; Costs; Frequency; Job production systems; Job shop scheduling; Lagrangian functions; Noise measurement; Parallel machines; Processor scheduling; Scheduling algorithm; Systems engineering and theory; Branch and bound; Family setup times; Identical parallel machines; Scheduling;
Conference_Titel :
Computational Engineering in Systems Applications, IMACS Multiconference on
Conference_Location :
Beijing
Print_ISBN :
7-302-13922-9
Electronic_ISBN :
7-900718-14-1
DOI :
10.1109/CESA.2006.4281800
