Hide/Show Apps

Operational fixed interval scheduling problem on uniform parallel machines

2008-04-01
Bekki, Oezguen Baris
Azizoğlu, Meral
In this study, we address an operational fixed interval scheduling problem on uniform parallel machines. Our objective is to maximize the total weight of the jobs processed. We show that the problem is NP-hard in the strong sense and develop polynomial time algorithms for some special cases. We propose a branch and bound algorithm that employs dominance conditions and tight bounds. The results of our computational tests have revealed that the algorithm returns optimal solutions for problem instances with up to 70 jobs very quickly. (C) 2007 Elsevier B.V. All rights reserved.