Sign in
Back
Genetic Local Search Algorithm for minimizing the total completion time in single machine scheduling problem with release dates and precedence constraints
Conference proceeding

Genetic Local Search Algorithm for minimizing the total completion time in single machine scheduling problem with release dates and precedence constraints

Ichraf Zaidi, Mehdi Mrad, Talel Ladhari and IEEE
2013 5TH INTERNATIONAL CONFERENCE ON MODELING, SIMULATION AND APPLIED OPTIMIZATION (ICMSAO), pp.1-4
International Conference on Modeling Simulation and Applied Optimization
01/01/2013
DOI: https://doi.org/10.1109/ICMSAO.2013.6552617

Abstract

Computer Science Computer Science, Information Systems Computer Science, Interdisciplinary Applications Engineering Engineering, Electrical & Electronic Science & Technology Technology
In this work we investigate the single machine scheduling problem with release dates and precedence constraints for minimizing the sum of completion times. To solve this problem approximately, we propose three constructive heuristics as well as a genetic local search algorithm. Computational results show that the proposed genetic local search algorithm yields near-optimal solutions and provides interesting results.

Metrics

1 Record Views

Details