Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions

Authors:
Paolo Detti
Affiliations:
Dipartimento di Ingegneria dell'Informazione, Università di Siena, Siena, Italy 53100
Venue:
Journal of Scheduling
Year:
2008

Citing 5
Cited 2

Computing Two-Dimensional Integer Hulls

SIAM Journal on Computing
A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths

Mathematics of Operations Research
Polynomial Algorithms for a Two-Class Multiprocessor Scheduling Problem in Mobile Telecommunications Systems

Journal of Scheduling
An asymptotically exact algorithm for the high-multiplicity bin packing problem

Mathematical Programming: Series A and B
Carathéodory bounds for integer cones

Operations Research Letters

A fuzzy random resource-constrained scheduling model with multiple projects and its application to a working procedure in a large-scale water conservancy and hydropower construction project

Journal of Scheduling
Optimal packet-to-slot assignment in mobile telecommunications

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

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.