Cover Image

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

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Juvigny, Corentin, Novák, Antonín, Mandík, Jan, Hanzálek, Zdeněk
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control Artificial Intelligence
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Green Scheduling with Time-of-Use Tariffs and Machine States: Optimizing Energy Cost via Branch-and-Bound and Bin Packing Strategies
by: Benedikt, Ondřej, et al.
Published: (2025)

Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness
by: Bouška, Michal, et al.
Published: (2024)

Integrated packing, placement, scheduling, and routing of personalized production: a pharmaceutical Industry 4.0 use-case with a planar transport system
by: Korladinov, Viktor Emil, et al.
Published: (2026)

Electrification of Transportation: A Hybrid Benders/SDDP Algorithm for Optimal Charging Station Trading
by: Sohrabi, Farnaz, et al.
Published: (2024)

Benders Decomposition for Robust Tactical Railway Crew Scheduling
by: van Rossum, B. T. C., et al.
Published: (2024)

Logic-Based Benders Decomposition for Time Slot Management with Mixed Logit Demand
by: Abdolhamidi, Dorsa, et al.
Published: (2024)

Disjunctive Benders Decomposition
by: Fang, Kaiwen, et al.
Published: (2025)

A matheuristic approach for an integrated lot-sizing and scheduling problem with a period-based learning effect
by: Rohaninejad, Mohammad, et al.
Published: (2024)

Deepest Cuts for Benders Decomposition
by: Hosseini, Mojtaba, et al.
Published: (2021)

A Benders Decomposition Approach for the k-Defensive Domination Problem
by: Varol, Bilge, et al.
Published: (2026)

Urgent Samples in Clinical Laboratories: Stochastic Batching to Minimize Patient Turnaround Time
by: Novak, Antonin, et al.
Published: (2025)

Sparse Convex Quantile Regression: A Generalized Benders Decomposition Approach
by: Luo, Xiaoyu, et al.
Published: (2025)

Accelerating Stochastic Energy System Optimization Models: Temporally Split Benders Decomposition
by: Sasanpour, Shima, et al.
Published: (2025)

Feasibility-Aware Imitation Learning for Benders Decomposition
by: Agyeman, Bernard T., et al.
Published: (2026)

Benders Decomposition for Bi-objective Linear Programs
by: Raith, Andrea, et al.
Published: (2022)

Extracting Alternative Solutions from Benders Decomposition
by: Viens, Matthew, et al.
Published: (2025)

Exact Two-Step Benders Decomposition for the Time Window Assignment Traveling Salesperson Problem
by: Celik, Sifa, et al.
Published: (2023)

Regularized Benders Decomposition for High Performance Capacity Expansion Models
by: Pecci, Filippo, et al.
Published: (2024)

Benders Decomposition using Graph Modeling and Multi-Parametric Programming
by: Brahmbhatt, Parth, et al.
Published: (2025)

Benders Decomposition for Passenger-Oriented Train Timetabling with Hybrid Periodicity
by: Yao, Zhiyuan, et al.
Published: (2025)

Graph-Based Imitation and Reinforcement Learning for Efficient Benders Decomposition
by: Agyeman, Bernard T., et al.
Published: (2025)

Parameterized Complexity of Scheduling Problems in Robotic Process Automation
by: Dvořák, Michal, et al.
Published: (2026)

Learning to Cut: Reinforcement Learning for Benders Decomposition
by: Cai, Haochen, et al.
Published: (2026)

Adaptive Subproblem Selection in Benders Decomposition for Survivable Network Design Problems
by: Donkiewicz, Tim
Published: (2026)

Solving the Integrated Bin Allocation and Collection Routing Problem for Municipal Solid Waste: a Benders Decomposition Approach
by: Mahéo, Arthur, et al.
Published: (2022)

Analyzing Performance and Scalability of Benders Decomposition for Generation and Transmission Expansion Planning Models
by: Cole, David L., et al.
Published: (2026)

A Stochastic Benders Decomposition Scheme for Large-Scale Stochastic Network Design
by: Bertsimas, Dimitris, et al.
Published: (2023)

An Efficient Benders Decomposition Approach for Optimal Large-Scale Network Slicing
by: Chen, Wei-Kun, et al.
Published: (2023)

A Framework for Handling and Exploiting Symmetry in Benders' Decomposition
by: Hojny, Christopher, et al.
Published: (2025)

Computationally efficient solution of mixed integer model predictive control problems via machine learning aided Benders Decomposition
by: Mitrai, Ilias, et al.
Published: (2023)

A Cutting-plane and Benders' Decomposition Algorithm for Two-Stage Distributionally Robust Convex programs
by: Luo, Fengqiao, et al.
Published: (2021)

On Branch-and-Price for Project Scheduling
by: Kolter, Maximilian, et al.
Published: (2025)

A Machine Learning Approach to Boost the Vehicle-2-Grid Scheduling
by: Agliardi, Gabriele, et al.
Published: (2024)

Home Battery Dispatch under a Tiered Peak Power Tariff
by: Pérez-Piñeiro, David, et al.
Published: (2023)

A Decision Diagram Approach for the Parallel Machine Scheduling Problem with Chance Constraints
by: Casassus, Nicolás, et al.
Published: (2025)

One Benders cut to rule all schedules in the neighbourhood
by: Avgerinos, Ioannis, et al.
Published: (2023)

Approximating value functions via corner Benders' cuts
by: Ota, Matheus J., et al.
Published: (2025)

EASE: Energy-Aware Job Scheduling for Vehicular Edge Networks With Renewable Energy Resources
by: Perin, Giovanni, et al.
Published: (2021)

A Robust Optimization Approach for Scheduling with Uncertain Start-Time Dependent Costs
by: Rodríguez-Ballesteros, Sofía, et al.
Published: (2026)

Projection-free computation of robust controllable sets with constrained zonotopes
by: Vinod, Abraham P., et al.
Published: (2024)