Distributed Flow Shop Scheduling Problem Global versus Local Optimization

First International Conference on Multiagent Systems

Volume

First International Conference on Multiagent Systems

Contents

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.