default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGrzegorz Waligóra
Person information
- affiliation: Poznan University of Technology, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c16]Tomasz Pecyna
, Krzysztof Kurowski, Rafal Rózycki, Grzegorz Waligóra, Jan Weglarz:
Quantum Variational Algorithms for the Aircraft Deconfliction Problem. ICCS (6) 2024: 307-320- [i1]Mateusz Slysz, Krzysztof Kurowski, Grzegorz Waligóra:
Solving Combinatorial Optimization Problems on a Photonic Quantum Computer. CoRR abs/2409.13781 (2024) - 2023
- [j20]Krzysztof Kurowski, Tomasz Pecyna, Mateusz Slysz, Rafal Rózycki, Grzegorz Waligóra, Jan Weglarz:
Application of quantum approximate optimization algorithm to job shop scheduling problem. Eur. J. Oper. Res. 310(2): 518-528 (2023) - [c15]Mateusz Slysz, Krzysztof Kurowski, Grzegorz Waligóra, Jan Weglarz:
Exploring the Capabilities of Quantum Support Vector Machines for Image Classification on the MNIST Benchmark. ICCS (5) 2023: 193-200 - [c14]Rafal Rózycki, Grzegorz Waligóra, Przemyslaw Grobelny:
Scheduling Charging Jobs in the System of an Autonomous Charging Station under Power and Energy Constraints. MMAR 2023: 452-456 - 2022
- [c13]Grzegorz Waligóra:
Genetic Algorithm for Resource Leveling Problems under Various Objective Functions. MMAR 2022: 414-418 - 2021
- [j19]Tomasz Ciesielczyk, Alberto Cabrera Pérez, Ariel Oleksiak, Wojciech Piatek, Grzegorz Waligóra, Francisco Almeida, Vicente Blanco Pérez:
An approach to reduce energy consumption and performance losses on heterogeneous servers using power capping. J. Sched. 24(5): 489-505 (2021) - [c12]Rafal Rózycki, Grzegorz Waligóra, Tomasz Lemanski:
Evolutionary Algorithm for Scheduling Battery Charging Jobs with Decreasing Power Demands to Minimize the Makespan. MMAR 2021: 275-280 - 2020
- [c11]Krzysztof Kurowski, Jan Weglarz, Marek Subocz, Rafal Rózycki, Grzegorz Waligóra:
Hybrid Quantum Annealing Heuristic Method for Solving Job Shop Scheduling Problem. ICCS (6) 2020: 502-515
2010 – 2019
- 2019
- [j18]Rafal Rózycki, Grzegorz Waligóra:
On a certain class of power- and energy-related scheduling problems. Discret. Appl. Math. 264: 167-187 (2019) - [c10]Rafal Rózycki, Grzegorz Waligóra:
Scheduling identical jobs with linear resource usage profile to minimize schedule length. MMAR 2019: 170-174 - 2018
- [c9]Rafal Rózycki, Grzegorz Waligóra:
Power-Aware Scheduling of Preemptable Independent Jobs on a Single Processor to Meet a Schedule Deadline. MMAR 2018: 943-946 - 2017
- [c8]Rafal Rózycki, Grzegorz Waligóra:
Energy-aware scheduling of jobs performed sequentially. MMAR 2017: 453-457 - [c7]Grzegorz Waligóra:
Metaheuristics for some discrete-continuous project scheduling problems to maximize the net present value. MMAR 2017: 471-476 - 2016
- [j17]Rafal Rózycki, Grzegorz Waligóra, Jan Weglarz:
Scheduling Preemptable Jobs on Identical Processors Under Varying Availability of an Additional Continuous Resource. Int. J. Appl. Math. Comput. Sci. 26(3): 693-706 (2016) - [j16]Grzegorz Waligóra:
Comparative Analysis of Some Metaheuristics for Discrete-Continuous Project Scheduling with Activities of Identical Processing Rates. Asia Pac. J. Oper. Res. 33(3): 1650015:1-1650015:32 (2016) - [c6]Grzegorz Waligóra, Rafal Rózycki:
Heuristic solving some discrete-continuous project scheduling problems with discounted cash flows. MMAR 2016: 971-974 - [c5]Rafal Rózycki, Grzegorz Waligóra:
Optimal allocation of power - Graphical interpretation of some scheduling problem. MMAR 2016: 975-980 - 2015
- [c4]Grzegorz Waligóra:
Genetic algorithm for a discrete-continuous project scheduling problem with discounted cash flows. MMAR 2015: 52-57 - 2014
- [j15]Grzegorz Waligóra:
Discrete-continuous project scheduling with discounted cash inflows and various payment models - a review of recent results. Ann. Oper. Res. 213(1): 319-340 (2014) - [j14]Grzegorz Waligóra:
Simulated Annealing and Tabu Search for Discrete-Continuous Project Scheduling with Discounted Cash Flows. RAIRO Oper. Res. 48(1): 1-24 (2014) - [c3]Marek Mika, Rafal Rózycki, Grzegorz Waligóra:
Algorithm for optimal allocation of a continuous resource varying over time. MMAR 2014: 824-827 - 2012
- [c2]Marek Mika, Rafal Rózycki, Grzegorz Waligóra:
Some new concepts of setup costs in multimode resource-constrained project scheduling problem. MMAR 2012: 470-474 - 2011
- [j13]Grzegorz Waligóra:
Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan. Comput. Optim. Appl. 48(2): 399-421 (2011) - [j12]Jan Weglarz, Joanna Józefowska, Marek Mika, Grzegorz Waligóra:
Project scheduling with finite or infinite number of activity processing modes - A survey. Eur. J. Oper. Res. 208(3): 177-205 (2011) - [j11]Marek Mika, Grzegorz Waligóra, Jan Weglarz:
Modelling and solving grid resource allocation problem with network resources for workflow applications. J. Sched. 14(3): 291-306 (2011) - [c1]Marek Mika, Rafal Rózycki, Grzegorz Waligóra:
Local search metaheuristics for some discrete-continuous project scheduling problems with discounted cash flows. MMAR 2011: 27-32
2000 – 2009
- 2009
- [j10]Grzegorz Waligóra:
Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation. Eur. J. Oper. Res. 193(3): 849-856 (2009) - 2008
- [j9]Grzegorz Waligóra:
Discrete-continuous project scheduling with discounted cash flows - A tabu search approach. Comput. Oper. Res. 35(7): 2141-2153 (2008) - [j8]Marek Mika, Grzegorz Waligóra, Jan Weglarz:
Tabu search for multi-mode resource-constrained project scheduling with schedule-dependent setup times. Eur. J. Oper. Res. 187(3): 1238-1250 (2008) - 2005
- [j7]Marek Mika, Grzegorz Waligóra, Jan Weglarz:
Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models. Eur. J. Oper. Res. 164(3): 639-668 (2005) - 2004
- [j6]Joanna Józefowska, Marek Mika, Rafal Rózycki, Grzegorz Waligóra, Jan Weglarz:
An Almost Optimal Heuristic for Preemptive Cmax Scheduling of Dependent Tasks on Parallel Identical Machines. Ann. Oper. Res. 129(1-4): 205-216 (2004) - 2002
- [j5]Joanna Józefowska, Grzegorz Waligóra, Jan Weglarz:
Tabu list management methods for a discrete-continuous scheduling problem. Eur. J. Oper. Res. 137(2): 288-302 (2002) - 2001
- [j4]Joanna Józefowska, Marek Mika, Rafal Rózycki, Grzegorz Waligóra, Jan Weglarz:
Simulated Annealing for Multi-Mode Resource-Constrained Project Scheduling. Ann. Oper. Res. 102(1-4): 137-155 (2001) - 2000
- [j3]Joanna Józefowska, Marek Mika, Rafal Rózycki, Grzegorz Waligóra, Jan Weglarz:
Solving the discrete-continuous project scheduling problem via its discretization. Math. Methods Oper. Res. 52(3): 489-499 (2000)
1990 – 1999
- 1999
- [j2]Joanna Józefowska, Marek Mika, Rafal Rózycki, Grzegorz Waligóra, Jan Weglarz:
Discrete-continuous Scheduling to Minimize the Makespan for Power Processing Rates of Jobs. Discret. Appl. Math. 94(1-3): 263-285 (1999) - 1998
- [j1]Joanna Józefowska, Marek Mika, Rafal Rózycki, Grzegorz Waligóra, Jan Weglarz:
Local search metaheuristics for discrete-continuous scheduling problems. Eur. J. Oper. Res. 107(2): 354-370 (1998)
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-10-22 21:17 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:
