Two Agents Competing for a Shared Machine

  • Alessandro Agnetis
  • Gaia Nicosia
  • Andrea Pacifici
  • Ulrich Pferschy
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8176)

Abstract

In this paper we address a deterministic scheduling problem in which two agents compete for the usage of a single machine. The agents submit their tasks in successive steps to an external coordinator, who sequences them according to a known priority rule. We introduce the problem for three different shop configurations, namely when the agents’ parts are transferred to the machine through two distinct linear conveyor belts, when they are transferred through circular conveyor belts, and when parts can be freely picked from the two agents’ buffer. We consider the problem from different perspectives. First, we look at the problem from a centralized point of view as a bicriteria optimization problem and characterize the set of Pareto optimal solutions from the computational complexity perspective. Then, we address the problem from one agent’s point of view. In particular, we propose algorithms suggesting to an agent how to sequence its own tasks in order to optimize its own objective function, regardless of the other agents objectives.

Keywords

scheduling multi-agent optimization bicriteria optimization 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Agnetis, A., Mirchandani, P.B., Pacciarelli, D., Pacifici, A.: Scheduling Problems with Two Competing Agents. Operations Research 52(2), 229–242 (2004)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Baker, K., Smith, J.C.: A multiple criterion model for machine scheduling. Journal of Scheduling 6(1), 7–16 (2003)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Marini, C., Nicosia, G., Pacifici, A., Pferschy, U.: Strategies in Competing Subset Selection. Annals of Operations Research 207(1), 181–200 (2013)CrossRefMATHMathSciNetGoogle Scholar
  4. 4.
    Nicosia, G., Pacifici, A., Pferschy, U.: Subset Weight Maximization with Two Competing Agents. In: Rossi, F., Tsoukias, A. (eds.) ADT 2009. LNCS, vol. 5783, pp. 74–85. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  5. 5.
    Nicosia, G., Pacifici, A., Pferschy, U.: Competitive subset selection with two agents. Discrete Applied Mathematics 159(16), 1865–1877 (2011)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Pu, P., Hughues, J.: Integrating AGV schedules in a scheduling system for a flexible manufacturing environment. In: IEEE International Conference on Robotics and Automation, vol. 4, pp. 3149–3154 (1994)Google Scholar
  7. 7.
    T’Kindt, V., Billaut, J.-C.: Multicriteria scheduling. Theory, models and algorithms. Springer (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Alessandro Agnetis
    • 1
  • Gaia Nicosia
    • 2
  • Andrea Pacifici
    • 3
  • Ulrich Pferschy
    • 4
  1. 1.Dipartimento di Ingegneria dell’Informazione e Scienze MatematicheUniversità degli Studi di SienaItaly
  2. 2.Dipartimento di IngegneriaUniversità degli studi “Roma Tre”Italy
  3. 3.Dipartimento di Ingegneria Civile e Ingegneria InformaticaUniversità degli Studi di Roma “Tor Vergata”Italy
  4. 4.Department of Statistics and Operations ResearchUniversity of GrazAustria

Personalised recommendations