Mariusz Uchronski

Orcid: 0000-0002-9185-1841

According to our database1, Mariusz Uchronski authored at least 29 papers between 2009 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Quantum annealing-driven branch and bound for the single machine total weighted number of tardy jobs scheduling problem.
Future Gener. Comput. Syst., 2024

2023
Anomaly Detection Module for Network Traffic Monitoring in Public Institutions.
Sensors, March, 2023

An Exact Quantum Annealing-Driven Branch and Bound Algorithm for Maximizing the Total Weighted Number of on-Time Jobs on a Single Machine.
Proceedings of the Advanced, Contemporary Control, 2023

Determination of the Lower Bounds of the Goal Function for a Single-Machine Scheduling Problem on D-Wave Quantum Annealer.
Proceedings of the Computational Science - ICCS 2023, 2023

2022
Distributed Quantum Annealing on D-Wave for the Single Machine Total Weighted Tardiness Scheduling Problem.
Proceedings of the Computational Science - ICCS 2022, 2022

2021
Parallel Block-Based Simulated Annealing for the Single Machine Total Weighted Tardiness Scheduling Problem.
Proceedings of the 16th International Conference on Soft Computing Models in Industrial and Environmental Applications, 2021

Detecting anomalies and attacks in network traffic monitoring with classification methods and XAI-based explainability.
Proceedings of the Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 25th International Conference KES-2021, 2021

A Job Shop Scheduling Problem with Due Dates Under Conditions of Uncertainty.
Proceedings of the Computational Science - ICCS 2021, 2021

2018
User Estimates Inaccuracy Study in HPC Scheduler.
Proceedings of the Contemporary Complex Systems and Their Dependability, 2018

2017
Big valley in scheduling problems landscape - Metaheuristics with reduced searching area.
Proceedings of the 22nd International Conference on Methods and Models in Automation and Robotics, 2017

The k-opt algorithm analysis. The flexible job shop case.
Proceedings of the Trends in Advanced Intelligent Control, Optimization and Automation - Proceedings of KKA 2017, 2017

Local Search Metaheuristics with Reduced Searching Diameter.
Proceedings of the Computer Aided Systems Theory - EUROCAST 2017, 2017

2016
Parallel metaheuristics for the cyclic flow shop scheduling problem.
Comput. Ind. Eng., 2016

Parallel Tabu Search Algorithm with Uncertain Data for the Flexible Job Shop Problem.
Proceedings of the Artificial Intelligence and Soft Computing, 2016

2015
Block approach to the cyclic flow shop scheduling.
Comput. Ind. Eng., 2015

2014
Auxiliar Experimentorum - An Innovative Approach for Creating and Deploying Scientific Applications.
Proceedings of the eScience on Distributed Computing Infrastructure, 2014

2013
Scheduling of Composite Bridge Components Transportation in Just in Time System.
Proceedings of the 7th IFAC Conference on Manufacturing Modelling, Management, and Control, 2013

Parallel Neuro-Tabu Search Algorithm for the Job Shop Scheduling Problem.
Proceedings of the Artificial Intelligence and Soft Computing, 2013

2012
Solving the Flexible Job Shop Problem on Multi-GPU.
Proceedings of the International Conference on Computational Science, 2012

Solving the Flexible Job Shop Problem on GPU.
Proceedings of the Artificial Intelligence and Soft Computing, 2012

Fast Parallel Cost Function Calculation for the Flow Shop Scheduling Problem.
Proceedings of the Artificial Intelligence and Soft Computing, 2012

ACARM-ng: Next Generation Correlation Framework.
Proceedings of the Building a National Distributed e-Infrastructure - PL-Grid, 2012

2011
Parallel estimation of the cost function for the flexible scheduling problemI.
Proceedings of the International Conference on Computational Science, 2011

Parallel Cost Function Determination on GPU for the Job Shop Scheduling Problem.
Proceedings of the Parallel Processing and Applied Mathematics, 2011

2010
The new golf neighborhood for the exible job shop problem.
Proceedings of the International Conference on Computational Science, 2010

Parallel hybrid metaheuristics for the flexible job shop problem.
Comput. Ind. Eng., 2010

Parallel Meta<sup>2</sup>heuristics for the Flexible Job Shop Problem.
Proceedings of the Artifical Intelligence and Soft Computing, 2010

A Neuro-tabu Search Algorithm for the Job Shop Problem.
Proceedings of the Artifical Intelligence and Soft Computing, 2010

2009
Parallel Calculating of the Goal Function in Metaheuristics Using GPU.
Proceedings of the Computational Science, 2009


  Loading...