Scheduling periodic I/O access with bi-colored chains: models and algorithms

DOI10.1007/S10951-021-00685-8zbMath1480.90134OpenAlexW2995662961MaRDI QIDQ2066691

Emmanuel Jeannot, Guillaume Pallez, Nicolas Vidal

Publication date: 14 January 2022

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

Full work available at URL: https://hal.inria.fr/hal-02021070/file/rr-stage.pdf

zbMATH Keywords

complexityapproximationshigh-performance computingalgorithmics

Mathematics Subject Classification ID

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

Cites Work

• One-machine generalized precedence constrained scheduling problems
• Scheduling two-stage jobs on multiple flowshops
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Scheduling periodic I/O access with bi-colored chains: models and algorithms