default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarek Vlk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i1]Vilém Heinz, Antonín Novák, Marek Vlk, Zdenek Hanzálek:
Constraint Programming and Constructive Heuristics for Parallel Machine Scheduling with Sequence-Dependent Setups and Common Servers. CoRR abs/2305.19888 (2023)- 2022
- [j4]Vilém Heinz
, Antonín Novák, Marek Vlk, Zdenek Hanzálek:
Constraint Programming and constructive heuristics for parallel machine scheduling with sequence-dependent setups and common servers. Comput. Ind. Eng. 172(Part): 108586 (2022) - [j3]Marek Vlk, Katerina Brejchová, Zdenek Hanzálek, Siyu Tang:
Large-scale periodic scheduling in time-sensitive networks. Comput. Oper. Res. 137: 105512 (2022) - 2021
- [j2]Marek Vlk, Zdenek Hanzálek, Siyu Tang:
Constraint programming approaches to joint routing and scheduling in time-sensitive networks. Comput. Ind. Eng. 157: 107317 (2021) - 2020
- [j1]Marek Vlk, Zdenek Hanzálek, Katerina Brejchová, Siyu Tang, Sushmit Bhattacharjee, Songwei Fu:
Enhancing Schedulability and Throughput of Time-Triggered Traffic in IEEE 802.1Qbv Time-Sensitive Networks. IEEE Trans. Commun. 68(11): 7023-7038 (2020)
2010 – 2019
- 2019
- [c9]Jirí Svancara, Marek Vlk, Roni Stern, Dor Atzmon, Roman Barták:
Online Multi-Agent Pathfinding. AAAI 2019: 7732-7739 - [c8]Marek Vlk, Antonín Novák, Zdenek Hanzálek, Arnaud Malapert:
Non-overlapping Sequence-Dependent Setup Scheduling with Dedicated Tasks. ICORES (Selected Papers) 2019: 23-46 - [c7]Marek Vlk, Antonín Novák, Zdenek Hanzálek:
Makespan Minimization with Sequence-dependent Non-overlapping Setups. ICORES 2019: 91-101 - 2018
- [c6]Roman Barták, Jiri Svancara, Marek Vlk:
A Scheduling-Based Approach to Multi-Agent Path Finding with Weighted and Capacitated Arcs. AAMAS 2018: 748-756 - [c5]Ondrej Benedikt, Premysl Sucha, István Módos, Marek Vlk, Zdenek Hanzálek:
Energy-Aware Production Scheduling with Power-Saving Modes. CPAIOR 2018: 72-81 - 2017
- [c4]Marek Vlk, Roman Barták, Zdenek Hanzálek:
Minimization of useless work in resource failure recovery of workflow schedules. ETFA 2017: 1-8 - 2016
- [c3]Roman Barták, Marek Vlk:
Hierarchical Task Model for Resource Failure Recovery in Production Scheduling. MICAI (1) 2016: 362-378 - 2015
- [c2]Roman Barták, Marek Vlk:
Reactive Recovery from Machine Breakdown in Production Scheduling with Temporal Distance and Resource Constraints. ICAART (2) 2015: 119-130 - [c1]Roman Barták, Marek Vlk:
Machine Breakdown Recovery in Production Scheduling with Simple Temporal Constraints. ICAART (Revised Selected Papers) 2015: 185-206
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-04-29 21:22 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:
