#### Filter Results:

- Full text PDF available (1)

#### Publication Year

1999

2016

- This year (0)
- Last 5 years (6)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Samia Kouki, Mohamed Jemni, Talel Ladhari
- 2012 IEEE 15th International Conference on…
- 2012

This paper deals with solving the permutation flow shop problem (PFSP) which is an NP-hard scheduling problem using grid computing. As the sequential resolution of this problem can be sometimes impossible on a single machine and especially for instances of large data, we are interested in this work by solving the PFSP using parallel programming. In a… (More)

- Samia Kouki, Talel Ladhari, Mohamed Jemni
- ICA3PP
- 2010

The optimization of scheduling problems is based on different criteria to optimize. One of the most important criteria is the minimization of completion time of the last task on the last machine called makespan. In this paper, we present a parallel algorithm for solving the permutation flow shop problem. Our algorithm is a basic parallel distributed… (More)

- Samia Kouki, Mohamed Jemni, Talel Ladhari
- FGIT-GDC/CA
- 2010

- Samia Kouki, Mohamed Jemni, Talel Ladhari
- 2013 Eighth International Conference on P2P…
- 2013

The study of the Permutation Flow Shop Problem (PFSP) is still of great interest in the community. Reducing the execution time of some very costly instances and/or solving new unresolved instances remain a challenge. The PFSP consists on scheduling n jobs in m machines with make span criterion. Our approach to resolve this problem is based on a parallel… (More)

- Samia Kouki, Mohamed Jemni, Talel Ladhari
- 2010 10th Annual International Conference on New…
- 2010

This paper deals with the resolution of the Permutation Flow Shop Problem (PFSP) which requires scheduling n jobs through m machines that are placed in series so as to minimize the makespan. In this study, we focus on parallel methods for solving the one-machine PFSP. We present a parallel distributed Algorithm for this problem with extensive computational… (More)

- Samia Kouki, Mohamed Jemni, Talel Ladhari
- PARCO
- 2013

- Samia Kouki, Manel Guenaoui, Mohamed Jemni
- ISNCC
- 2016

In this paper, the Permutation Flow Shop Problem (PFSP) with total completion time is studied. In previous papers, we proposed parallel algorithms to solve the PFSP based on load balancing Branch and Bound approach. In this work, we propose other alternatives based on Genetic Algorithms to solve this problem. However, using efficiently genetic algorithm… (More)

- H R Mouelhi, Samia Kouki, +4 authors Najmeddine Ben Abdallah
- International journal of developmental…
- 2015

- Samia Kouki, Mohamed Jemni, Talel Ladhari
- 2015 5th International Conference on Information…
- 2015

Solving NP-hard combinatorial optimization problems by exact search methods, such as Branch-and-Bound, may degenerate to complete enumeration. For that reason, exact approaches limits us to solve only small or moderate size problem instances, due to the exponential increase in CPU time when problem size increases. One of the most promising ways to reduce… (More)