Bounds on the Scheduling of Typed Task Systems

DOI10.1137/0209040zbMath0453.68004OpenAlexW2077163592MaRDI QIDQ3900978

Jeffrey M. Jaffe

Publication date: 1980

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0209040

zbMATH Keywords

list schedulingmultiprocessingworst case performance bounds

Mathematics Subject Classification ID

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

Related Items (5)

Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times ⋮ Efficient scheduling of tasks without full use of processor resources ⋮ A new approximation algorithm for UET-scheduling with chain-type precedence constraints. ⋮ Performance of Garey-Johnson algorithm for pipelined typed tasks systems ⋮ Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan

This page was built for publication: Bounds on the Scheduling of Typed Task Systems