Abstract
Scheduling is an important aspect of automation in manu- facturing systems. It consists in allocating a finite set of resources or machines over time to perform a collection of tasks or jobs while satisfy- ing a set of constraints. One of the most known and hardest scheduling problems is the Job Shop, to which a distributed approach is proposed in this paper based on agent cooperation. There are essentially two types of agents: Job agents and Resource agents. Different agent behaviours based on heuristics are proposed and experimentally compared on ran- domly generated examples.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Applegate, D., Cook, W.: A computational study of the job-shop scheduling problem. ORSA Journal on Computing (1991) 149–156
Baptiste, P., Le Pape, C.: A Constraint-Based Branch and Bound Algorithm for preemptive Job Shop Scheduling Problem. In Proceedings of the International Workshop on Production Planning and Control, Mons, Belgium (1996)
Blazewicz, J., Sterna, M., Pesch, E.: A Branch and Bound algorithm for the Job Shop scheduling problem. (A Drexl and A. Kimms, eds.) Beyond Manufacturing Resource Planning (MRP II). Springer Verlap, Berlin (1998) 219–254
Carlier, J., Pinson, E.: An algorithm for solving the job shop scheduling problem. Management Science (1989) 164–176
Cardon, A., Galinho, T., Vacher, J. P.: A Multi-Objective Genetic Algorithm in Job-Shop Scheduling Problem to Refine an Agents’ Architecture. In Kaisa Miettinen, Marko M. Makela, Pekka Neittaanmaki, and Jacques Periaux, editors, Proceedings of EUROGEN’ 99, Jyvaskyla, Finland (1999)
Dorndorf, U., Pesch, E., Phan Huy, T.: Recent Developments in Scheduling. In Operations Research Proceedings, Springer (1998)
Ferber, J., Jacopin, E.: The framework of eco problem solving. In Decentralized artificial intelligence. Editions North Holland, vol. 2 (1990)
Ghédira, K.: Partial Constraint Satisfaction by a MA approach combined with a Simulated Annealing Process. International Conference on AI, Paris (1994)
Ghedjati, F., Pomerol, J.Ch.: Résolution du probléme d’ordonnancement de type Job-Shop généralisé par des heuristiques dynamiques. Rapport de Recherche LIP6 1997 / 005, Laboratoire d’informatique de Paris6, (1997)
Lin, S. C., Goodman, E. D., Punch, W. F.: Investigating Parallel Genetic Algorithms on Job Shop Scheduling Problems. In Proceedings of Seventh International Conference on Genetic Algorithms, Morgan Kaufmann Publishers, San Fransisco (1997) 481–488
Liu, J., Sycara, K.: Emergent Constraint Satisfaction through Multi-Agent Coordinated Interaction. In Pre-proceedings of the 5th European workshop on Modeling autonomous agents in a multi-agent world (1993)
Tsujimura, Y., Cheng, R., Yen, M.: Improved genetic algorithms for Job Shop Scheduling Problems. Engineering Design and Automation 3(2) (1997) 133–144
Wellner, J., Dilger, W.: Job Shop Scheduling with Multiagents. In workshop planen und Konfigurieren (1999)
Yamada, T., Nakano, R.: Job Shop Scheduling by Simulated Annealing Combined with Deterministic Local Search. Kluwer academic publishers MA, USA (1996) 237–248
Yen, B. P., Wan, G.: Solving the Job Shop Problem using Taboo Search with Fuzzy Reasonning. Proceedings of the 3rd Annual International Conference on Industrial Engineeering theories, Applications and Practice, PN 35. 1-PN 135. 9, Hong Kong (1998)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ghédira, K., Ennigrou, M. (2000). How to Schedule a Job Shop Problem through Agent Cooperation. In: Artificial Intelligence: Methodology, Systems, and Applications. AIMSA 2000. Lecture Notes in Computer Science, vol 1904. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45331-8_13
Download citation
DOI: https://doi.org/10.1007/3-540-45331-8_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41044-7
Online ISBN: 978-3-540-45331-4
eBook Packages: Springer Book Archive