A competitive constraint programming approach for the group shop scheduling problem

Francisco Yuraszeck, Gonzalo Mejia, Dario Canut-De-Bon

Research output: Contribution to journalConference articlepeer-review

1 Citation (Scopus)


In this paper, we propose a competitive Constraint Programming (CP) approach to solve the Group Shop Scheduling Problem (GSSP) under the makespan minimization criteria. Our contribution is two-fold: we provide a flexible mathematical formulation to solve the GSSP that can be used without change to solve other closed-related scheduling problems such as the Open Shop Scheduling Problem (OSSP), Job Shop Scheduling Problem (JSSP), and Mixed Shop Scheduling Problem (MSSP); and we improve several lower bounds and upper bounds from 130 classical GSSP instances from the literature. We evaluate our approach by comparing the performance with competitive methods mainly based on metaheuristics, where we were able to prove optimality in more than 85% of the instances in competitive running time, with a relative percentage deviation lower than 3% on average. In contrast to metaheuristics approaches, our CP method does not require calibrations of multiple parameters, several replicates for each instance, and complex computational coding to be competitive in both, solution quality and computational running times.

Original languageEnglish
Pages (from-to)946-951
Number of pages6
JournalProcedia Computer Science
Publication statusPublished - 2023
Event14th International Conference on Ambient Systems, Networks and Technologies Networks, ANT 2023 and The 6th International Conference on Emerging Data and Industry 4.0, EDI40 2023 - Leuven, Belgium
Duration: 15 Mar 202317 Mar 2023


  • constraint programming
  • group shop
  • metaheuristics
  • mixed shop
  • scheduling
  • stage shop

ASJC Scopus subject areas

  • General Computer Science


Dive into the research topics of 'A competitive constraint programming approach for the group shop scheduling problem'. Together they form a unique fingerprint.

Cite this