Learn More
Most scheduling problems are complex combinatorial problems and very difficult to solve [Manage. is why, lots of methods focus on the optimization according to a single criterion (makespan, workloads of machines, waiting times, etc.). The combining of several criteria induces additional complexity and new problems. In this paper, we propose a Pareto(More)
The problem of efficiently scheduling production jobs on several machines is an important consideration when attempting to make effective use of a multi-machines system such as a flexible job shop scheduling production system (FJSP). In most of its practical formulations, the FJSP is known to be NP-hard [8][9], so exact solution methods are unfeasible for(More)
Most complex scheduling problems are combinatorial problems and difficult to solve. That is why, several methods focus on the optimization according to a single criterion such as makespan, workloads of machines, waiting times, etc. In this paper, the Choquet integral is introduced as a general tool for dealing with multiple criteria decision making and used(More)
— The PDPTW is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers satisfying precedence, capacity and time constraints. We present, in this paper, a genetic algorithm for multi-objective optimization of a dynamic multi pickup and delivery problem with time windows (Dynamic m-PDPTW). We propose a(More)
The multimodel approach was recently developed to deal with the issues of complex processes modeling and control. Despite its success in different fields, it still faced with some design problems, and in particular the determination of the models and of the adequate method of validities computation. In this paper, we propose a neural approach to derive(More)