Jiaxin FanDamla KizilayHande OztopKizilay, DamlaOztop, HandeFan, Jiaxin2025-10-062019978-1-7281-2485-89781728124858https://gcris.yasar.edu.tr/handle/123456789/7621This paper is concerned with solving the single machine scheduling problem with release dates and sequence-dependent setup times in order to minimize the makespan. For this purpose a variable block insertion heuristic (VBIH) algorithm is applied to the problem. The VBIH algorithm performs block moves on a given solution. Mainly it removes a block of jobs with a given size from the solution and inserts the block into the best position of the partial solution. Furthermore we present a novel profile-fitting constructive heuristic for the problem. We evaluate the performance of the VBIH algorithm by comparisons with the beam search heuristic and the iterated greedy algorithm from the literature. Extensive computational results on the benchmark suite consisting of 900 instances from the literature show that the proposed VBIH algorithm is very competitive to the recent beam search heuristic and iterated greedy algorithm from the literature.Englishinfo:eu-repo/semantics/closedAccesssingle machine scheduling, release dates, sequence-dependent setup times, variable block insertion heuristic, profile-fitting heuristicTOTAL WEIGHTED TARDINESS, FLOWSHOP SCHEDULING PROBLEM, ALGORITHMS, SEARCHSingle Machine SchedulingRelease DatesSequence-Dependent Setup TimesVariable Block Insertion HeuristicProfile-Fitting HeuristicConference Object