A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem

Abstract

In this paper, a local-best harmony search (HS) algorithm with dynamic sub-harmony memories (HM), namely DLHS algorithm, is proposed to minimize the total weighted earliness and tardiness penalties for a lot-streaming flow shop scheduling problem with equ