Distributed Flow Shop Scheduling Problem Global versus Local Optimization

Thouraya Daonas, Khaled Ghedira, and Jean Pierre Muller

This paper deals with the Flow Shop Scheduling Problem (FSSF) by a Multi-Agent_Simulated Annealing Model (MASAM). FSSP consists, according to a certain number of criteria, in finding the best possible allocation of n jobs on m resources, so that operations of every job must be processed on all resources in a unique order. MASM involves two types of agents: jobs and resources.

This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.