Call for Papers 2020

Jun 2020 - Volume 11, Issue 3
Deadline: 15 May 2020
Due to COVID-19 deadline extended to 31-May-2020
Notification: 15 Jun 2020
Publication: 30 Jun 2020

Aug 2020 - Volume 11, Issue 4
Deadline: 15 Jul 2020
Notification: 15 Aug 2020
Publication: 31 Aug 2020


Indexed in

IJCSE Indexed in Scopus


Title : Solving Scheduling problems using Selective Breeding Algorithm and Hybrid Algorithm
Authors : P.Sriramya, B.Parvathavarthini, M.Chandrasekaran
Keywords : Scheduling; Benchmark Problems; Selective Breeding Algorithm; Hybrid Algorithm
Issue Date : Apr-May 2013
Abstract :
The n-job, m-machine scheduling problem is one of the general scheduling problems in a system. Scheduling problems vary widely according to specific production tasks but most are NP-hard problems. Scheduling problems are usually solved using heuristics to get optimal or near optimal solutions because problems found in practical applications cannot be solved to optimality using reasonable resources in many cases. In this paper, Selective Breeding Algorithm (SBA) and Hybrid Algorithm (HA) are used for finding optimal for different size benchmark problems. Hybrid Algorithm has Artificial Immune system and shifting bottleneck procedure. The results show that the Selective Breeding algorithm is an efficient and effective algorithm that gives better results than other algorithms compared in literature. The proposed algorithm is a good problem-solving technique for scheduling problems.
Page(s) : 86-90
ISSN : 0976-5166
Source : Vol. 4, No.2