Author(s)

S. Fichera, V. Grasso, A. Lombardo & E. Lo Valvo

Abstract

This paper concerns Genetic Algorithms efficiency in solving the pure flow-shop scheduling problem. Different formulations of the crossover operator and setting of control parameters are investigated in order to obtain enhanced performances in the determination of minimum makespan schedules. A lower bound based ending criterion is also introduced to obtain computation fastening. 1 Introduction Heuristic scheduling algorithms have been extensively developed in the past four decades for improving the productive performances of production systems, in widely different fields of manufacturing where a set of different products requires an effective solution of the sequencing problem. The first attempts to develop Flow S

Keywords