Scholarlink

The work concerns the use of D-Wave’s quantum cloud service to solve the NP-hard flow shop scheduling problem with due dates and with the criterion of maximizing the weighted number of tasks performed on time. Constrained Quadratic Model, Binary Constrained Quadratic Model, and Binary Unconstrained Quadratic Model were proposed. Load experiments were carried out in a hybrid D-Wave LeapHybridCQMSampler environment using a combination of metaheuristics and quantum annealing, and DWaveSampler natively implementing quantum annealing. Calculations in the DWaveSampler environment are performed very quickly, but their practical application is currently limited due to the relatively small number of available qubits.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Solving Two-Machine Sum-Cost Flow Shop Problem on D-Wave Quantum Annealer

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Wojciech Bożejko,
  • Ryszard Klempous,
  • Mariusz Uchroński,
  • Mieczysław Wodecki

摘要

The work concerns the use of D-Wave’s quantum cloud service to solve the NP-hard flow shop scheduling problem with due dates and with the criterion of maximizing the weighted number of tasks performed on time. Constrained Quadratic Model, Binary Constrained Quadratic Model, and Binary Unconstrained Quadratic Model were proposed. Load experiments were carried out in a hybrid D-Wave LeapHybridCQMSampler environment using a combination of metaheuristics and quantum annealing, and DWaveSampler natively implementing quantum annealing. Calculations in the DWaveSampler environment are performed very quickly, but their practical application is currently limited due to the relatively small number of available qubits.