International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 66 - Issue 24 |
Published: March 2013 |
Authors: Hemmak Allaoua, Bouderah Brahim |
![]() |
Hemmak Allaoua, Bouderah Brahim . Hybrid Algorithm for Optimization Problems Applied to Single Machine Scheduling. International Journal of Computer Applications. 66, 24 (March 2013), 7-11. DOI=10.5120/11262-5749
@article{ 10.5120/11262-5749, author = { Hemmak Allaoua,Bouderah Brahim }, title = { Hybrid Algorithm for Optimization Problems Applied to Single Machine Scheduling }, journal = { International Journal of Computer Applications }, year = { 2013 }, volume = { 66 }, number = { 24 }, pages = { 7-11 }, doi = { 10.5120/11262-5749 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2013 %A Hemmak Allaoua %A Bouderah Brahim %T Hybrid Algorithm for Optimization Problems Applied to Single Machine Scheduling%T %J International Journal of Computer Applications %V 66 %N 24 %P 7-11 %R 10.5120/11262-5749 %I Foundation of Computer Science (FCS), NY, USA
In this paper, we will present a new variant of genetic algorithm to solve optimization problems where the number of feasible solutions is very important. This approach consists on a hybrid algorithm between genetic algorithms introduced by J. Holland (1975) and dynamic programming method of R. Bellman (1957). Then we will apply this hybrid algorithm to solve a single machine scheduling problem that consists to minimizing the sum of earliness and tardiness costs with common due date. Our goal is designing a new approach to find a good near solutions for combinatory problems as scheduling problems or traveling salesman problem which have an exponential number of solutions and known as NP-hard problems.