Nonpreemptive LP-Scheduling on Homogeneous Multiprocessor Systems

DOI10.1137/0210012zbMath0454.68015OpenAlexW1995965356MaRDI QIDQ3902466

Manfred Kunde

Publication date: 1981

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

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

zbMATH Keywords

list schedulingworst-case analysisperformance boundscritical-path algorithm

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)

Related Items (7)

A state-space search approach for parallel processor scheduling problems with arbitrary precedence relations ⋮ Modelling and scheduling a batch-type production on identical machines ⋮ A state-of-the-art review of parallel-machine scheduling research ⋮ APPROXIMATION SCHEMES FOR SCHEDULING JOBS WITH CHAIN PRECEDENCE CONSTRAINTS ⋮ Greed in resource scheduling ⋮ b9000A 1/4 approximate algorithm for P2/tree/Cmax ⋮ Algorithms for dynamic scheduling of unit execution time tasks

This page was built for publication: Nonpreemptive LP-Scheduling on Homogeneous Multiprocessor Systems