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

Imed Kacem, Cherif Sadfi, Abdellcader El-Kamel. Branch and bound and dynamic programming to minimize the total completion times on a single machine with availability constraints. In Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, Waikoloa, Hawaii, USA, October 10-12, 2005. pages 1657-1662, IEEE, 2005. [doi]

Abstract

Abstract is missing.