Scheduling of a single machine to minimize total weighted completion time subject to release dates

Abstract

Abstract In this paper the n /1/ r j Σ j w j C j problem under the assumptions of nonpreemptive sequencing and sequence independent processing times is investigated. After pointing out the fundamental properties, some dominance sufficient conditions among sequences are obtained and a branch and bound algorithm is proposed. Computational results are reported and discussed.