#### Filter Results:

- Full text PDF available (1)

#### Publication Year

2015

2016

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

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Nouri Nouha, Talel Ladhari
- GECCO
- 2015

The objective of this work is to present and evaluate meta-heuristics for the blocking permutation flow shop scheduling problem subject to regular objectives. The blocking problem is known to be NP-hard with more than two machines. We assess the difficulty level of this problem by developing two population-based meta-heuristics: Genetic Algorithm and… (More)

- Nouri Nouha, Talel Ladhari
- CSOC
- 2016

- Nouri Nouha, Talel Ladhari
- Polibits
- 2016

We propose in this paper a Blocking Iterated Greedy algorithm (BIG) which makes an adjustment between two relevant destruction and construction stages to solve the blocking flow shop scheduling problem and minimize the maximum completion time (makespan). The greedy algorithm starts from an initial solution generated based on some well-known heuristic. Then,… (More)

- Nouri Nouha, Talel Ladhari
- EUMAS/AT
- 2015

- ‹
- 1
- ›