On minimizing dataset transfer time in an acyclic network with four servers

DOI10.1134/S1990478916040050zbMath1374.90159MaRDI QIDQ2959189

No author found.

Publication date: 9 February 2017

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

zbMATH Keywords

multiprocessor schedulingpolynomial time algorithmNP-hardness

Mathematics Subject Classification ID

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

Related Items (1)

Branch‐and‐bound approach for optima localization in scheduling multiprocessor jobs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
• Scheduling with conflicts: Online and offline algorithms
• On the complexity of adjacent resource scheduling
• Scheduling for parallel processing
• Scheduling multiprocessor tasks on three dedicated processors
• The berth planning problem
• Complexity of scheduling multiprocessor tasks with prespecified processors allocations
• Adjacent-Resource Scheduling
• OPTVersusLOADin Dynamic Storage Allocation
• Scheduling independent multiprocessor tasks

This page was built for publication: On minimizing dataset transfer time in an acyclic network with four servers