By Topic

A branch-and-bound algorithm for minimizing the total completion time in two-machine flowshop problem subject to release dates

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

2 Author(s)
Rakrouki, M.A. ; Fac. des Sci. Juridiques, Economiques et de Gestion de Jendouba, Jendouba, Tunisia ; Ladhari, T.

In this paper, we consider the problem of minimizing the sum of completion times in a two-machine permutation flowshop subject to release dates. We present several variants of a branch-and-bound algorithm for the problem under consideration. Computational experiments on a large set of randomly generated instances show that problems up to 30 (70, and 100) job problems when release dates are uniformly distributed in the [1, 100] and [1, 200] ([1, 100 n], [1, 200n]) range can be solved in a reasonable CPU time.

Published in:

Computers & Industrial Engineering, 2009. CIE 2009. International Conference on

Date of Conference:

6-9 July 2009