Beste YıldızLevent KandillerAyhan Özgür ToyN.M. Durakbasa , M.G. Gençyılmaz2025-10-0620229789819650583, 9783031991585, 9783031948886, 9789819667314, 9789811937156, 9783030703318, 9789811622779, 9789811969447, 9789819701056, 978981974805121954364, 2195435610.1007/978-3-030-90421-0_69https://www.scopus.com/inward/record.uri?eid=2-s2.0-85119858187&doi=10.1007%2F978-3-030-90421-0_69&partnerID=40&md5=1a5c6cc0489dc7fe944f1c656537df31https://gcris.yasar.edu.tr/handle/123456789/8856We 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. © 2022 Elsevier B.V. All rights reserved.EnglishFull Factorial Design, Parallel Machine Scheduling, Randomized Heuristic, Sequence-dependent Setup Time, Total Completion Times, Uniform Machines, Machinery, Computational Studies, Full Factorial Design, Np-hard, Parallel Machine-scheduling Problems, Parallel Machines Scheduling, Randomized Heuristics, Sequence-dependent Setup Time, Total Completion Time, Uniform Machine, Uniform Parallel Machine Scheduling, SchedulingMachinery, Computational studies, Full factorial design, NP-hard, Parallel machine-scheduling problems, Parallel machines scheduling, Randomized heuristics, Sequence-dependent setup time, Total completion time, Uniform machine, Uniform parallel machine scheduling, SchedulingConference Object