Nonpreemptive LP-Scheduling on Homogeneous Multiprocessor Systems

DOI10.1137/0210012MaRDI QIDQ3902466zbMATH OpenOpenAlexFDO

Authors 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

critical-path algorithmlist schedulingperformance boundsworst-case analysis

Mathematics Subject Classification ID

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

Cited in

(8)

• Modelling and scheduling a batch-type production on identical machines
• A state-space search approach for parallel processor scheduling problems with arbitrary precedence relations
• Algorithms for dynamic scheduling of unit execution time tasks
• Greed in resource scheduling
• Approximation schemes for scheduling jobs with chain precedence constraints
• b9000A 1/4 approximate algorithm for P2/tree/Cmax
• A (3/2+1/e)-approximation algorithm for ordered TSP
• A state-of-the-art review of parallel-machine scheduling research

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

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