Beste YildizLevent KandillerAyhan Ozgur ToyYıldız, BesteKandiller, LeventToy, Ayhan ÖzgürNM DurakbasaMG Gencyilmaz2025-10-062022978-3-030-90421-0, 978-3-030-90420-3978303090420397830309042102195-43562195-436410.1007/978-3-030-90421-0_692-s2.0-85119858187http://dx.doi.org/10.1007/978-3-030-90421-0_69https://gcris.yasar.edu.tr/handle/123456789/5786https://doi.org/10.1007/978-3-030-90421-0_69We 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 timeEnglishinfo:eu-repo/semantics/closedAccessParallel machine scheduling, Sequence-dependent setup time, Full factorial design, Randomized heuristic, Uniform machines, Total completion timesMETAHEURISTIC ALGORITHMFull Factorial DesignParallel Machine SchedulingTotal Completion TimesSequence-Dependent Setup TimeRandomized HeuristicUniform MachinesConference Object