MULTI-AGENT APPROACH BASED ON TABU SEARCH FOR THE FLEXIBLE JOB SHOP SCHEDULING PROBLEM

Meriem Ennigrou, Khaled Ghédira

2004

Abstract

This paper proposes a Multi-agent approach based on a tabu search method for solving the flexible Job Shop scheduling problem. The characteristic of the latter problem is that one or several machines can process one operation so that its processing time depends on the machine used. Such a generalization of the classical problem makes it more and more difficult to solve. The objective is to minimize the makespan or the total duration of the schedule. The proposed model is composed of three classes of agents: Job agents and Resource agents which are responsible for the satisfaction of the constraints under their jurisdiction, and an Interface agent containing the tabu search core. Different experimentations have been performed on different benchmarks and results have been presented.

References

  1. Brandimarte P. (1993). Routing and scheduling in a flexible job shop by tabu search. Annals of Operations Research 22. pp 158-183.
  2. Brucker, P. et Neyer, J. (1998). Tabu-search for the multimode job-shop problem. OR Spektrum 20, 21-28.
  3. Chambers et Barnes (1996). Flexible Job Shop scheduling by tabu search. Graduate program in Operations Research and Industrial Engineering, The university of Texas at Austin, Technical Report series, ORP96- 09.
  4. Dauzerre-Peres S., Paulli J. (1997). An integrated approach for modeling and solving the general multiprocessor job shop scheduling problem using tabu search. Annals of Operations Research 70, 281-306.
  5. Eikelder T., H.M.M., Aarts, B. J. M., Verhoeven, M. G. A. and Aarts, E.H.L. (1997). Sequential and Parallel Local Search Algorithms for Job Shop Scheduling. MIC'97 Proceedings of the 2nd International Conference on Meta-heuristics, Sophia-Antipolis, France, pp. 75-80.
  6. Ghédira K. et Ennigrou M. (2000). How to schedule o Job Shop Problem through agent cooperation. AIMSA 2000: Aritificial Intelligence: Methodology, Systems, Architectures.
  7. Glover F. (1986). Future paths for Integer Programming and Links to Artificial Intelligence,.Computers and Operations Research, 5:533-549.
  8. Hurink E., Jurisch B., Thole M. (1994). Tabu search for the Job Shop scheduling problem with multi-purpose machine. Operations Research Spektrum 15, 205-215.
  9. Jain A., Rangaswamy B., Meeran S. (2000). Job shop neighbourhoods and Move evaluation strategies.
Download


Paper Citation


in Harvard Style

Ennigrou M. and Ghédira K. (2004). MULTI-AGENT APPROACH BASED ON TABU SEARCH FOR THE FLEXIBLE JOB SHOP SCHEDULING PROBLEM . In Proceedings of the Sixth International Conference on Enterprise Information Systems - Volume 2: ICEIS, ISBN 972-8865-00-7, pages 22-28. DOI: 10.5220/0002610000220028


in Bibtex Style

@conference{iceis04,
author={Meriem Ennigrou and Khaled Ghédira},
title={MULTI-AGENT APPROACH BASED ON TABU SEARCH FOR THE FLEXIBLE JOB SHOP SCHEDULING PROBLEM},
booktitle={Proceedings of the Sixth International Conference on Enterprise Information Systems - Volume 2: ICEIS,},
year={2004},
pages={22-28},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002610000220028},
isbn={972-8865-00-7},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Sixth International Conference on Enterprise Information Systems - Volume 2: ICEIS,
TI - MULTI-AGENT APPROACH BASED ON TABU SEARCH FOR THE FLEXIBLE JOB SHOP SCHEDULING PROBLEM
SN - 972-8865-00-7
AU - Ennigrou M.
AU - Ghédira K.
PY - 2004
SP - 22
EP - 28
DO - 10.5220/0002610000220028