86. An efficient genetic algorithm to minimize the makespan in a scheduling problem
WAITINGInvited abstract in session TD-2: Heuristic scheduling, stream Heuristic scheduling.
Thursday, 14:30 - 16:00Room: M228
Authors (first author is the speaker)
| 1. | Nacira CHIKHI
|
| USTHB University |
Abstract
In this paper, we investigate a two stage flow shop problem to minimize the maximum completion time (makespan). The problem consists of two-stage flow shop with dedicated machines. The jobs are transported by a robot with unit
capacity, to be executed at the second stage. Several variations of this model have been used in industry and in theoretical studies. Practice has shown, however, that the transportation times between machines or stages should be taken into consideration given its importance in the industry of today. Since this problem is NP-Hard, we propose an efficient genetic algorithm to tackle it. An experimental study is conducted to evaluate the efficiency of our proposed genetic algorithm
Keywords
- Scheduling
- Heuristics and meta-heuristics
- Combinatorial Optimization
Status: accepted
Back to the list of papers