Reentrant flow shop with identical jobs and makespan criterion

Elad Shufan, Tal Grinshpoun, Ehud Ikar, Hagai Ilani

Research output: Contribution to journalArticlepeer-review


The article focuses on the problem of a reentrant flow shop with identical jobs and makespan minimisation objective. After presenting an optimal integer programming formulation for the problem, we consider the case of unit processing times. We correct two results published a few decades ago regarding two greedy heuristic algorithms. In some cases, these algorithms lead to an optimal solution, but they are generally not optimal. We point out the advantages of each of the two heuristic algorithms and, by machine learning analysis, discuss features that differentiate between them.

Original languageEnglish
Pages (from-to)183-197
Number of pages15
JournalInternational Journal of Production Research
Issue number1
StatePublished - 2023


  • Reentrant flow shop
  • identical jobs
  • integer programming
  • machine learning
  • unit processing times


Dive into the research topics of 'Reentrant flow shop with identical jobs and makespan criterion'. Together they form a unique fingerprint.

Cite this