An \(R||C_{\max}\) quantum scheduling algorithm
From MaRDI portal
Publication:2384180
DOI10.1007/s11128-006-0048-8zbMath1119.81034arXivquant-ph/0511028OpenAlexW1979293166MaRDI QIDQ2384180
Feng Lü, Dan Cristian Marinescu
Publication date: 20 September 2007
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0511028
Search theory (90B40) Deterministic scheduling theory in operations research (90B35) Quantum computation (81P68) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (2)
Restoration for noise removal in quantum images ⋮ Unrelated parallel machine scheduling -- perspectives and progress
Cites Work
- Unnamed Item
- Approximation algorithms for scheduling unrelated parallel machines
- Fast quantum modular exponentiation
- Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times
- An Algorithm for Solving the Job-Shop Problem
- Strengths and Weaknesses of Quantum Computing
- Scheduling Unrelated Machines by Randomized Rounding
- Fixed-Point Quantum Search
This page was built for publication: An \(R||C_{\max}\) quantum scheduling algorithm
