CP Model and BRKGA for Single-Machine Coupled Task Scheduling
Research Paper#Scheduling Algorithms🔬 Research|Analyzed: Jan 3, 2026 19:09•
Published: Dec 29, 2025 02:27
•1 min read
•ArXivAnalysis
This paper addresses a strongly NP-hard scheduling problem, proposing both a Constraint Programming (CP) model and a Biased Random-Key Genetic Algorithm (BRKGA) to minimize makespan. The significance lies in the combination of these approaches, leveraging the strengths of both CP for exact solutions (given sufficient time) and BRKGA for efficient exploration of the solution space, especially for larger instances. The paper also highlights the importance of specific components within the BRKGA, such as shake and local search, for improved performance.
Key Takeaways
- •Addresses a strongly NP-hard scheduling problem.
- •Proposes both a CP model and a BRKGA for solving the problem.
- •BRKGA is efficient in exploring the solution space and provides good approximate solutions.
- •CP model can find better solutions given more time and resources.
- •Shake and local search components are important for BRKGA performance.
Reference / Citation
View Original"The BRKGA can efficiently explore the problem solution space, providing high-quality approximate solutions within low computational times."