We consider the uniform parallel machine scheduling problem with sequence-dependent setup times to minimize the total completion times. This problem is known to be NP-hard. We propose a simple randomized heuristic with an improvement subroutine. We analyze the performance of the proposed heuristic through a computational study. Our computational study indicates that the heuristic performs well in terms of optimality gap and solution time .
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.