IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v150y2007i1p3-1510.1007-s10479-006-0164-y.html
   My bibliography  Save this article

Multi-agent single machine scheduling

Author

Listed:
  • Alessandro Agnetis
  • Dario Pacciarelli
  • Andrea Pacifici

Abstract

We consider the scheduling problems arising when several agents, each owning a set of nonpreemptive jobs, compete to perform their respective jobs on one shared processing resource. Each agent wants to minimize a certain cost function, which depends on the completion times of its jobs only. The cost functions we consider in this paper are maximum of regular functions (associated with each job), number of late jobs and total weighted completion time. The different combinations of the cost functions of each agent lead to various problems, whose computational complexity is analysed in this paper. In particular, we investigate the problem of finding schedules whose cost for each agent does not exceed a given bound for each agent. Copyright Springer Science+Business Media, LLC 2007

Suggested Citation

  • Alessandro Agnetis & Dario Pacciarelli & Andrea Pacifici, 2007. "Multi-agent single machine scheduling," Annals of Operations Research, Springer, vol. 150(1), pages 3-15, March.
    • Handle: RePEc:spr:annopr:v:150:y:2007:i:1:p:3-15:10.1007/s10479-006-0164-y
    DOI: 10.1007/s10479-006-0164-y
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-006-0164-y
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-006-0164-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Brewer, Paul J. & Plott, Charles R., 1996. "A binary conflict ascending price (BICAP) mechanism for the decentralized allocation of the right to use railroad tracks," International Journal of Industrial Organization, Elsevier, vol. 14(6), pages 857-886, October.
    2. Martin J. Osborne & Ariel Rubinstein, 1994. "A Course in Game Theory," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262650401, December.
    3. E. L. Lawler, 1973. "Optimal Sequencing of a Single Machine Subject to Precedence Constraints," Management Science, INFORMS, vol. 19(5), pages 544-546, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Allesandro Agnetis & Pitu B. Mirchandani & Dario Pacciarelli & Andrea Pacifici, 2004. "Scheduling Problems with Two Competing Agents," Operations Research, INFORMS, vol. 52(2), pages 229-242, April.
    2. Kovalyov, Mikhail Y. & Pesch, Erwin, 2014. "A game mechanism for single machine sequencing with zero risk," Omega, Elsevier, vol. 44(C), pages 104-110.
    3. Battigalli, Pierpaolo & Bonanno, Giacomo, 1997. "The Logic of Belief Persistence," Economics and Philosophy, Cambridge University Press, vol. 13(1), pages 39-59, April.
    4. Szabó, György & Borsos, István & Szombati, Edit, 2019. "Games, graphs and Kirchhoff laws," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 521(C), pages 416-423.
    5. Enrique Gerstl & Gur Mosheiov, 2020. "Single machine scheduling to maximize the number of on-time jobs with generalized due-dates," Journal of Scheduling, Springer, vol. 23(3), pages 289-299, June.
    6. Shi, Yi & Deng, Yawen & Wang, Guoan & Xu, Jiuping, 2020. "Stackelberg equilibrium-based eco-economic approach for sustainable development of kitchen waste disposal with subsidy policy: A case study from China," Energy, Elsevier, vol. 196(C).
    7. Marc Le Menestrel, 2003. "A one-shot Prisoners’ Dilemma with procedural utility," Economics Working Papers 819, Department of Economics and Business, Universitat Pompeu Fabra.
    8. Cheng‐Kuang Wu & Yi‐Ming Chen & Dachrahn Wu & Ching‐Lin Chi, 2020. "A Game Theory Approach for Assessment of Risk and Deployment of Police Patrols in Response to Criminal Activity in San Francisco," Risk Analysis, John Wiley & Sons, vol. 40(3), pages 534-549, March.
    9. Nasimeh Heydaribeni & Achilleas Anastasopoulos, 2019. "Linear Equilibria for Dynamic LQG Games with Asymmetric Information and Dependent Types," Papers 1909.04834, arXiv.org.
    10. Müller, Christoph, 2020. "Robust implementation in weakly perfect Bayesian strategies," Journal of Economic Theory, Elsevier, vol. 189(C).
    11. Hitoshi Matsushima, 2019. "Implementation without expected utility: ex-post verifiability," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 53(4), pages 575-585, December.
    12. Dasgupta Utteeyo, 2011. "Are Entry Threats Always Credible?," The B.E. Journal of Economic Analysis & Policy, De Gruyter, vol. 11(1), pages 1-41, December.
    13. Baran Han, 2018. "The role and welfare rationale of secondary sanctions: A theory and a case study of the US sanctions targeting Iran," Conflict Management and Peace Science, Peace Science Society (International), vol. 35(5), pages 474-502, September.
    14. Carlos Pimienta & Jianfei Shen, 2014. "On the equivalence between (quasi-)perfect and sequential equilibria," International Journal of Game Theory, Springer;Game Theory Society, vol. 43(2), pages 395-402, May.
    15. Asheim, Geir & Søvik, Ylva, 2003. "The semantics of preference-based belief operators," Memorandum 05/2003, Oslo University, Department of Economics.
    16. Wang, Yafeng & Graham, Brett, 2009. "Generalized Maximum Entropy estimation of discrete sequential move games of perfect information," MPRA Paper 21331, University Library of Munich, Germany.
    17. repec:dau:papers:123456789/6818 is not listed on IDEAS
    18. Tobias Harks & Martin Hoefer & Anja Schedel & Manuel Surek, 2021. "Efficient Black-Box Reductions for Separable Cost Sharing," Mathematics of Operations Research, INFORMS, vol. 46(1), pages 134-158, February.
    19. Karbowski, Adam, 2011. "O kilku modelach samolubnego karania w ekonomii behawioralnej [Evolution of altruism in the light of behavioral economics]," MPRA Paper 69604, University Library of Munich, Germany.
    20. Ricardo F. Reis & Phillip C. Stocken, 2007. "Strategic Consequences of Historical Cost and Fair Value Measurements," Contemporary Accounting Research, John Wiley & Sons, vol. 24(2), pages 557-584, June.
    21. Costello, Christopher & Molina, Renato, 2021. "Transboundary marine protected areas," Resource and Energy Economics, Elsevier, vol. 65(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:150:y:2007:i:1:p:3-15:10.1007/s10479-006-0164-y. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.