Abstract
In this paper, a heuristic approach to job scheduling, which is based on a multi-agent system model, is proposed. The class of scheduling problems considered is characterized by the presence of independent jobs and identical parallel machines, and by a non-regular objective, including both job earliness and tardiness penalties. The multi-agent scheduling system is composed by different classes of agents, and a schedule is progressively defined by a negotiation protocol among the agents associated with the jobs and the machines.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Oliveira E., Fischer K. and Stepankova O.: Multi-agent systems: which research for which applications. Robotics and Autonomous Systems 27 (1999) 91–106.
Wooldridge, M. and Jennings N.R.: Intelligent agents: Theory and practise. The Knowledge Engineering Review 10,2 (1995) 115–152.
Wooldridge, M.: Intelligent Agents. In Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence G. Weiss (Ed.), MIT Press, Cambridge, MA. (1999).
Jennings, N.R. and Wooldridge M.J.: Applications of Intelligent Agents. In Agent Technology: Foundations, Applications, and Markets N.R. Jennings and M.J Wooldridge (Eds.), Springer. (1998).
Shen, W. and Norrie D.H.: Agent-Based Systems for Intelligent Manufacturing: A State-of-the-Art Survey. Knowledge and Information Systems, an Int. Jour. 1,2, (1999) 129–156.
Van Leeuwen, E.H. and Norrie D.H.: Intelligent manufacturing: holons and holarchies. Manufacturing Engineer 76,2 (1997) 86–88.
Kanet J.J.: Minimizing the average deviation of job completion times about a common due date. Naval Research Logistics Quarterly, 28 (1981) 643–651.
Baker K.H. and Scudder G.D.: Sequencing with earliness and tardiness penalties: a review. Operations Research, 30 (1990) 22–36.
Emmons H.: Scheduling to a common due date on parallel uniform processors. Naval Research Logistics, 34 (1987) 803–810.
Hall N.G.: Single and multiple-processor models for minimizing completion time variance. Naval Research Logistics Quarterly, 33 (1986) 49–54.
Hall N.G., Kubiak W., Sethi S.P.: Earliness and tardiness scheduling problems, II: deviation of completion time about a restrictive common due date. Operations Research, 39 (1991) 847–856.
Garey M.R., Tarjan R.E., Wilfong G.T.: One-processor scheduling with symmetric earliness and tardiness penalties. Mathematics of Operations Research, 13 (1988) 330–348.
Sivrikaya-Serifoglu F., and Ulusoy G.: Parallel machine scheduling with earliness and tardiness penalties. Computers and Operations Research, 26 (1999) 773–787.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gozzi, A., Paolucci, M., Boccalatte, A. (2002). Autonomous Agents Applied to Manufacturing Scheduling Problems: A Negotiation-Based Heuristic Approach. In: Mařík, V., Štěpánková, O., Krautwurmová, H., Luck, M. (eds) Multi-Agent Systems and Applications II. ACAI 2001. Lecture Notes in Computer Science(), vol 2322. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45982-0_12
Download citation
DOI: https://doi.org/10.1007/3-540-45982-0_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43377-4
Online ISBN: 978-3-540-45982-8
eBook Packages: Springer Book Archive