A Combinatorial Flow-based Formulation for Temporal Bin Packing Problems

•A combinatorial arcflow model for temporal bin packing problems is presented.•The layer-based networks are of much smaller size than those in the literature.•The approach is very general and applicable to further interval scheduling problems.•For the first time, all known benchmark instances can be solved to proven optimality.•New (very large) benchmark sets are designed to explore the limits of our approach.