Genetic Algorithm for Open Shop Scheduling Problem

In this paper, we present a genetic algorithm for the open shop scheduling problem. We use a simple and efficient chromosome representation based on the job's occurrence and the fitness function reflect the length of the schedule. The solutions obtained after performing the different operators...

Full description

Saved in:
Bibliographic Details
Main Authors: Benziani, Yacine, Kacem, Imed, Laroche, Pierre
Format: Conference Proceeding
Language:English
Subjects:
Biological cells
Genetic algorithms
Job shop scheduling
Schedules
Sociology
Statistics
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we present a genetic algorithm for the open shop scheduling problem. We use a simple and efficient chromosome representation based on the job's occurrence and the fitness function reflect the length of the schedule. The solutions obtained after performing the different operators of the genetic algorithm are always feasible. Heuristic approaches are also developed to generate the initial population and to improve the obtained solutions. The algorithm was implemented and computational results show interesting result.
ISSN:2576-3555
DOI:10.1109/CoDIT.2018.8394932