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

Imed Kacem, Cherif Sadfi, Abdelkader El Kamel

Browse the full SMC paper archive.