Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions

DOI10.1007/S10951-008-0054-ZMaRDI QIDQ835601zbMATH OpenOpenAlexFDO

Authors 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

high multiplicitymultiprocessor schedulingpolynomial algorithms

Mathematics Subject Classification ID

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

Recommendations

• A polynomial algorithm for multiprocessor scheduling with two job lengths.
• A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs
• Parallel machine scheduling with job assignment restrictions
• scientific article; zbMATH DE number 1271325
• Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems

Cites work

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

Cited in

(4)

• 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
• A polynomial algorithm for multiprocessor scheduling with two job lengths.
• A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs
• Optimal packet-to-slot assignment in mobile telecommunications

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q835601)