default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarek Mika
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
- 2021
[j10]Bartosz Belter
, Marek Mika, Jan Weglarz:
Scheduling of network tasks to minimize the consumed energy. Int. Trans. Oper. Res. 28(1): 168-200 (2021)
2010 – 2019
- 2015
- [c4]Marek Mika:
An "on/off" model for energy-efficient scheduling of workflow applications in computational grids. MMAR 2015: 1006-1009 - 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
- [j9]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) - [j8]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
- 2008
- [j7]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
- [j6]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
- [j5]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) - 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-05-02 21:46 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:
