Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Chapter

Download BibTeX

Title

Application of Quantum Approximate Optimization Algorithm to Job Shop Scheduling Problem

Authors

[ 1 ] Wydział Informatyki i Telekomunikacji, Politechnika Poznańska | [ 2 ] Instytut Informatyki, Wydział Informatyki i Telekomunikacji, Politechnika Poznańska | [ SzD ] doctoral school student | [ P ] employee

Scientific discipline (Law 2.0)

[2.3] Information and communication technology

Year of publication

2022

Chapter type

chapter in monograph / paper

Publication language

english

Keywords
EN
  • Quantum Approximate Optimization Algorithm
  • scheduling
  • Job Shop Scheduling Problem
URL

https://pms2022.sciencesconf.org/376096

Book

18th International Workshop on Project Management and Scheduling PMS 2022, 6-7 April 2022, Ghent, Belgium

Presented on

18th International Workshop on Project Management and Scheduling PMS 2022, 6-7.04.2022, Ghent, Belgium

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.