Mieczysław Wodecki
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Mieczysław Wodecki has a total of 49 co-authors. Here are the top co-authors by number of shared publications:
- Wojciech Bożejko
Wrocław University of Science and Technology
83 shared publications - Mariusz Uchroński
Wrocław University of Science and Technology
29 shared publications - Jarosław Pempera
Wrocław University of Science and Technology
10 shared publications - Paweł Rajba
University of Wrocław
10 shared publications - Andrzej Gnatowski
Wrocław University of Science and Technology
4 shared publications Jarosław Pempera
4 shared publications
Latest Publications
- 6 January 2026
- Published by Springer Nature
- p. 127-138
Hybrid Quantum Annealing Approach for Huge Neighborhoods Searching in Application to Task Scheduling
- 6 January 2026
- Published by Springer Nature
- p. 127-138
Hybrid Quantum Annealing Approach for Huge Neighborhoods Searching in Application to Task Scheduling
- 24 April 2025
- Published by Springer Nature
- p. 69-78
Solving Two-Machine Sum-Cost Flow Shop Problem on D-Wave Quantum Annealer
- 24 April 2025
- Published by Springer Nature
- p. 69-78
Solving Two-Machine Sum-Cost Flow Shop Problem on D-Wave Quantum Annealer
- 16 November 2024
- Published by Springer Nature
- p. 68-76
Comparison of D-Wave Quantum Computing Environment Solvers for a Two-Machine Jobs Scheduling Problem
- 16 November 2024
- Published by Springer Nature
- p. 68-76
Comparison of D-Wave Quantum Computing Environment Solvers for a Two-Machine Jobs Scheduling Problem
- Open Access
- 13 May 2024
- Published by Springer Nature in Annals of Operations Research
- Vol. 364 (2) , 1-16
Optimal solving of a binary knapsack problem on a D-Wave quantum machine and its implementation in production systems
The efficient management of complex production systems is a challenge in today’s logistics. In the field of intelligent and sustainable logistics, the optimization of production batches, especially in the context of a rapidly changing product range, requires fast and precise computational solutions. This paper explores the potential of quantum computers for solving these problems. Traditional computational methods are often limited when it comes to optimizing complex logistics systems. In response to these challenges, the paper proposes the use of a hybrid algorithm that combines quantum technologies with classical computational methods. Such integration allows the computational power of both types of technologies to be harnessed, leading to faster and more efficient identification of optimal solutions. In this work, we consider the knapsack problem, a classic NP-hard optimization problem that is commonly used to verify the effectiveness of new algorithm construction methods. The algorithm presented is based on the Branch and Bound method and aims to ensure solution optimality in the context of the non-determinism of quantum computers. Within the algorithm, computations are performed alternately on a classical processor and a quantum processor. In addition, the lower and upper bounds of the objective function are computed in constant time using the D-Wave quantum machine.
- 13 May 2024
- Published by Springer Nature in Annals of Operations Research
- Vol. 364 (2) , 1-16
Open AccessOptimal solving of a binary knapsack problem on a D-Wave quantum machine and its implementation in production systems
The efficient management of complex production systems is a challenge in today’s logistics. In the field of intelligent and sustainable logistics, the optimization of production batches, especially in the context of a rapidly changing product range, requires fast and precise computational solutions. This paper explores the potential of quantum computers for solving these problems. Traditional computational methods are often limited when it comes to optimizing complex logistics systems. In response to these challenges, the paper proposes the use of a hybrid algorithm that combines quantum technologies with classical computational methods. Such integration allows the computational power of both types of technologies to be harnessed, leading to faster and more efficient identification of optimal solutions. In this work, we consider the knapsack problem, a classic NP-hard optimization problem that is commonly used to verify the effectiveness of new algorithm construction methods. The algorithm presented is based on the Branch and Bound method and aims to ensure solution optimality in the context of the non-determinism of quantum computers. Within the algorithm, computations are performed alternately on a classical processor and a quantum processor. In addition, the lower and upper bounds of the objective function are computed in constant time using the D-Wave quantum machine.
- 19 February 2024
- Published by Elsevier in Future Generation Computer Systems
- Vol. 155, 245-255
Quantum annealing-driven branch and bound for the single machine total weighted number of tardy jobs scheduling problem
- 19 February 2024
- Published by Elsevier in Future Generation Computer Systems
- Vol. 155, 245-255
Quantum annealing-driven branch and bound for the single machine total weighted number of tardy jobs scheduling problem
- 26 June 2023
- Published by Springer Nature
- p. 201-208
Determination of the Lower Bounds of the Goal Function for a Single-Machine Scheduling Problem on D-Wave Quantum Annealer
- 26 June 2023
- Published by Springer Nature
- p. 201-208
Determination of the Lower Bounds of the Goal Function for a Single-Machine Scheduling Problem on D-Wave Quantum Annealer
- Open Access
- 24 April 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (9) , 5304
Elimination Properties for a Probabilistic Scheduling Problem
In many areas of the economy, we deal with random processes, e.g., transport, agriculture, trade, construction, etc. Effective management of such processes often leads to optimization models with random parameters. Solving these problems is already very difficult in deterministic cases, because they usually belong to the NP-hard class. In addition the inclusion of the uncertainty parameters in the model causes additional complications. Hence these problems are much less frequently studied. We propose a new customized approach to searching the solutions space for problems with random parameters. We prove new, strong properties of solutions, the so-called block elimination properties, accelerating the neighborhood search. They make it possible to eliminate certain subsets of the solution space containing worse solutions without the need to calculate the value of the criterion function. Blocks can be used in the construction of exact and approximate algorithms, e.g., metaheuristics such as tabu search, significantly improving their efficiency.
- 24 April 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (9) , 5304
Open AccessElimination Properties for a Probabilistic Scheduling Problem
In many areas of the economy, we deal with random processes, e.g., transport, agriculture, trade, construction, etc. Effective management of such processes often leads to optimization models with random parameters. Solving these problems is already very difficult in deterministic cases, because they usually belong to the NP-hard class. In addition the inclusion of the uncertainty parameters in the model causes additional complications. Hence these problems are much less frequently studied. We propose a new customized approach to searching the solutions space for problems with random parameters. We prove new, strong properties of solutions, the so-called block elimination properties, accelerating the neighborhood search. They make it possible to eliminate certain subsets of the solution space containing worse solutions without the need to calculate the value of the criterion function. Blocks can be used in the construction of exact and approximate algorithms, e.g., metaheuristics such as tabu search, significantly improving their efficiency.
- 15 June 2022
- Published by Springer Nature
- p. 171-178
Distributed Quantum Annealing on D-Wave for the Single Machine Total Weighted Tardiness Scheduling Problem
- 15 June 2022
- Published by Springer Nature
- p. 171-178
Distributed Quantum Annealing on D-Wave for the Single Machine Total Weighted Tardiness Scheduling Problem
- 27 May 2022
- Published by Springer Nature
- p. 1-10
Robustness on Diverse Data Disturbance Levels of Tabu Search for a Single Machine Scheduling
- 27 May 2022
- Published by Springer Nature
- p. 1-10
Robustness on Diverse Data Disturbance Levels of Tabu Search for a Single Machine Scheduling