Skip to main content
SpringerLink
Log in

On games corresponding to sequencing situations with ready times

  • Published:
Mathematical Programming Submit manuscript

Abstract

This paper considers the special class of cooperative sequencing games that arise from one-machine sequencing situations in which all jobs have equal processing times and the ready time of each job is a multiple of the processing time.

By establishing relations between optimal orders of subcoalitions, it is shown that each sequencing game within this class is convex.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. Conway, W. Maxwell and L. Miller,Theory of Scheduling (Addison-Wesley, Reading, MA, 1967).

    Google Scholar 

  2. I. Curiel, G. Pederzoli and S. Tijs, “Sequencing games,”European Journal of Operational Research 40 (1989) 344–351.

    Google Scholar 

  3. I. Curiel, J. Potters, V. Rajendra Prasad, S. Tijs and B. Veltman, “Sequencing and cooperation,”Operations Research 42 (1994) 566–568.

    Google Scholar 

  4. J. Edmonds, “Submodular functions, matroids, and certain polyhedra,” in: R. Guy, H. Hanani, N. Sauer and J. Schönheim, eds.,Combinatorial Structures and their Applications (Gordon and Breach, London, 1970) pp. 69–87.

    Google Scholar 

  5. T. Ichiishi, “Super-modularity: Applications to convex games and the greedy algorithm for LP,”Journal of Economic Theory 25 (1981) 283–286.

    Google Scholar 

  6. A. Rinnooy Kan,Machine Scheduling Problems (Martinus Nijhoff, The Hague, 1976).

    Google Scholar 

  7. L. Shapley, “A value forn-person games,” in: A. Tucker and H. Kuhn, eds.,Contributions to the Theory of Games II (Princeton University Press, Princeton, NJ, 1953) pp. 307–317.

    Google Scholar 

  8. L. Shapley, “Cores of convex games,”International Journal of Game Theory 1 (1971) 11–26.

    Google Scholar 

  9. W. Smith, “Various optimizers for single-stage production,”Naval Research Logistics Quarterly 3 (1956) 59–66.

    Google Scholar 

  10. S. Tijs, “Bounds for the core and theτ-value,” in: O. Moeschlin and P. Pallaschke, eds.,Game Theory and Mathematical Economics (North-Holland, Amsterdam, 1981) pp. 123–132.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CentER and Department of Econometrics, Tilburg University, P.O. Box 90 153, 5000 LE, Tilburg, Netherlands

    Herbert Hamers, Peter Borm & Stef Tijs

Authors
  1. Herbert Hamers
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter Borm
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Stef Tijs
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This author is financially supported by the Dutch Organization for Scientific Research (NWO).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hamers, H., Borm, P. & Tijs, S. On games corresponding to sequencing situations with ready times. Mathematical Programming 69, 471–483 (1995). https://doi.org/10.1007/BF01585572

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01585572

Keywords

Search

Navigation