default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMieczyslaw Wodecki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Wojciech Bozejko
, Jaroslaw Pempera, Mariusz Uchronski, Mieczyslaw Wodecki:
Quantum annealing-driven branch and bound for the single machine total weighted number of tardy jobs scheduling problem. Future Gener. Comput. Syst. 155: 245-255 (2024)- 2023
- [c56]Wojciech Bozejko, Jaroslaw Pempera, Mariusz Uchronski, Mieczyslaw Wodecki:
Determination of the Lower Bounds of the Goal Function for a Single-Machine Scheduling Problem on D-Wave Quantum Annealer. ICCS (5) 2023: 201-208 - [c55]Wojciech Bozejko, Jaroslaw Pempera, Mariusz Uchronski, Mieczyslaw Wodecki:
An Exact Quantum Annealing-Driven Branch and Bound Algorithm for Maximizing the Total Weighted Number of on-Time Jobs on a Single Machine. PCC (2) 2023: 79-89 - 2022
- [c54]Wojciech Bozejko, Jaroslaw Pempera, Mariusz Uchronski, Mieczyslaw Wodecki:
Distributed Quantum Annealing on D-Wave for the Single Machine Total Weighted Tardiness Scheduling Problem. ICCS (4) 2022: 171-178 - 2021
- [c53]Wojciech Bozejko, Pawel Rajba, Mariusz Uchronski, Mieczyslaw Wodecki:
A Job Shop Scheduling Problem with Due Dates Under Conditions of Uncertainty. ICCS (1) 2021: 198-205 - [c52]Wojciech Bozejko, Piotr Nadybski, Pawel Rajba, Mieczyslaw Wodecki:
The Problem of Tasks Scheduling with Due Dates in a Flexible Multi-machine Production Cell. ICCS (4) 2021: 405-419 - [c51]Wojciech Bozejko, Radoslaw Grymin, Jaroslaw Pempera, Mieczyslaw Wodecki:
Efficient Tabu Search Algorithm for the Cyclic Inspection Problem. SOCO 2021: 751-757 - [c50]Wojciech Bozejko, Jaroslaw Pempera, Mariusz Uchronski, Mieczyslaw Wodecki:
Parallel Block-Based Simulated Annealing for the Single Machine Total Weighted Tardiness Scheduling Problem. SOCO 2021: 758-765 - 2020
- [c49]Wojciech Bozejko, Pawel Rajba, Mieczyslaw Wodecki:
Robust Single Machine Scheduling with Random Blocks in an Uncertain Environment. ICCS (7) 2020: 529-538 - [c48]Wojciech Bozejko, Pawel Rajba, Mieczyslaw Wodecki:
Blocks of Jobs for Solving Two-Machine Flow Shop Problem with Normal Distributed Processing Times. SOCO 2020: 289-298
2010 – 2019
- 2019
- [c47]Wojciech Bozejko, Radoslaw Idzikowski, Mieczyslaw Wodecki:
Flow Shop Problem with Machine Time Couplings. DepCoS-RELCOMEX 2019: 80-89 - 2018
- [c46]Wojciech Bozejko, Zenon Chaczko, Piotr Nadybski, Mieczyslaw Wodecki:
Meta-heuristic Task Scheduling Algorithm for Computing Cluster with 2D Packing Problem Approach. DepCoS-RELCOMEX 2018: 74-82 - [c45]Wojciech Bozejko, Pawel Rajba, Mieczyslaw Wodecki:
Robustness of the Uncertain Single Machine Total Weighted Tardiness Problem with Elimination Criteria Applied. DepCoS-RELCOMEX 2018: 94-103 - [c44]Mariusz Uchronski, Wojciech Bozejko, Zdzislaw Krajewski, Mateusz Tykierko, Mieczyslaw Wodecki:
User Estimates Inaccuracy Study in HPC Scheduler. DepCoS-RELCOMEX 2018: 504-514 - [c43]Wojciech Bozejko, Jaroslaw Pempera, Mieczyslaw Wodecki:
Minimization of the Number of Employees in Manufacturing Cells. SOCO-CISIS-ICEUTE 2018: 241-248 - 2017
- [j8]Wojciech Bozejko, Andrzej Gnatowski, Jaroslaw Pempera, Mieczyslaw Wodecki:
Parallel tabu search for the cyclic job shop scheduling problem. Comput. Ind. Eng. 113: 512-524 (2017) - [c42]Pawel Rajba, Mieczyslaw Wodecki:
Sampling Method for the Flow Shop with Uncertain Parameters. CISIM 2017: 580-591 - [c41]Wojciech Bozejko, Andrzej Gnatowski, Czeslaw Smutnicki, Mariusz Uchronski, Mieczyslaw Wodecki:
Local Search Metaheuristics with Reduced Searching Diameter. EUROCAST (1) 2017: 447-454 - [c40]Wojciech Bozejko, Mariusz Uchronski, Mieczyslaw Wodecki:
The k-opt algorithm analysis. The flexible job shop case. KKA 2017: 370-377 - [c39]Wojciech Bozejko, Lukasz Gniewkowski, Mieczyslaw Wodecki:
Blocks for the flow shop scheduling problem with uncertain parameters. KKA 2017: 703-711 - [c38]Wojciech Bozejko, Piotr Nadybski, Mieczyslaw Wodecki:
Two level algorithm with Tabu Search optimization for task scheduling problem in computing cluster environment. MMAR 2017: 238-242 - [c37]Wojciech Bozejko, Czeslaw Smutnicki, Mariusz Uchronski, Mieczyslaw Wodecki:
Big valley in scheduling problems landscape - Metaheuristics with reduced searching area. MMAR 2017: 458-462 - 2016
- [j7]Wojciech Bozejko, Mariusz Uchronski, Mieczyslaw Wodecki:
Parallel metaheuristics for the cyclic flow shop scheduling problem. Comput. Ind. Eng. 95: 156-163 (2016) - [c36]Wojciech Bozejko, Lukasz Kacprzak, Piotr Nadybski, Mieczyslaw Wodecki:
Multi-machine Scheduling with Setup Times. CISIM 2016: 300-311 - [c35]Wojciech Bozejko, Piotr Nadybski, Mieczyslaw Wodecki:
Two Step Algorithm for Virtual Machine Distributed Replication with Limited Bandwidth Problem. CISIM 2016: 312-321 - [c34]Wojciech Bozejko, Andrzej Gnatowski, Teodor Nizynski, Mieczyslaw Wodecki:
Tabu Search Algorithm with Neural Tabu Mechanism for the Cyclic Job Shop Problem. ICAISC (2) 2016: 409-418 - [c33]Wojciech Bozejko, Mariusz Uchronski, Mieczyslaw Wodecki:
Parallel Tabu Search Algorithm with Uncertain Data for the Flexible Job Shop Problem. ICAISC (2) 2016: 419-428 - 2015
- [j6]Wojciech Bozejko, Mariusz Uchronski, Mieczyslaw Wodecki:
Block approach to the cyclic flow shop scheduling. Comput. Ind. Eng. 81: 158-166 (2015) - [c32]Wojciech Bozejko, Lukasz Kacprzak, Mieczyslaw Wodecki:
Parallel Coevolutionary Algorithm for Three-Dimensional Bin Packing Problem. ICAISC (1) 2015: 319-328 - [c31]Wojciech Bozejko, Jaroslaw Pempera, Mieczyslaw Wodecki:
Parallel Simulated Annealing Algorithm for Cyclic Flexible Job Shop Scheduling Problem. ICAISC 2015: 603-612 - [c30]Mieczyslaw Wodecki, Wojciech Bozejko, Szymon Jagiello, Jaroslaw Pempera:
Parallel Cost Function Determination on GPU for the Vehicle Routing Problem. ICAISC 2015: 778-788 - [c29]Wojciech Bozejko, Lukasz Kacprzak, Mieczyslaw Wodecki:
Parallel packing procedure for three dimensional bin packing problem. MMAR 2015: 1122-1126 - 2014
- [c28]Wojciech Bozejko, Lukasz Gniewkowski, Mieczyslaw Wodecki:
Solving Timetabling Problems on GPU. ICAISC (2) 2014: 445-455 - [c27]Wojciech Bozejko, Pawel Rajba, Mieczyslaw Wodecki:
Scheduling Problem with Uncertain Parameters in Just in Time System. ICAISC (2) 2014: 456-467 - [c26]Wojciech Bozejko, Lukasz Gniewkowski, Jaroslaw Pempera, Mieczyslaw Wodecki:
Cyclic Hybrid Flow-shop Scheduling Problem with Machine Setups. ICCS 2014: 2127-2136 - 2013
- [c25]Wojciech Bozejko, Mariusz Uchronski, Mieczyslaw Wodecki:
Parallel Neuro-Tabu Search Algorithm for the Job Shop Scheduling Problem. ICAISC (2) 2013: 489-499 - [c24]Wojciech Bozejko, Zdzislaw Hejducki, Mariusz Uchronski, Mieczyslaw Wodecki:
Scheduling of Composite Bridge Components Transportation in Just in Time System. MIM 2013: 2087-2091 - [c23]Mieczyslaw Wodecki, Wojciech Bozejko, Michal Karpinski, Maciej Pacut:
Multi-GPU Parallel Memetic Algorithm for Capacitated Vehicle Routing Problem. PPAM (2) 2013: 207-214 - 2012
- [c22]Wojciech Bozejko, Mariusz Uchronski, Mieczyslaw Wodecki:
Fast Parallel Cost Function Calculation for the Flow Shop Scheduling Problem. ICAISC (2) 2012: 378-386 - [c21]Wojciech Bozejko, Mariusz Uchronski, Mieczyslaw Wodecki:
Solving the Flexible Job Shop Problem on GPU. ICAISC (2) 2012: 387-394 - [c20]Wojciech Bozejko, Zdzislaw Hejducki, Mariusz Uchronski, Mieczyslaw Wodecki:
Solving the Flexible Job Shop Problem on Multi-GPU. ICCS 2012: 2020-2023 - 2011
- [c19]Wojciech Bozejko, Mieczyslaw Wodecki:
Single-walk Parallelization of the Genetic Algorithm. ICAART (1) 2011: 586-590 - [c18]Wojciech Bozejko, Mieczyslaw Wodecki:
The Methodology of Parallel Memetic Algorithms Designing. ICAART (1) 2011: 643-648 - [c17]Wojciech Bozejko, Mariusz Uchronski, Mieczyslaw Wodecki:
Parallel Cost Function Determination on GPU for the Job Shop Scheduling Problem. PPAM (2) 2011: 1-10 - [c16]Wojciech Bozejko, Mariusz Uchronski, Mieczyslaw Wodecki:
Parallel estimation of the cost function for the flexible scheduling problemI. ICCS 2011: 2236-2245 - 2010
- [j5]Wojciech Bozejko, Mariusz Uchronski, Mieczyslaw Wodecki:
Parallel hybrid metaheuristics for the flexible job shop problem. Comput. Ind. Eng. 59(2): 323-333 (2010) - [c15]Wojciech Bozejko, Michal Czapinski, Mieczyslaw Wodecki:
Parallel Hybrid Metaheuristics for the Scheduling with Fuzzy Processing Times. ICAISC (2) 2010: 379-386 - [c14]Wojciech Bozejko, Mariusz Uchronski, Mieczyslaw Wodecki:
Parallel Meta2heuristics for the Flexible Job Shop Problem. ICAISC (2) 2010: 395-402 - [c13]Wojciech Bozejko, Mariusz Uchronski, Mieczyslaw Wodecki:
The new golf neighborhood for the exible job shop problem. ICCS 2010: 289-296
2000 – 2009
- 2009
- [j4]Wojciech Bozejko, Mieczyslaw Wodecki:
Solving permutational routing problems by population-based metaheuristics. Comput. Ind. Eng. 57(1): 269-276 (2009) - 2008
- [c12]Wojciech Bozejko, Mieczyslaw Wodecki:
Parallel Path-Relinking Method for the Flow Shop Scheduling Problem. ICCS (1) 2008: 264-273 - 2007
- [j3]Wojciech Bozejko, Mieczyslaw Wodecki:
On the theoretical properties of swap multimoves. Oper. Res. Lett. 35(2): 227-231 (2007) - [c11]Wojciech Bozejko, Mieczyslaw Wodecki:
Parallel Scatter Search Algorithm for the Flow Shop Sequencing Problem. PPAM 2007: 180-188 - 2006
- [j2]Wojciech Bozejko, Józef Grabowski, Mieczyslaw Wodecki:
Block approach - tabu search algorithm for single machine total weighted tardiness problem. Comput. Ind. Eng. 50(1-2): 1-14 (2006) - [c10]Wojciech Bozejko, Mieczyslaw Wodecki:
A New Inter-island Genetic Operator for Optimization Problems with Block Properties. ICAISC 2006: 334-343 - [c9]Wojciech Bozejko, Mieczyslaw Wodecki:
A Fast Parallel Dynasearch Algorithm for Some Scheduling Problems. PARELEC 2006: 275-280 - 2005
- [c8]Wojciech Bozejko, Mieczyslaw Wodecki:
Task Realization's Optimization with Earliness and Tardiness Penalties in Distributed Computation Systems. AWIC 2005: 69-75 - [c7]Wojciech Bozejko, Mieczyslaw Wodecki:
A Hybrid Evolutionary Algorithm for some Discrete Optimization Problems. ISDA 2005: 326-331 - 2004
- [j1]Józef Grabowski, Mieczyslaw Wodecki:
A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion. Comput. Oper. Res. 31(11): 1891-1909 (2004) - [c6]Wojciech Bozejko, Mieczyslaw Wodecki:
Parallel Genetic Algorithm for Minimizing Total Weighted Completion Time. ICAISC 2004: 400-405 - [c5]Wojciech Bozejko, Mieczyslaw Wodecki:
The New Concepts in Parallel Simulated Annealing Method. ICAISC 2004: 853-859 - [c4]Wojciech Bozejko, Mieczyslaw Wodecki:
Parallel Tabu Search Method Approach for Very Difficult Permutation Scheduling Problems. PARELEC 2004: 156-161 - 2003
- [c3]Wojciech Bozejko, Mieczyslaw Wodecki:
Parallel Genetic Algorithm for the Flow Shop Scheduling Problem. PPAM 2003: 566-571 - 2002
- [c2]Wojciech Bozejko, Mieczyslaw Wodecki:
Solving the Flow Shop Problem by Parallel Tabu Search. PARELEC 2002: 189-194 - 2001
- [c1]Mieczyslaw Wodecki, Wojciech Bozejko:
Solving the Flow Shop Problem by Parallel Simulated Annealing. PPAM 2001: 236-246
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-03 00:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
