default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCzeslaw Smutnicki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Jaroslaw Rudy, Radoslaw Idzikowski, Czeslaw Smutnicki, Zbigniew Banaszak, Grzegorz Bocewicz:
New ideas in Lagrangian relaxation for a scheduling problem with the weighted tardiness criterion. Int. J. Appl. Math. Comput. Sci. 34(2) (2024)- 2023
- [c24]Czeslaw Smutnicki
, Jaroslaw Rudy, Radoslaw Idzikowski, Wojciech Bozejko:
Metaheuristic-Based Lagrangian Relaxation for Total Weighted Tardiness Minimization. PCC (2) 2023: 98-107 - 2022
- [j14]Czeslaw Smutnicki, Jaroslaw Pempera, Grzegorz Bocewicz, Zbigniew Banaszak:
Cyclic flow-shop scheduling with no-wait constraints and missing operations. Eur. J. Oper. Res. 302(1): 39-49 (2022) - [j13]Grzegorz Bocewicz, Peter Nielsen, Czeslaw Smutnicki, Jaroslaw Pempera, Zbigniew Antoni Banaszak:
Periodic distributed delivery routes planning subject to operation uncertainty of vehicles travelling in a convoy. J. Inf. Telecommun. 6(3): 360-380 (2022) - 2021
- [j12]Eryk Szwarc, Izabela Nielsen, Czeslaw Smutnicki, Grzegorz Bocewicz, Zbigniew Banaszak, Jakub Bilski:
Competence-oriented project team planning - university case study. J. Inf. Telecommun. 5(3): 310-333 (2021) - [j11]Grzegorz Bocewicz, Zbigniew Banaszak, Katarzyna Rudnik, Czeslaw Smutnicki, Marcin Witczak, Robert Wójcik:
An ordered-fuzzy-numbers-driven approach to the milk-run routing and scheduling problem. J. Comput. Sci. 49: 101288 (2021) - [c23]Grzegorz Bocewicz, Izabela Nielsen, Czeslaw Smutnicki, Zbigniew Banaszak:
Out-Plant Milk-Run-Driven Mission Planning Subject to Dynamic Changes of Date and Place Delivery. ICCS (1) 2021: 151-167 - [c22]Katarzyna Rudnik, Grzegorz Bocewicz, Czeslaw Smutnicki, Jaroslaw Pempera, Zbigniew Banaszczak:
Periodic Distributed Delivery Routes Planning Subject to Uncertainty of Travel Parameters. ICCCI 2021: 277-289 - [c21]Czeslaw Smutnicki, Jaroslaw Pempera:
Job Shop Scheduling with Transport by Automated Guided Vehicles. SOCO 2021: 789-799 - 2020
- [c20]Eryk Szwarc, Izabela Nielsen, Czeslaw Smutnicki, Grzegorz Bocewicz:
Competence-Oriented Recruitment of a Project Team Robust to Disruptions. ACIIDS (2) 2020: 13-25 - [c19]Grzegorz Bocewicz, Zbigniew Banaszak, Katarzyna Rudnik, Marcin Witczak, Czeslaw Smutnicki, Jaroslaw Wikarek:
Milk-run Routing and Scheduling Subject to Fuzzy Pickup and Delivery Time Constraints: An Ordered Fuzzy Numbers Approach. FUZZ-IEEE 2020: 1-10 - [c18]Grzegorz Bocewicz, Zbigniew Banaszak, Czeslaw Smutnicki, Katarzyna Rudnik, Marcin Witczak, Robert Wójcik:
Simulation Versus an Ordered-Fuzzy-Numbers-Driven Approach to the Multi-depot Vehicle Cyclic Routing and Scheduling Problem. ICCS (2) 2020: 251-266
2010 – 2019
- 2019
- [c17]Czeslaw Smutnicki:
Visualization of Solution Spaces for the Needs of Metaheuristics. EUROCAST (1) 2019: 304-311 - [c16]Czeslaw Smutnicki:
Cyclic Scheduling of Lots with Setup Times. MMAR 2019: 164-169 - 2018
- [j10]Jaroslaw Pempera, Czeslaw Smutnicki:
Open shop cyclic scheduling. Eur. J. Oper. Res. 269(2): 773-781 (2018) - [c15]Czeslaw Smutnicki:
Cyclic Scheduling in Interlaced and Non-Interlaced Mode. MMAR 2018: 937-942 - 2017
- [c14]Czeslaw Smutnicki, Wojciech Bozejko:
Tabu Search and Solution Space Analyses. The Job Shop Case. EUROCAST (1) 2017: 383-391 - [c13]Wojciech Bozejko, Andrzej Gnatowski, Czeslaw Smutnicki, Mariusz Uchronski, Mieczyslaw Wodecki:
Local Search Metaheuristics with Reduced Searching Diameter. EUROCAST (1) 2017: 447-454 - [c12]Wojciech Bozejko, Czeslaw Smutnicki, Mariusz Uchronski, Mieczyslaw Wodecki:
Big valley in scheduling problems landscape - Metaheuristics with reduced searching area. MMAR 2017: 458-462 - [c11]Czeslaw Smutnicki:
Minimizing cycle time in manufacturing systems with additional technological constraints. MMAR 2017: 463-470 - 2015
- [j9]Czeslaw Smutnicki, Jaroslaw Pempera, Jaroslaw Rudy, Dominik Zelazny:
A new approach for multi-criteria scheduling. Comput. Ind. Eng. 90: 212-220 (2015) - [c10]Czeslaw Smutnicki, Wojciech Bozejko:
Parallel and Distributed Metaheuristics. EUROCAST 2015: 72-79 - [c9]Wojciech Bozejko, Szymon Jagiello, Michal Lower, Czeslaw Smutnicki:
On Underwater Vehicle Routing Problem. EUROCAST 2015: 861-868 - [c8]Czeslaw Smutnicki:
New features of the cyclic job shop scheduling problem. MMAR 2015: 1000-1005 - 2013
- [j8]Wojciech Bozejko, Jaroslaw Pempera, Czeslaw Smutnicki:
Parallel tabu search algorithm for the hybrid flow shop problem. Comput. Ind. Eng. 65(3): 466-474 (2013) - [c7]Jaroslaw Pempera, Czeslaw Smutnicki, Dominik Zelazny:
Optimizing Bicriteria Flow Shop Scheduling Problem By Simulated Annealing Algorithm. ICCS 2013: 936-945 - 2012
- [p1]Czeslaw Smutnicki:
Optimization Technologies for Hard Problems. Recent Advances in Intelligent Engineering Systems 2012: 79-104 - 2011
- [c6]Czeslaw Smutnicki:
Biomimetic Optimizers for Job Scheduling. EUROCAST (2) 2011: 195-202
2000 – 2009
- 2009
- [c5]Wojciech Bozejko, Jaroslaw Pempera, Czeslaw Smutnicki:
Parallel Simulated Annealing for the Job Shop Scheduling Problem. ICCS (1) 2009: 631-640 - [c4]Wojciech Bozejko, Czeslaw Smutnicki, Mariusz Uchronski:
Parallel Calculating of the Goal Function in Metaheuristics Using GPU. ICCS (1) 2009: 1014-1023 - 2007
- [c3]Pawel Dabrowski, Jaroslaw Pempera, Czeslaw Smutnicki:
Minimizing Cycle Time of the Flow Line - Genetic Approach with Gene Expression. ICANNGA (1) 2007: 194-201 - 2006
- [j7]Eugeniusz Nowicki, Czeslaw Smutnicki:
Some aspects of scatter search in the flow-shop problem. Eur. J. Oper. Res. 169(2): 654-666 (2006) - 2005
- [j6]Eugeniusz Nowicki, Czeslaw Smutnicki:
An Advanced Tabu Search Algorithm for the Job Shop Problem. J. Sched. 8(2): 145-159 (2005) - [c2]Czeslaw Smutnicki, Adam Tynski:
Job-Shop Scheduling by GA. A New Crossover Operator. OR 2005: 715-720 - 2004
- [c1]Eugeniusz Nowicki, Czeslaw Smutnicki:
2D and 3D Representations of Solution Spaces for CO Problems. International Conference on Computational Science 2004: 483-490
1990 – 1999
- 1998
- [j5]Eugeniusz Nowicki, Czeslaw Smutnicki:
The flow shop with parallel machines: A tabu search approach. Eur. J. Oper. Res. 106(2-3): 226-253 (1998) - [j4]Czeslaw Smutnicki:
Some results of the worst-case analysis for flow shop scheduling. Eur. J. Oper. Res. 109(1): 66-87 (1998) - 1994
- [j3]Eugeniusz Nowicki, Czeslaw Smutnicki:
An Approximation Algorithm for a Single-Machine Scheduling Problem with Release Times and Delivery Times. Discret. Appl. Math. 48(1): 69-79 (1994) - 1993
- [j2]Eugeniusz Nowicki, Czeslaw Smutnicki:
New Results in the Worst-Case Analysis for Flow-Shop Scheduling. Discret. Appl. Math. 46(1): 21-41 (1993) - 1991
- [j1]Eugeniusz Nowicki, Czeslaw Smutnicki:
Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling. Oper. Res. Lett. 10(8): 473-480 (1991)
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-07-02 21:27 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:
