Empirical improvements of a dynamic scheduling engine in an industrial environment

This paper introduces the results of a series of empirical improvements performed on a basic algorithm addressing the Flow Shop Scheduling Problem in an industrial environment. Metaheuristic methods are followed to enhance the time and the quality of the initial solution produced by the scheduling engine of an industrial platform in order to obtain a rather acceptable initial schedule. Thereafter, several boosts have been achieved in order to accelerate the convergence towards an optimum solution besides the reduction of processing time and memory allocation. Further research work is required to improve resource assignation by making it more efficient and reasonable and to optimize memory allocation so that the current scheduling engine becomes more scalable and updatable.