By Topic

Branch and bound and dynamic programming to minimize the total completion times on a single machine with availability constraints

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)
Kacem, I. ; ISTIT-OSI, Univ. de Technologie de Troyes, France ; Sadfi, C. ; El-Kamel, A.

In this paper we consider the single machine scheduling problem with availability constraints in order to minimize the total completion times of jobs. We propose two exact approaches to solve the problem: a dynamic programming and a branch and bound method. The study of these approaches is carried out in this article and a concluding analysis based on several experimental results allows us to select the most suitable method according to the studied instance.

Published in:

Systems, Man and Cybernetics, 2005 IEEE International Conference on  (Volume:2 )

Date of Conference:

10-12 Oct. 2005