default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAntonín Novák
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i4]Michal Bouska, Premysl Sucha, Antonín Novák, Zdenek Hanzálek:
Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness. CoRR abs/2402.14847 (2024)- 2023
- [j8]Michal Bouska
, Premysl Sucha, Antonín Novák, Zdenek Hanzálek:
Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness. Eur. J. Oper. Res. 308(3): 990-1006 (2023) - [c9]Antonín Novák, Matous Pikous, Zdenek Hanzálek:
Optimization of Circular Conveyor Belt Systems with Multi-Commodity Network Flows. ICORES 2023: 203-210 - [i3]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
- [j7]Antonín Novák, Zdenek Hanzálek:
Computing the execution probability of jobs with replication in mixed-criticality schedules. Ann. Oper. Res. 309(1): 209-232 (2022) - [j6]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) - [j5]Antonín Novák, Premysl Sucha, Matej Novotny, Richard Stec, Zdenek Hanzálek:
Scheduling jobs with normally distributed processing times on parallel machines. Eur. J. Oper. Res. 297(2): 422-441 (2022) - [j4]Lukás Hejl, Premysl Sucha, Antonín Novák, Zdenek Hanzálek:
Minimizing the weighted number of tardy jobs on a single machine: Strongly correlated instances. Eur. J. Oper. Res. 298(2): 413-424 (2022) - [j3]Antonín Novák, Andrzej Gnatowski, Premysl Sucha:
Distributionally robust scheduling algorithms for total flow time minimization on parallel machines using norm regularizations. Eur. J. Oper. Res. 302(2): 438-455 (2022) - 2021
- [c8]Jaroslav Klapálek, Antonín Novák, Michal Sojka, Zdenek Hanzálek:
Car Racing Line Optimization with Genetic Algorithm using Approximate Homeomorphism. IROS 2021: 601-607 - 2020
- [c7]Michal Bouska, Antonín Novák, Premysl Sucha, István Módos, Zdenek Hanzálek:
Data-driven Algorithm for Scheduling with Total Tardiness. ICORES 2020: 59-68 - [i2]Michal Bouska, Antonín Novák, Premysl Sucha, István Módos, Zdenek Hanzálek:
Data-driven Algorithm for Scheduling with Total Tardiness. CoRR abs/2005.05579 (2020)
2010 – 2019
- 2019
- [j2]Antonín Novák, Premysl Sucha, Zdenek Hanzálek:
Scheduling with uncertain processing times in mixed-criticality systems. Eur. J. Oper. Res. 279(3): 687-703 (2019) - [c6]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 - [c5]Marek Vlk, Antonín Novák, Zdenek Hanzálek:
Makespan Minimization with Sequence-dependent Non-overlapping Setups. ICORES 2019: 91-101 - [c4]Richard Stec, Antonín Novák, Premysl Sucha, Zdenek Hanzálek:
Scheduling Jobs with Stochastic Processing Time on Parallel Identical Machines. IJCAI 2019: 5628-5634 - 2018
- [j1]Roman Václavík, Antonín Novák, Premysl Sucha, Zdenek Hanzálek:
Accelerating the Branch-and-Price Algorithm Using Machine Learning. Eur. J. Oper. Res. 271(3): 1055-1069 (2018) - 2017
- [c3]Antonín Novák, Premysl Sucha, Zdenek Hanzálek:
Exact Approach to the Scheduling of F-shaped Tasks with Two and Three Criticality Levels. ICORES 2017: 160-170 - [c2]Antonín Novák, Zdenek Hanzálek, Premysl Sucha:
Scheduling of safety-critical time-constrained traffic with F-shaped messages. WFCS 2017: 1-9 - 2016
- [c1]Antonín Novák, Premysl Sucha, Zdenek Hanzálek:
Efficient Algorithm for Jitter Minimization in Time-Triggered Periodic Mixed-Criticality Message Scheduling Problem. RTNS 2016: 23-31 - [i1]Antonín Novák, Premysl Sucha, Zdenek Hanzálek:
On Solving Non-preemptive Mixed-criticality Match-up Scheduling Problem with Two and Three Criticality Levels. CoRR abs/1610.07384 (2016)
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 20:33 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:
