Abstract
AbstractWe 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 .KeywordsParallel machine schedulingSequence-dependent setup timeFull factorial designRandomized heuristicUniform machinesTotal completion times
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
