Solving Parallel Machine Scheduling With Precedences and Cumulative Resource Constraints With Calendars

2025-12-05

AI Summary

This paper addresses a parallel-machine scheduling problem arising in real-world industrial settings, featuring job precedence constraints and calendar-aware cumulative resource constraints. We formally introduce the concept of “calendarized cumulative resources”—resources whose capacity varies dynamically over time according to a calendar and exhibits cumulative behavior (e.g., energy consumption, thermal load). To solve this NP-hard problem at scale, we propose a hybrid solution framework: (i) exact modeling via constraint programming; (ii) constructive heuristic initialization; and (iii) a custom neighborhood-search metaheuristic tailored to the problem’s structural properties. The approach ensures both scalability—handling instances with up to ten thousand jobs—and high solution quality. Deployed on actual production lines, it achieves an average 32% reduction in job tardiness and a 19% decrease in peak resource load. This work delivers a practical, industrial-grade solution for large-scale, highly constrained scheduling—bridging the gap between theoretical rigor and operational feasibility.

Technology Category

• Planning, Routing, and Scheduling: Learning for Planning and Scheduling
• Constraint Satisfaction and Optimization: Constraint Programming
• Search and Optimization: Mixed Discrete/Continuous Search

Application Category

• Graph Algorithms and Modeling for the Web: Efficient manipulation of static and dynamic Web-related graphs
• Search and Retrieval-Augmented AI: Efficiency and scalability of Web search engines
• Systems and Infrastructure for Web, Mobile and WoT: Experiences and lessons learnt from Web-based algorithms and system deployments

Abstract

The task of finding efficient production schedules for parallel machines is a challenge that arises in most industrial manufacturing domains. There is a large potential to minimize production costs through automated scheduling techniques, due to the large-scale requirements of modern factories. In the past, solution approaches have been studied for many machine scheduling variations, where even basic variants have been shown to be NP-hard. However, in today's real-life production environments, additional complex precedence constraints and resource restrictions with calendars arise that must be fulfilled. These additional constraints cannot be tackled efficiently by existing solution techniques. Thus, there is a strong need to develop and analyze automated methods that can solve such real-life parallel machine scheduling scenarios. In this work, we introduce a novel variant of parallel machine scheduling with job precedences and calendar-based cumulative resource constraints that arises in real-life industrial use cases. A constraint modeling approach is proposed as an exact solution method for small scheduling scenarios together with state-of-the-art constraint-solving technology. Further, we propose a construction heuristic as well as a tailored metaheuristic using local search to efficiently tackle large-scale problem instances. This metaheuristic approach has been deployed and is currently being used in an industrial setting.

Problem

• Scheduling parallel machines with complex constraints
• Addressing precedence and calendar-based resource restrictions
• Developing automated methods for real-life industrial scenarios

Innovation

• Constraint modeling approach for exact small-scale solutions
• Construction heuristic for initial large-scale scheduling
• Tailored metaheuristic using local search for industrial deployment