Randa Ouchene

Randa Ouchene

Auto-generated profile, based on publicly available information

Randa Ouchene


Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 June 2023 in Computers & Industrial Engineering
Verified
Journal Article
Closed access
RORanda Ouchene
Randa Ouchene
DRDjamal Rebaine
Djamal Rebaine
PBPierre Baptiste
Pierre Baptiste

7 May 2025 in RAIRO - Operations Research
Verified
Journal Article
Open access
PDF file
RORanda Ouchene
Randa Ouchene
DRDjamal Rebaine
Djamal Rebaine
PBPierre Baptiste
Pierre Baptiste
The flow shop scheduling problem is traditionally studied under the assumption that the optimal solution is a permutation schedule. However, for many practical problems, this may not be the case. Since finding a flow shop schedule is significantly simpler with the permutation consideration restrection, it becomes interesting to know a priori at what extent relaxing this constraint could be beneficial. In this paper, we study the conditions under which this assumption holds, particularly in flow shops with missing operations. We focus our analysis on the makespan and total completion time. Preliminary results show that, in certain cases, non-permutation schedules can yield significantly better outcomes.