Skip to main content
SpringerLink
Log in

Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

A variant of the High Multiplicity Multiprocessor Scheduling Problem with C job lengths is considered, in which jobs can be processed only by machines not greater than a given index. When C=2, polynomial algorithms are proposed, for the feasibility version of the problem and for maximizing the number of scheduled jobs.

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

  • Agnetis, A., & Filippi, C. (2005). Asymptotic exact algorithm for the high multiplicity bin packing problem. Mathematical Programming, 104, 21–37.

    Article  Google Scholar 

  • Agnetis, A., Brogi, G., Ciaschetti, G., Detti, P., & Giambene, G. (2003). Optimal packet scheduling in UTRA-TDD. IEEE Communications Letters, 7(3), 112–114

    Article  Google Scholar 

  • Detti, P., Agnetis, A., & Ciaschetti, G. (2005). Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems. Journal of Scheduling, 8(3), 255–273.

    Article  Google Scholar 

  • Eisenbrand, F., & Shmonin, G. (2006). Carathéodory bounds for integer cones. Operations Research Letters, 34(5), 564–568.

    Article  Google Scholar 

  • Harvey, W. (1999). Computing two-dimensional integers hulls. SIAM Journal on Computing 6(28), 2285–2299.

    Article  Google Scholar 

  • Hochbaum, D., & Shamir, R. (1991). Strongly polynomial algorithms for the high multiplicity scheduling problem. Operations Research, 4(39), 648–653.

    Article  Google Scholar 

  • Leung, J. (1982). On scheduling independent tasks with restricted execution times. Operations Research, 1(30), 163–171.

    Google Scholar 

  • McCormick, S. T., Smallwood, S. R., & Spieksma, F. C. R. (2001). A polynomial algorithm for multiprocessor scheduling with two job lengths. Mathematics of Operations Research, 26(1), 31–49.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Ingegneria dell’Informazione, Università di Siena, Via Roma, 56, 53100, Siena, Italy

    Paolo Detti

Authors
  1. Paolo Detti
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Paolo Detti.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Detti, P. Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions. J Sched 11, 205–212 (2008). https://doi.org/10.1007/s10951-008-0054-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-008-0054-z

Keywords

Search

Navigation