Open block scheduling in optical communication networks

DOI10.1016/j.tcs.2006.05.014zbMath1097.68011OpenAlexW2170365823MaRDI QIDQ2503353

A. A. Ageev, Aleksei V. Fishkin, Alexander V. Kononov, Sergey Sevast'janov

Publication date: 14 September 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.05.014

zbMATH Keywords

schedulingapproximationopen shopdata packets

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonstrict vector summation in multi-operation scheduling
• Makespan minimization in open shops: A polynomial time approximation scheme
• Complexity of scheduling multiprocessor tasks with prespecified processors allocations
• A polynomial-time open-shop problem with an arbitrary number of machines
• Open Shop Scheduling to Minimize Finish Time
• Short Shop Schedules
• An Algorithm for the Open-Shop Problem
• Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops
• Linear time approximation scheme for the multiprocessor open shop problem
• Scheduling independent multiprocessor tasks

This page was built for publication: Open block scheduling in optical communication networks