# An R || C max Quantum Scheduling Algorithm

An R || C max Quantum Scheduling Algorithm Grover’s search algorithm can be applied to a wide range of problems; even problems not generally regarded as searching problems, can be reformulated to take advantage of quantum parallelism and entanglement, and lead to algorithms which show a square root speedup over their classical counterparts. In this paper, we discuss a systematic way to formulate such problems and give as an example a quantum scheduling algorithm for an R||Cmax problem. R||Cmax is representative for a class of scheduling problems whose goal is to find a schedule with the shortest completion time in an unrelated parallel machine environment. Given a deadline, or a range of deadlines, the algorithm presented in this paper allows us to determine if a solution to an R||Cmax problem with N jobs and M machines exists, and if so, it provides the schedule. The time complexity of the quantum scheduling algorithm is $${\mathcal{O}(\sqrt{M^N})}$$ while the complexity of its classical counterpart is $${\mathcal{O}(M^N)}$$ . http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quantum Information Processing Springer Journals

# An R || C max Quantum Scheduling Algorithm

, Volume 6 (3) – Dec 12, 2006
20 pages

/lp/springer_journal/an-r-c-max-quantum-scheduling-algorithm-RLRJ44SZTv
Publisher
Subject
Physics; Characterization and Evaluation of Materials; Computer Science, general ; Engineering, general; Mathematics, general; Physics, general
ISSN
1570-0755
eISSN
1573-1332
D.O.I.
10.1007/s11128-006-0048-8
Publisher site
See Article on Publisher Site

### Abstract

Grover’s search algorithm can be applied to a wide range of problems; even problems not generally regarded as searching problems, can be reformulated to take advantage of quantum parallelism and entanglement, and lead to algorithms which show a square root speedup over their classical counterparts. In this paper, we discuss a systematic way to formulate such problems and give as an example a quantum scheduling algorithm for an R||Cmax problem. R||Cmax is representative for a class of scheduling problems whose goal is to find a schedule with the shortest completion time in an unrelated parallel machine environment. Given a deadline, or a range of deadlines, the algorithm presented in this paper allows us to determine if a solution to an R||Cmax problem with N jobs and M machines exists, and if so, it provides the schedule. The time complexity of the quantum scheduling algorithm is $${\mathcal{O}(\sqrt{M^N})}$$ while the complexity of its classical counterpart is $${\mathcal{O}(M^N)}$$ .

### Journal

Quantum Information ProcessingSpringer Journals

Published: Dec 12, 2006

## You’re reading a free preview. Subscribe to read the entire article.

### DeepDyve is your personal research library

It’s your single place to instantly
that matters to you.

over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month ### Explore the DeepDyve Library ### Search Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly ### Organize Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place. ### Access Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals. ### Your journals are on DeepDyve Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more. All the latest content is available, no embargo periods. DeepDyve ### Freelancer DeepDyve ### Pro Price FREE$49/month
\$360/year

Save searches from
PubMed

Create lists to

Export lists, citations