Branch and Bound and Dynamic Programming to Minimize the Total Completion Times on a Single Machine with Availability Constraints - Université de technologie de Troyes Access content directly
Conference Papers Year : 2005

Branch and Bound and Dynamic Programming to Minimize the Total Completion Times on a Single Machine with Availability Constraints

Abstract

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.
No file

Dates and versions

hal-02491598 , version 1 (26-02-2020)

Identifiers

Cite

Imed Kacem, Cherif Sadfi, Abdelkader El Kamel. Branch and Bound and Dynamic Programming to Minimize the Total Completion Times on a Single Machine with Availability Constraints. 2005 IEEE International Conference on Systems, Man and Cybernetics, Oct 2005, Waikoloa, United States. pp.1657-1662, ⟨10.1109/ICSMC.2005.1571386⟩. ⟨hal-02491598⟩
14 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More