31 citations · 63 across the 8 of their papers we have counts for
8 papers
Green Scheduling with Time-of-Use Tariffs and Machine States: Optimizing Energy Cost via Branch-and-Bound and Bin Packing Strategies
Ondřej Benedikt, István Módos, Antonin Novak +1
This paper presents a branch-and-bound algorithm, enhanced with bin packing strategies, for scheduling under variable energy pricing and power-saving states. The proposed algorithm…
Bottleneck Identification in Resource-Constrained Project Scheduling via Constraint Relaxation
Lukáš Nedbálek, Antonín Novák
In realistic production scenarios, Advanced Planning and Scheduling (APS) tools often require manual intervention by production planners, as the system works with incomplete inform…
Reduction of Nonlinear Distortion in Condenser Microphones Using a Simple Post-Processing Technique
Petr Honzík, Antonin Novak
In this paper, we introduce a novel approach for effectively reducing nonlinear distortion in single back-plate condenser microphones, i.e., most MEMS microphones, studio recording…
Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness
Michal Bouška, Přemysl Šůcha, Antonín Novák +1
In this paper, we investigate the use of the deep learning method for solving a well-known NP-hard single machine scheduling problem with the objective of minimizing the total tard…
Constraint Programming and Constructive Heuristics for Parallel Machine Scheduling with Sequence-Dependent Setups and Common Servers
Vilém Heinz, Antonín Novák, Marek Vlk +1
This paper examines scheduling problem denoted as in Graham's notation; in other words, scheduling of tasks on parallel identical machines () with sequence-…
Design of an electronic circuit for loudspeaker real-time digital signal processing
Oliver Munroe, Stephane Letourneur, Antonin Novak
In modern audio systems, real-time digital signal processing algorithms are widely used for a variety of applications. The possibility of using a simple electronic circuit for vari…
Data-driven Algorithm for Scheduling with Total Tardiness
Michal Bouška, Antonín Novák, Přemysl Šůcha +2
In this paper, we investigate the use of deep learning for solving a classical NP-Hard single machine scheduling problem where the criterion is to minimize the total tardiness. Ins…
On Solving Non-preemptive Mixed-criticality Match-up Scheduling Problem with Two and Three Criticality Levels
Antonin Novak, Premysl Sucha, Zdenek Hanzalek
In this paper, we study an NP-hard problem of a single machine scheduling minimizing the makespan, where the mixed-critical tasks with an uncertain processing time are scheduled. W…