activity
20242026
most citedReinforcement Learning for Search Tree Size Minimization in Constraint Programming: New Results on Scheduling Benchmarks

6 citations · 23 across the 15 of their papers we have counts for

collaborators

16 papers

math.OC2026

Integrated packing, placement, scheduling, and routing of personalized production: a pharmaceutical Industry 4.0 use-case with a planar transport system

Viktor Emil Korladinov, Antonin Novak, Zdeněk Hanzálek +2

The recent emergence of planar transport systems necessitates re-evaluation of Flexible Manufacturing Systems (FMS) to address the simultaneous scheduling of internal logistics and…

cs.NI2026

Periodic Scheduling of Grouped Time-Triggered Signals on a Single Resource

Josef Grus, Zdeněk Hanzálek, Claire Hanen

Time-triggered messages are of crucial importance in modern communication networks. Offline-generated schedules, which specify start times for periodic messages, enable us to achie…

math.OC2026

Resource-constrained Project Scheduling with Time-of-Use Energy Tariffs and Machine States: A Logic-based Benders Decomposition Approach

Corentin Juvigny, Antonín Novák, Jan Mandík +1

In this paper, we investigate the Resource-Constrained Project Scheduling Problem (RCPSP) with Time-of-Use (TOU) energy tariffs and machine states, a variant of RCPSP for productio…

cs.CG2025

Hierarchical Rectangle Packing Solved by Multi-Level Recursive Logic-based Benders Decomposition

Josef Grus, Zdeněk Hanzálek, Christian Artigues +2

We study the two-dimensional hierarchical rectangle packing problem, motivated by applications in analog integrated circuit layout, facility layout, and logistics. Unlike classical…

cs.LG20256 cited

Reinforcement Learning for Search Tree Size Minimization in Constraint Programming: New Results on Scheduling Benchmarks

Vilém Heinz, Petr Vilím, Zdeněk Hanzálek

Failure-Directed Search (FDS) is a significant complete generic search algorithm used in Constraint Programming (CP) to efficiently explore the search space, proven particularly ef…

math.OC2025

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…