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.
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.
Agnetis, A., Brogi, G., Ciaschetti, G., Detti, P., & Giambene, G. (2003). Optimal packet scheduling in UTRA-TDD. IEEE Communications Letters, 7(3), 112–114
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.
Eisenbrand, F., & Shmonin, G. (2006). Carathéodory bounds for integer cones. Operations Research Letters, 34(5), 564–568.
Harvey, W. (1999). Computing two-dimensional integers hulls. SIAM Journal on Computing 6(28), 2285–2299.
Hochbaum, D., & Shamir, R. (1991). Strongly polynomial algorithms for the high multiplicity scheduling problem. Operations Research, 4(39), 648–653.
Leung, J. (1982). On scheduling independent tasks with restricted execution times. Operations Research, 1(30), 163–171.
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.
Author information
Authors and Affiliations
Corresponding author
Rights 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
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-008-0054-z