The Distributed Job shop Scheduling Problem (DJSP) deals with the assignment of jobs to factories geographically distributed and with determining a good operation schedule of each factory. The objective is to minimize the global makespan over all the factories. This paper is a first step to deal with the DJSP using three versions of a bio-inspired algorithm, namely the Ant Colony Optimization (ACO) which are the Ant System (AS), the Ant Colony System (ACS) and a Modified Ant Colony Optimization (MACO) aiming to explore more search space and thus guarantee better resolution of the problem. Comprehensive experiments are conducted to evaluate the performance of the three algorithms and the results show that the MACO is effective for the problem and AS and ACS algorithms in resolving the DJSP.
展开▼
