default search action
Premysl Sucha
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j33]Pavlína Koutecká
, Premysl Sucha
A machine learning approach to rank pricing problems in branch-and-price. Eur. J. Oper. Res. 320(2): 328-342 (2025) - 2024
- [i11]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
- [j32]Michal Bouska
Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness. Eur. J. Oper. Res. 308(3): 990-1006 (2023) - [c24]Nikolai Antonov
Data-driven Single Machine Scheduling Minimizing Weighted Number of Tardy Jobs. EPIA (1) 2023: 483-494 - [c23]Ondrej Mamula
The Role of AGT State Model in Hybrid AnS Resource Control Algorithms Development. ICUMT 2023: 111-117 - [c22]Martin Henych, Ondrej Mamula, Pavel Sovka, Premysl Sucha:
Machine Learning-Based Forecasting of the Automatic Frequency Restoration Reserve Demand. ISGT EUROPE 2023: 1-5 - 2022
- [j31]Pavel Milicka, Premysl Sucha, Mario Vanhoucke, Broos Maenhout
The bilevel optimisation of a multi-agent project scheduling and staffing problem. Eur. J. Oper. Res. 296(1): 72-86 (2022) - [j30]Antonín Novák
Scheduling jobs with normally distributed processing times on parallel machines. Eur. J. Oper. Res. 297(2): 422-441 (2022) - [j29]Lukás Hejl, Premysl Sucha
Minimizing the weighted number of tardy jobs on a single machine: Strongly correlated instances. Eur. J. Oper. Res. 298(2): 413-424 (2022) - [j28]Antonín Novák
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
- [j27]István Módos
On parallel dedicated machines scheduling under energy consumption limit. Comput. Ind. Eng. 159: 107209 (2021) - [j26]Ondrej Benedikt, Baran Alikoc
A polynomial-time scheduling approach to minimise idle energy consumption: An application to an industrial furnace. Comput. Oper. Res. 128: 105167 (2021) - [j25]Premysl Sucha
Nash equilibrium solutions in multi-agent project scheduling with milestones. Eur. J. Oper. Res. 294(1): 29-41 (2021) - [c21]Ondrej Benedikt, Michal Sojka, Pavel Zaykov, David Hornof, Matej Kafka, Premysl Sucha, Zdenek Hanzálek:
Thermal-Aware Scheduling for MPSoC in the Avionics Domain: Tooling and Initial Results. RTCSA 2021: 159-168 - 2020
- [j24]Alessandro Agnetis
Price of anarchy and price of stability in multi-agent project scheduling. Ann. Oper. Res. 285(1): 97-119 (2020) - [c20]Ondrej Benedikt
On Idle Energy Consumption Minimization in Production: Industrial Example and Mathematical Model. ICORES 2020: 35-46 - [c19]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 - [i10]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) - [i9]Ondrej Benedikt, Premysl Sucha, Zdenek Hanzálek:
On Idle Energy Consumption Minimization in Production: Industrial Example and Mathematical Model. CoRR abs/2005.06270 (2020)
2010 – 2019
- 2019
- [j23]Libor Bukata
Optimizing energy consumption of robotic cells by a Branch & Bound algorithm. Comput. Oper. Res. 102: 52-66 (2019) - [j22]Antonín Novák
Scheduling with uncertain processing times in mixed-criticality systems. Eur. J. Oper. Res. 279(3): 687-703 (2019) - [j21]Joel Matejka, Björn Forsberg, Michal Sojka
Combining PREM compilation and static scheduling for high-performance and predictable MPSoC execution. Parallel Comput. 85: 27-44 (2019) - [c18]István Módos, Kiryl Kalodkin, Premysl Sucha, Zdenek Hanzálek:
Scheduling on Dedicated Machines with Energy Consumption Limit. ICORES 2019: 53-62 - [c17]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 - [i8]Ondrej Benedikt
A scheduling and control approach for an industrial furnace to minimize idle energy consumption. CoRR abs/1910.07501 (2019) - 2018
- [j20]Zdenek Hanzálek
Correction to: Time symmetry of resource constrained project scheduling with general temporal constraints and take-give resources. Ann. Oper. Res. 264(1-2): 545 (2018) - [j19]Roman Václavík, Antonín Novák, Premysl Sucha
Accelerating the Branch-and-Price Algorithm Using Machine Learning. Eur. J. Oper. Res. 271(3): 1055-1069 (2018) - [j18]Zdenek Hanzálek
Preface. J. Sched. 21(2): 129-130 (2018) - [c16]Ondrej Benedikt, Premysl Sucha, István Módos
Energy-Aware Production Scheduling with Power-Saving Modes. CPAIOR 2018: 72-81 - [i7]István Módos, Premysl Sucha, Roman Václavík, Jan Smejkal, Zdenek Hanzálek:
Adaptive online scheduling of tasks with anytime property on heterogeneous resources. CoRR abs/1802.02919 (2018) - [i6]István Módos, Premysl Sucha, Zdenek Hanzálek:
Algorithms for robust production scheduling with energy consumption limits. CoRR abs/1802.03928 (2018) - [i5]Libor Bukata, Premysl Sucha, Zdenek Hanzálek, Pavel Burget:
Energy Optimization of Robotic Cells. CoRR abs/1802.05925 (2018) - [i4]Roman Václavík, Premysl Sucha, Zdenek Hanzálek:
Roster Evaluation Based on Classifiers for the Nurse Rostering Problem. CoRR abs/1804.05002 (2018) - 2017
- [j17]Zdenek Hanzálek
Time symmetry of resource constrained project scheduling with general temporal constraints and take-give resources. Ann. Oper. Res. 248(1-2): 209-237 (2017) - [j16]István Módos
Algorithms for robust production scheduling with energy consumption limits. Comput. Ind. Eng. 112: 391-408 (2017) - [j15]Cyril Briand, Sandra Ulrich Ngueveu
Finding an optimal Nash equilibrium to the multi-agent project scheduling problem. J. Sched. 20(5): 475-491 (2017) - [j14]Libor Bukata
Energy Optimization of Robotic Cells. IEEE Trans. Ind. Informatics 13(1): 92-102 (2017) - [c15]Zdenek Hanzálek
Total Setup Time Minimisation in Production Scheduling with Alternatives. HoloMAS 2017: 11-23 - [c14]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 - [c13]Antonín Novák, Zdenek Hanzálek
Scheduling of safety-critical time-constrained traffic with F-shaped messages. WFCS 2017: 1-9 - [i3]Libor Bukata, Premysl Sucha, Zdenek Hanzálek:
Solving the Resource Constrained Project Scheduling Problem Using the Parallel Tabu Search Designed for the CUDA Platform. CoRR abs/1711.04556 (2017) - [i2]Anna Minaeva, Premysl Sucha, Benny Akesson, Zdenek Hanzálek:
Scalable and Efficient Configuration of Time-Division Multiplexed Resources. CoRR abs/1711.09590 (2017) - 2016
- [j13]István Módos
Adaptive online scheduling of tasks with anytime property on heterogeneous resources. Comput. Oper. Res. 76: 95-117 (2016) - [j12]Zdenek Bäumelt, Jan Dvorák, Premysl Sucha, Zdenek Hanzálek
A novel approach for nurse rerostering based on a parallel algorithm. Eur. J. Oper. Res. 251(2): 624-639 (2016) - [j11]Roman Václavík, Premysl Sucha, Zdenek Hanzálek
Roster evaluation based on classifiers for the nurse rostering problem. J. Heuristics 22(5): 667-697 (2016) - [j10]Anna Minaeva, Premysl Sucha, Benny Akesson
Scalable and efficient configuration of time-division multiplexed resources. J. Syst. Softw. 113: 44-58 (2016) - [j9]Zdenek Hanzálek
An analysis of the non-preemptive mixed-criticality match-up scheduling problem. J. Sched. 19(5): 601-607 (2016) - [c12]István Módos
Robust scheduling for manufacturing with energy consumption limits. ETFA 2016: 1-8 - [c11]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) - 2015
- [j8]Libor Bukata
Solving the Resource Constrained Project Scheduling Problem using the parallel Tabu Search designed for the CUDA platform. J. Parallel Distributed Comput. 77: 58-68 (2015) - [j7]Alessandro Agnetis
Nash equilibria for the multi-agent project scheduling problem with controllable processing times. J. Sched. 18(1): 15-27 (2015) - [c10]Benny Akesson, Anna Minaeva, Premysl Sucha, Andrew Nelson, Zdenek Hanzálek
An efficient configuration methodology for time-division multiplexed single resources. RTAS 2015: 161-171 - 2014
- [j6]Zdenek Bäumelt, Premysl Sucha, Zdenek Hanzálek
A multistage approach for an employee timetabling problem with a high diversity of shifts as a solution for a strongly varying workforce demand. Comput. Oper. Res. 49: 117-129 (2014) - 2013
- [c9]Libor Bukata
A GPU Algorithm Design for Resource Constrained Project Scheduling Problem. PDP 2013: 367-374 - 2012
- [j5]Roman Capek, Premysl Sucha, Zdenek Hanzálek
Production scheduling with alternative process plans. Eur. J. Oper. Res. 217(2): 300-311 (2012) - 2011
- [j4]Premysl Sucha, Zdenek Hanzálek
A cyclic scheduling problem with an undetermined number of parallel identical processors. Comput. Optim. Appl. 48(1): 71-90 (2011) - 2010
- [j3]Zdenek Hanzálek
Profinet IO IRT Message Scheduling with Temporal Constraints. IEEE Trans. Ind. Informatics 6(3): 369-380 (2010) - [c8]Roman Capek, Premysl Sucha, Zdenek Hanzálek
Alternative process plans in wire harnesses production. ETFA 2010: 1-8
2000 – 2009
- 2009
- [c7]Zdenek Hanzálek
Profinet IO IRT Message Scheduling. ECRTS 2009: 57-65 - 2008
- [j2]Premysl Sucha, Zdenek Hanzálek
Deadline constrained cyclic scheduling on pipelined dedicated processors considering multiprocessor tasks and changeover times. Math. Comput. Model. 47(9-10): 925-942 (2008) - 2007
- [j1]Premysl Sucha, Zdenek Hanzálek
Scheduling of Iterative Algorithms with Matrix Operations for Efficient FPGA Design - Implementation of Finite Interval Constant Modulus Algorithm. J. VLSI Signal Process. 46(1): 35-53 (2007) - 2006
- [c6]Premysl Sucha, Zdenek Hanzálek:
Scheduling of tasks with precedence delays and relative deadlines framework for time-optimal dynamic reconfiguration of FPGAs. IPDPS 2006 - [c5]Premysl Sucha, Zdenek Hanzálek
Scheduling of Tasks with Precedence Delays and Relative Deadlines - Framework for Time-optimal Dynamic Reconfiguration of FPGAs. IPDPS 2006: 1-8 - [c4]Premysl Sucha, Zdenek Hanzálek
Efficient FPGA Implementation of Equalizer for Finite Interval Constant Modulus Algorithm. IES 2006: 1-10 - [c3]Premysl Sucha, Zdenek Hanzálek, Antonin Hermanek, Jan Schier:
Efficient FPGA Implementation of Equalizer for Finite Interval Constant Modulus Algorithm. IES 2006: 1-10 - 2005
- [c2]Zdenek Pohl, Premysl Sucha, Jiri Kadlec, Zdenek Hanzálek
Performance Tuning of Iterative Algorithms in Signal Processing. FPL 2005: 699-702 - 2004
- [c1]Premysl Sucha, Zdenek Pohl, Zdenek Hanzálek:
Scheduling of Iterative Algorithms on FPGA with Pipelined Arithmetic Unit. IEEE Real-Time and Embedded Technology and Applications Symposium 2004: 404-412
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-11-15 20:35 CET 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: