Quantum Annealing Implementation of Job-Shop Scheduling

A quantum annealing solver for the renowned job-shop scheduling problem (JSP) is presented in detail. After formulating the problem as a time-indexed quadratic unconstrained binary optimization problem, several pre-processing and graph embedding strategies are employed to compile optimally parametri...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2016-10
Hauptverfasser:	Venturelli, Davide, Marchand, Dominic J J, Rojo, Galo
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms HyperText Markup Language Job shop scheduling Job shops Microprocessors Optimization Production scheduling Pruning Servers Solvers
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!