The paper introduces B&B-SPACES, an exact branch-and-bound method with bin-packing heuristics that solves single-machine time-of-use energy scheduling about 100 times faster than prior ILP models on tested benchmarks.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Green Scheduling with Time-of-Use Tariffs and Machine States: Optimizing Energy Cost via Branch-and-Bound and Bin Packing Strategies
The paper introduces B&B-SPACES, an exact branch-and-bound method with bin-packing heuristics that solves single-machine time-of-use energy scheduling about 100 times faster than prior ILP models on tested benchmarks.