Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.


Download BibTeX


Constraint Programming for Flexible Flow Shop Scheduling Problem with Repeated Jobs and Repeated Operations


[ 1 ] Instytut Technologii Materiałów, Wydział Inżynierii Mechanicznej, Politechnika Poznańska | [ P ] employee

Scientific discipline (Law 2.0)

[2.9] Mechanical engineering

Year of publication


Published in

Advances in Science and Technology Research Journal

Journal year: 2023 | Journal volume: vol. 17 | Journal number: no. 3

Article type

scientific article

Publication language


  • flexible flow shop scheduling problem
  • constraint programming
  • heuristics

EN The manufacturing process relies heavily on production scheduling to guarantee effective production schedules, reduce costs and product shortages, and get away from delays, interruptions, and waste products. Scheduling issues have been effectively solved via constraint programming. In this paper, we consider a constraint programming formulation of the flexible flow shop scheduling problem with repeated jobs and operations repetitions. We also implemented seven fast heuristics and compared the results with the constraint programming solution. The results from using the CPLEX solver as a solution tool were satisfactory. Computational experiments demonstrate that using constraint programming can be significantly more advantageous than using heuristics.

Date of online publication


Pages (from - to)

280 - 293




License type

CC BY (attribution alone)

Open Access Mode

open journal

Open Access Text Version

final published version

Date of Open Access to the publication

at the time of publication

Ministry points / journal


Impact Factor

1,1 [List 2022]

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.