Quanke PanM. Fatih TasgetirenPonnuthurai Nagaratnam SuganthanYunchia Liang2025-10-062010978142446910910.1109/CEC.2010.5586199https://www.scopus.com/inward/record.uri?eid=2-s2.0-79959413226&doi=10.1109%2FCEC.2010.5586199&partnerID=40&md5=5ff29ed281b6b5b1f45b25a0ad51642ahttps://gcris.yasar.edu.tr/handle/123456789/10271The harmony search (HS) algorithm is one of the recent evolutionary computation techniques to solve optimization problems. To make it applicable for lot-streaming flow shop problems a discrete variant of the HS algorithm (DHS) with job permutations representation is proposed. In the proposed DHS algorithm a new improvisation scheme is designed to generate feasible job sequences. A local search algorithm based on the insert neighborhood structure is fused to stress the further enhancement capability of the algorithm proposed whereas a restart scheme is employed to avoid the stagnation of the evolution. Extensive computational simulations and comparisons are provided which demonstrate the effectiveness of the proposed DHS against the best performing algorithms from the literature. © 2010 IEEE. © 2011 Elsevier B.V. All rights reserved.EnglishComputational Simulation, Evolutionary Computation Techniques, Harmony Search, Harmony Search Algorithms, Hs Algorithm, Insert Neighborhood, Job Sequences, Local Search Algorithm, Lot-streaming Flow Shops, Optimization Problems, Calculations, Hydraulic Structures, Learning Algorithms, Machine Shop Practice, Problem Solving, Evolutionary AlgorithmsComputational simulation, Evolutionary computation techniques, Harmony search, Harmony search algorithms, HS algorithm, Insert neighborhood, Job sequences, Local search algorithm, Lot-streaming flow shops, Optimization problems, Calculations, Hydraulic structures, Learning algorithms, Machine shop practice, Problem solving, Evolutionary algorithmsConference Object