Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions

DOI10.1007/s10951-008-0054-zzbMath1168.90433OpenAlexW2043112499MaRDI QIDQ835601

Paolo Detti

Publication date: 28 August 2009

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-008-0054-z

zbMATH Keywords

multiprocessor schedulinghigh multiplicitypolynomial algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

Optimal packet-to-slot assignment in mobile telecommunications ⋮ 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

Cites Work

• Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems
• Carathéodory bounds for integer cones
• An asymptotically exact algorithm for the high-multiplicity bin packing problem
• A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths
• On Scheduling Independent Tasks with Restricted Execution Times
• Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
• Computing Two-Dimensional Integer Hulls

This page was built for publication: Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions